/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/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 01:51:13,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 01:51:13,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 01:51:14,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 01:51:14,020 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 01:51:14,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 01:51:14,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 01:51:14,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 01:51:14,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 01:51:14,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 01:51:14,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 01:51:14,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 01:51:14,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 01:51:14,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 01:51:14,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 01:51:14,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 01:51:14,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 01:51:14,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 01:51:14,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 01:51:14,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 01:51:14,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 01:51:14,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 01:51:14,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 01:51:14,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 01:51:14,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 01:51:14,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 01:51:14,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 01:51:14,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 01:51:14,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 01:51:14,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 01:51:14,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 01:51:14,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 01:51:14,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 01:51:14,040 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 01:51:14,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 01:51:14,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 01:51:14,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 01:51:14,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 01:51:14,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 01:51:14,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 01:51:14,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 01:51:14,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 01:51:14,059 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 01:51:14,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 01:51:14,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 01:51:14,060 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 01:51:14,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 01:51:14,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 01:51:14,061 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 01:51:14,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 01:51:14,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 01:51:14,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 01:51:14,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 01:51:14,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 01:51:14,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 01:51:14,062 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 01:51:14,062 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 01:51:14,063 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 01:51:14,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 01:51:14,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 01:51:14,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 01:51:14,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 01:51:14,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 01:51:14,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:51:14,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 01:51:14,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 01:51:14,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 01:51:14,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 01:51:14,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 01:51:14,065 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 01:51:14,065 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 01:51:14,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 01:51:14,065 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 01:51:14,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 01:51:14,066 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 01:51:14,066 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE 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-11 01:51:14,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 01:51:14,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 01:51:14,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 01:51:14,302 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 01:51:14,302 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 01:51:14,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c [2022-01-11 01:51:14,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/379a82182/a0f560b2979b439dbf8d6515fe675b02/FLAG597072340 [2022-01-11 01:51:14,815 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 01:51:14,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c [2022-01-11 01:51:14,838 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/379a82182/a0f560b2979b439dbf8d6515fe675b02/FLAG597072340 [2022-01-11 01:51:15,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/379a82182/a0f560b2979b439dbf8d6515fe675b02 [2022-01-11 01:51:15,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 01:51:15,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 01:51:15,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 01:51:15,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 01:51:15,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 01:51:15,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:51:15" (1/1) ... [2022-01-11 01:51:15,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e279a0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:51:15, skipping insertion in model container [2022-01-11 01:51:15,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:51:15" (1/1) ... [2022-01-11 01:51:15,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 01:51:15,248 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 01:51:15,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c[911,924] [2022-01-11 01:51:15,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c[8416,8429] [2022-01-11 01:51:15,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:51:15,461 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 01:51:15,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c[911,924] [2022-01-11 01:51:15,480 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.07.cil-2.c[8416,8429] [2022-01-11 01:51:15,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:51:15,519 INFO L208 MainTranslator]: Completed translation [2022-01-11 01:51:15,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:51:15 WrapperNode [2022-01-11 01:51:15,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 01:51:15,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 01:51:15,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 01:51:15,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 01:51:15,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:51:15" (1/1) ... [2022-01-11 01:51:15,539 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:51:15" (1/1) ... [2022-01-11 01:51:15,645 INFO L137 Inliner]: procedures = 70, calls = 83, calls flagged for inlining = 78, calls inlined = 168, statements flattened = 2405 [2022-01-11 01:51:15,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 01:51:15,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 01:51:15,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 01:51:15,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 01:51:15,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:51:15" (1/1) ... [2022-01-11 01:51:15,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:51:15" (1/1) ... [2022-01-11 01:51:15,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:51:15" (1/1) ... [2022-01-11 01:51:15,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:51:15" (1/1) ... [2022-01-11 01:51:15,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:51:15" (1/1) ... [2022-01-11 01:51:15,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:51:15" (1/1) ... [2022-01-11 01:51:15,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:51:15" (1/1) ... [2022-01-11 01:51:15,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 01:51:15,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 01:51:15,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 01:51:15,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 01:51:15,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:51:15" (1/1) ... [2022-01-11 01:51:15,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:51:15,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:51:15,760 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-11 01:51:15,776 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-11 01:51:15,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 01:51:15,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 01:51:15,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 01:51:15,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 01:51:15,874 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 01:51:15,875 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 01:51:16,962 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume !(1bv32 == ~q_free~0); [2022-01-11 01:51:16,962 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume 1bv32 == ~q_free~0;~c_dr_st~0 := 2bv32;~c_dr_pc~0 := 2bv32;~a_t~0 := do_read_c_~a~0#1; [2022-01-11 01:51:16,962 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 01:51:16,972 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 01:51:16,972 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-01-11 01:51:16,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:51:16 BoogieIcfgContainer [2022-01-11 01:51:16,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 01:51:16,975 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 01:51:16,975 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 01:51:16,976 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 01:51:16,978 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:51:16" (1/1) ... [2022-01-11 01:51:17,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:51:17 BasicIcfg [2022-01-11 01:51:17,173 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 01:51:17,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 01:51:17,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 01:51:17,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 01:51:17,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 01:51:15" (1/4) ... [2022-01-11 01:51:17,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a61377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:51:17, skipping insertion in model container [2022-01-11 01:51:17,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:51:15" (2/4) ... [2022-01-11 01:51:17,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a61377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:51:17, skipping insertion in model container [2022-01-11 01:51:17,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:51:16" (3/4) ... [2022-01-11 01:51:17,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23a61377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:51:17, skipping insertion in model container [2022-01-11 01:51:17,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:51:17" (4/4) ... [2022-01-11 01:51:17,178 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.07.cil-2.cTransformedIcfg [2022-01-11 01:51:17,181 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 01:51:17,181 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-11 01:51:17,212 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 01:51:17,217 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-11 01:51:17,217 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-11 01:51:17,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 987 states, 982 states have (on average 1.5315682281059062) internal successors, (1504), 986 states have internal predecessors, (1504), 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-11 01:51:17,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:51:17,241 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:17,242 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-11 01:51:17,242 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:17,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:17,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1978376982, now seen corresponding path program 1 times [2022-01-11 01:51:17,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:17,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166933027] [2022-01-11 01:51:17,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:17,251 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:17,513 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-11 01:51:17,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:17,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166933027] [2022-01-11 01:51:17,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166933027] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:17,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:17,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:17,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323346997] [2022-01-11 01:51:17,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:17,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:17,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:17,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:17,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:17,538 INFO L87 Difference]: Start difference. First operand has 987 states, 982 states have (on average 1.5315682281059062) internal successors, (1504), 986 states have internal predecessors, (1504), 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) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-11 01:51:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:17,742 INFO L93 Difference]: Finished difference Result 1993 states and 3032 transitions. [2022-01-11 01:51:17,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:17,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) Word has length 44 [2022-01-11 01:51:17,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:17,768 INFO L225 Difference]: With dead ends: 1993 [2022-01-11 01:51:17,768 INFO L226 Difference]: Without dead ends: 1109 [2022-01-11 01:51:17,780 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-11 01:51:17,782 INFO L933 BasicCegarLoop]: 1462 mSDtfsCounter, 185 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 2892 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:17,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 2892 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:51:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2022-01-11 01:51:17,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 1105. [2022-01-11 01:51:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1105 states, 1101 states have (on average 1.4922797456857402) internal successors, (1643), 1104 states have internal predecessors, (1643), 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-11 01:51:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1643 transitions. [2022-01-11 01:51:17,896 INFO L78 Accepts]: Start accepts. Automaton has 1105 states and 1643 transitions. Word has length 44 [2022-01-11 01:51:17,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:17,897 INFO L470 AbstractCegarLoop]: Abstraction has 1105 states and 1643 transitions. [2022-01-11 01:51:17,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-11 01:51:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1105 states and 1643 transitions. [2022-01-11 01:51:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:51:17,900 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:17,900 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-11 01:51:17,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 01:51:17,900 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:17,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash -818913514, now seen corresponding path program 1 times [2022-01-11 01:51:17,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:17,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855987340] [2022-01-11 01:51:17,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:17,901 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:18,011 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:18,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855987340] [2022-01-11 01:51:18,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855987340] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:18,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:18,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:18,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122125353] [2022-01-11 01:51:18,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:18,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:18,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:18,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:18,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:18,014 INFO L87 Difference]: Start difference. First operand 1105 states and 1643 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-11 01:51:18,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:18,081 INFO L93 Difference]: Finished difference Result 1523 states and 2248 transitions. [2022-01-11 01:51:18,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:18,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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) Word has length 44 [2022-01-11 01:51:18,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:18,086 INFO L225 Difference]: With dead ends: 1523 [2022-01-11 01:51:18,086 INFO L226 Difference]: Without dead ends: 1283 [2022-01-11 01:51:18,088 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-11 01:51:18,089 INFO L933 BasicCegarLoop]: 1447 mSDtfsCounter, 1421 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:18,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1421 Valid, 1582 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:18,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2022-01-11 01:51:18,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1275. [2022-01-11 01:51:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 1271 states have (on average 1.4775767112509834) internal successors, (1878), 1274 states have internal predecessors, (1878), 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-11 01:51:18,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1878 transitions. [2022-01-11 01:51:18,130 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1878 transitions. Word has length 44 [2022-01-11 01:51:18,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:18,131 INFO L470 AbstractCegarLoop]: Abstraction has 1275 states and 1878 transitions. [2022-01-11 01:51:18,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-11 01:51:18,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1878 transitions. [2022-01-11 01:51:18,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 01:51:18,142 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:18,142 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:18,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 01:51:18,143 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:18,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:18,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1917968111, now seen corresponding path program 1 times [2022-01-11 01:51:18,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:18,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622577084] [2022-01-11 01:51:18,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:18,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:18,227 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-11 01:51:18,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:18,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622577084] [2022-01-11 01:51:18,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622577084] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:18,229 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:18,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:18,229 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972199865] [2022-01-11 01:51:18,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:18,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:18,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:18,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:18,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:18,231 INFO L87 Difference]: Start difference. First operand 1275 states and 1878 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11 01:51:18,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:18,296 INFO L93 Difference]: Finished difference Result 1997 states and 2912 transitions. [2022-01-11 01:51:18,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:18,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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) Word has length 45 [2022-01-11 01:51:18,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:18,302 INFO L225 Difference]: With dead ends: 1997 [2022-01-11 01:51:18,302 INFO L226 Difference]: Without dead ends: 1601 [2022-01-11 01:51:18,305 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-11 01:51:18,308 INFO L933 BasicCegarLoop]: 1441 mSDtfsCounter, 1405 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:18,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1405 Valid, 1579 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-01-11 01:51:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1593. [2022-01-11 01:51:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1589 states have (on average 1.4543738200125866) internal successors, (2311), 1592 states have internal predecessors, (2311), 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-11 01:51:18,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2311 transitions. [2022-01-11 01:51:18,350 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2311 transitions. Word has length 45 [2022-01-11 01:51:18,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:18,350 INFO L470 AbstractCegarLoop]: Abstraction has 1593 states and 2311 transitions. [2022-01-11 01:51:18,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-11 01:51:18,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2311 transitions. [2022-01-11 01:51:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-11 01:51:18,351 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:18,351 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 01:51:18,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 01:51:18,352 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:18,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:18,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2073230074, now seen corresponding path program 1 times [2022-01-11 01:51:18,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:18,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752761418] [2022-01-11 01:51:18,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:18,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 01:51:18,440 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:18,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752761418] [2022-01-11 01:51:18,440 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752761418] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:18,440 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:18,440 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:18,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564905090] [2022-01-11 01:51:18,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:18,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:18,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:18,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:18,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:18,441 INFO L87 Difference]: Start difference. First operand 1593 states and 2311 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-11 01:51:18,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:18,512 INFO L93 Difference]: Finished difference Result 2961 states and 4213 transitions. [2022-01-11 01:51:18,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:18,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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) Word has length 59 [2022-01-11 01:51:18,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:18,519 INFO L225 Difference]: With dead ends: 2961 [2022-01-11 01:51:18,519 INFO L226 Difference]: Without dead ends: 2265 [2022-01-11 01:51:18,522 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-11 01:51:18,526 INFO L933 BasicCegarLoop]: 1444 mSDtfsCounter, 1400 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1400 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:18,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1400 Valid, 1609 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:18,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2022-01-11 01:51:18,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2261. [2022-01-11 01:51:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2257 states have (on average 1.416482055826318) internal successors, (3197), 2260 states have internal predecessors, (3197), 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-11 01:51:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3197 transitions. [2022-01-11 01:51:18,581 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3197 transitions. Word has length 59 [2022-01-11 01:51:18,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:18,582 INFO L470 AbstractCegarLoop]: Abstraction has 2261 states and 3197 transitions. [2022-01-11 01:51:18,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-11 01:51:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3197 transitions. [2022-01-11 01:51:18,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-11 01:51:18,584 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:18,584 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 01:51:18,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 01:51:18,585 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:18,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:18,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1473288298, now seen corresponding path program 1 times [2022-01-11 01:51:18,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:18,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077387121] [2022-01-11 01:51:18,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:18,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:18,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:18,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077387121] [2022-01-11 01:51:18,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077387121] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:18,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:18,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:18,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929793832] [2022-01-11 01:51:18,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:18,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:18,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:18,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:18,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:18,658 INFO L87 Difference]: Start difference. First operand 2261 states and 3197 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-11 01:51:18,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:18,748 INFO L93 Difference]: Finished difference Result 4885 states and 6779 transitions. [2022-01-11 01:51:18,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:18,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) Word has length 61 [2022-01-11 01:51:18,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:18,758 INFO L225 Difference]: With dead ends: 4885 [2022-01-11 01:51:18,759 INFO L226 Difference]: Without dead ends: 3565 [2022-01-11 01:51:18,761 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-11 01:51:18,761 INFO L933 BasicCegarLoop]: 1595 mSDtfsCounter, 146 mSDsluCounter, 1431 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 3026 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:18,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 3026 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3565 states. [2022-01-11 01:51:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3565 to 3565. [2022-01-11 01:51:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3565 states, 3561 states have (on average 1.3830384723392306) internal successors, (4925), 3564 states have internal predecessors, (4925), 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-11 01:51:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 4925 transitions. [2022-01-11 01:51:18,903 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 4925 transitions. Word has length 61 [2022-01-11 01:51:18,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:18,905 INFO L470 AbstractCegarLoop]: Abstraction has 3565 states and 4925 transitions. [2022-01-11 01:51:18,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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-11 01:51:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 4925 transitions. [2022-01-11 01:51:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-11 01:51:18,911 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:18,911 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:18,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 01:51:18,912 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:18,912 INFO L85 PathProgramCache]: Analyzing trace with hash 312292104, now seen corresponding path program 1 times [2022-01-11 01:51:18,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:18,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511148915] [2022-01-11 01:51:18,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:18,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-11 01:51:18,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:18,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511148915] [2022-01-11 01:51:18,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511148915] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:18,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:18,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:18,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836919194] [2022-01-11 01:51:18,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:18,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:18,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:18,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:18,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:18,989 INFO L87 Difference]: Start difference. First operand 3565 states and 4925 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-11 01:51:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:19,151 INFO L93 Difference]: Finished difference Result 8645 states and 11809 transitions. [2022-01-11 01:51:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:19,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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) Word has length 103 [2022-01-11 01:51:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:19,168 INFO L225 Difference]: With dead ends: 8645 [2022-01-11 01:51:19,169 INFO L226 Difference]: Without dead ends: 6105 [2022-01-11 01:51:19,172 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-11 01:51:19,173 INFO L933 BasicCegarLoop]: 1445 mSDtfsCounter, 131 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 2843 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:19,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 2843 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:19,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6105 states. [2022-01-11 01:51:19,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6105 to 6101. [2022-01-11 01:51:19,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6101 states, 6097 states have (on average 1.361489257011645) internal successors, (8301), 6100 states have internal predecessors, (8301), 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-11 01:51:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6101 states to 6101 states and 8301 transitions. [2022-01-11 01:51:19,337 INFO L78 Accepts]: Start accepts. Automaton has 6101 states and 8301 transitions. Word has length 103 [2022-01-11 01:51:19,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:19,338 INFO L470 AbstractCegarLoop]: Abstraction has 6101 states and 8301 transitions. [2022-01-11 01:51:19,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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-11 01:51:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 6101 states and 8301 transitions. [2022-01-11 01:51:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-11 01:51:19,346 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:19,347 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:19,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 01:51:19,347 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:19,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:19,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1694841125, now seen corresponding path program 1 times [2022-01-11 01:51:19,347 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:19,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050177221] [2022-01-11 01:51:19,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:19,348 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:19,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:19,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050177221] [2022-01-11 01:51:19,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050177221] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:19,404 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:19,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:19,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563192447] [2022-01-11 01:51:19,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:19,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:19,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:19,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:19,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:19,406 INFO L87 Difference]: Start difference. First operand 6101 states and 8301 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-11 01:51:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:19,531 INFO L93 Difference]: Finished difference Result 8669 states and 11805 transitions. [2022-01-11 01:51:19,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:19,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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) Word has length 104 [2022-01-11 01:51:19,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:19,535 INFO L225 Difference]: With dead ends: 8669 [2022-01-11 01:51:19,535 INFO L226 Difference]: Without dead ends: 840 [2022-01-11 01:51:19,542 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-11 01:51:19,543 INFO L933 BasicCegarLoop]: 1551 mSDtfsCounter, 112 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 2965 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:19,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 2965 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-01-11 01:51:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2022-01-11 01:51:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 838 states have (on average 1.4976133651551313) internal successors, (1255), 839 states have internal predecessors, (1255), 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-11 01:51:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1255 transitions. [2022-01-11 01:51:19,557 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1255 transitions. Word has length 104 [2022-01-11 01:51:19,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:19,558 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 1255 transitions. [2022-01-11 01:51:19,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-11 01:51:19,558 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1255 transitions. [2022-01-11 01:51:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:51:19,558 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:19,558 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:19,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 01:51:19,559 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:19,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:19,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1398386668, now seen corresponding path program 1 times [2022-01-11 01:51:19,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:19,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738850684] [2022-01-11 01:51:19,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:19,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:19,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:19,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738850684] [2022-01-11 01:51:19,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738850684] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:19,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:19,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:19,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281137411] [2022-01-11 01:51:19,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:19,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:19,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:19,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:19,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:19,591 INFO L87 Difference]: Start difference. First operand 840 states and 1255 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-11 01:51:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:19,614 INFO L93 Difference]: Finished difference Result 1668 states and 2491 transitions. [2022-01-11 01:51:19,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:19,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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) Word has length 110 [2022-01-11 01:51:19,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:19,617 INFO L225 Difference]: With dead ends: 1668 [2022-01-11 01:51:19,617 INFO L226 Difference]: Without dead ends: 840 [2022-01-11 01:51:19,618 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-11 01:51:19,619 INFO L933 BasicCegarLoop]: 1253 mSDtfsCounter, 1243 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:19,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1243 Valid, 1254 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-01-11 01:51:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 840. [2022-01-11 01:51:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 838 states have (on average 1.496420047732697) internal successors, (1254), 839 states have internal predecessors, (1254), 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-11 01:51:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1254 transitions. [2022-01-11 01:51:19,649 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1254 transitions. Word has length 110 [2022-01-11 01:51:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:19,649 INFO L470 AbstractCegarLoop]: Abstraction has 840 states and 1254 transitions. [2022-01-11 01:51:19,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-11 01:51:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1254 transitions. [2022-01-11 01:51:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:51:19,650 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:19,650 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:19,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 01:51:19,651 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:19,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:19,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1913907117, now seen corresponding path program 1 times [2022-01-11 01:51:19,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:19,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179278249] [2022-01-11 01:51:19,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:19,651 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:19,685 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-11 01:51:19,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:19,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179278249] [2022-01-11 01:51:19,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179278249] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:19,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:19,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:19,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346626020] [2022-01-11 01:51:19,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:19,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:19,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:19,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:19,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:19,687 INFO L87 Difference]: Start difference. First operand 840 states and 1254 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:19,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:19,741 INFO L93 Difference]: Finished difference Result 2343 states and 3489 transitions. [2022-01-11 01:51:19,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:19,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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) Word has length 110 [2022-01-11 01:51:19,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:19,745 INFO L225 Difference]: With dead ends: 2343 [2022-01-11 01:51:19,745 INFO L226 Difference]: Without dead ends: 1518 [2022-01-11 01:51:19,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 01:51:19,748 INFO L933 BasicCegarLoop]: 1248 mSDtfsCounter, 1152 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:19,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1152 Valid, 2328 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:19,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2022-01-11 01:51:19,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1514. [2022-01-11 01:51:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1512 states have (on average 1.4894179894179893) internal successors, (2252), 1513 states have internal predecessors, (2252), 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-11 01:51:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2252 transitions. [2022-01-11 01:51:19,781 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2252 transitions. Word has length 110 [2022-01-11 01:51:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:19,783 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2252 transitions. [2022-01-11 01:51:19,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:19,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2252 transitions. [2022-01-11 01:51:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:51:19,784 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:19,784 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:19,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 01:51:19,785 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:19,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2091472781, now seen corresponding path program 1 times [2022-01-11 01:51:19,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:19,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217471688] [2022-01-11 01:51:19,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:19,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:19,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:19,824 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-11 01:51:19,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:19,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217471688] [2022-01-11 01:51:19,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217471688] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:19,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:19,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:19,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685006848] [2022-01-11 01:51:19,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:19,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:19,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:19,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:19,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:19,826 INFO L87 Difference]: Start difference. First operand 1514 states and 2252 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:19,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:19,865 INFO L93 Difference]: Finished difference Result 3012 states and 4480 transitions. [2022-01-11 01:51:19,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:19,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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) Word has length 110 [2022-01-11 01:51:19,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:19,870 INFO L225 Difference]: With dead ends: 3012 [2022-01-11 01:51:19,870 INFO L226 Difference]: Without dead ends: 1514 [2022-01-11 01:51:19,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 01:51:19,872 INFO L933 BasicCegarLoop]: 1242 mSDtfsCounter, 1232 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:19,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1232 Valid, 1242 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-01-11 01:51:19,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-01-11 01:51:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1512 states have (on average 1.4841269841269842) internal successors, (2244), 1513 states have internal predecessors, (2244), 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-11 01:51:19,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2244 transitions. [2022-01-11 01:51:19,906 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2244 transitions. Word has length 110 [2022-01-11 01:51:19,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:19,906 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2244 transitions. [2022-01-11 01:51:19,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:19,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2244 transitions. [2022-01-11 01:51:19,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:51:19,907 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:19,907 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:19,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 01:51:19,908 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:19,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:19,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1404464045, now seen corresponding path program 1 times [2022-01-11 01:51:19,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:19,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122741536] [2022-01-11 01:51:19,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:19,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:19,936 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-11 01:51:19,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:19,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122741536] [2022-01-11 01:51:19,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122741536] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:19,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:19,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:19,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135853029] [2022-01-11 01:51:19,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:19,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:19,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:19,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:19,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:19,938 INFO L87 Difference]: Start difference. First operand 1514 states and 2244 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:19,984 INFO L93 Difference]: Finished difference Result 3011 states and 4463 transitions. [2022-01-11 01:51:19,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:19,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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) Word has length 110 [2022-01-11 01:51:19,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:19,989 INFO L225 Difference]: With dead ends: 3011 [2022-01-11 01:51:19,989 INFO L226 Difference]: Without dead ends: 1514 [2022-01-11 01:51:19,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 01:51:19,991 INFO L933 BasicCegarLoop]: 1237 mSDtfsCounter, 1226 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:19,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1226 Valid, 1237 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:19,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-01-11 01:51:20,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-01-11 01:51:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1512 states have (on average 1.4788359788359788) internal successors, (2236), 1513 states have internal predecessors, (2236), 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-11 01:51:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2236 transitions. [2022-01-11 01:51:20,040 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2236 transitions. Word has length 110 [2022-01-11 01:51:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:20,041 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2236 transitions. [2022-01-11 01:51:20,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2236 transitions. [2022-01-11 01:51:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:51:20,042 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:20,042 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:51:20,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 01:51:20,042 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:20,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:20,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1520849805, now seen corresponding path program 1 times [2022-01-11 01:51:20,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:20,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250412025] [2022-01-11 01:51:20,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:20,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:20,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:20,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250412025] [2022-01-11 01:51:20,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250412025] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:20,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:20,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:20,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512195743] [2022-01-11 01:51:20,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:20,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:20,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:20,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:20,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:20,077 INFO L87 Difference]: Start difference. First operand 1514 states and 2236 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:20,136 INFO L93 Difference]: Finished difference Result 3010 states and 4446 transitions. [2022-01-11 01:51:20,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:20,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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) Word has length 110 [2022-01-11 01:51:20,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:20,140 INFO L225 Difference]: With dead ends: 3010 [2022-01-11 01:51:20,140 INFO L226 Difference]: Without dead ends: 1514 [2022-01-11 01:51:20,142 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 01:51:20,144 INFO L933 BasicCegarLoop]: 1232 mSDtfsCounter, 1220 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:20,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1220 Valid, 1232 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:20,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-01-11 01:51:20,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-01-11 01:51:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1512 states have (on average 1.4735449735449735) internal successors, (2228), 1513 states have internal predecessors, (2228), 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-11 01:51:20,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2228 transitions. [2022-01-11 01:51:20,176 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2228 transitions. Word has length 110 [2022-01-11 01:51:20,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:20,177 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2228 transitions. [2022-01-11 01:51:20,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:20,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2228 transitions. [2022-01-11 01:51:20,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:51:20,178 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:20,178 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:20,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 01:51:20,178 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:20,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:20,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2077626451, now seen corresponding path program 1 times [2022-01-11 01:51:20,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:20,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110937664] [2022-01-11 01:51:20,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:20,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:20,206 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-11 01:51:20,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:20,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110937664] [2022-01-11 01:51:20,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110937664] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:20,207 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:20,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:20,207 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962855129] [2022-01-11 01:51:20,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:20,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:20,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:20,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:20,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:20,208 INFO L87 Difference]: Start difference. First operand 1514 states and 2228 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:20,248 INFO L93 Difference]: Finished difference Result 3009 states and 4429 transitions. [2022-01-11 01:51:20,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:20,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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) Word has length 110 [2022-01-11 01:51:20,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:20,264 INFO L225 Difference]: With dead ends: 3009 [2022-01-11 01:51:20,264 INFO L226 Difference]: Without dead ends: 1514 [2022-01-11 01:51:20,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 01:51:20,267 INFO L933 BasicCegarLoop]: 1227 mSDtfsCounter, 1214 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:20,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1214 Valid, 1227 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:20,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-01-11 01:51:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-01-11 01:51:20,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1512 states have (on average 1.4682539682539681) internal successors, (2220), 1513 states have internal predecessors, (2220), 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-11 01:51:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2220 transitions. [2022-01-11 01:51:20,303 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2220 transitions. Word has length 110 [2022-01-11 01:51:20,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:20,303 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2220 transitions. [2022-01-11 01:51:20,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2220 transitions. [2022-01-11 01:51:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:51:20,304 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:20,304 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:20,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 01:51:20,304 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:20,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:20,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1269976973, now seen corresponding path program 1 times [2022-01-11 01:51:20,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:20,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698005763] [2022-01-11 01:51:20,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:20,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:20,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:20,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:20,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698005763] [2022-01-11 01:51:20,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698005763] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:20,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:20,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:20,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732913895] [2022-01-11 01:51:20,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:20,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:20,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:20,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:20,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:20,341 INFO L87 Difference]: Start difference. First operand 1514 states and 2220 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:20,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:20,392 INFO L93 Difference]: Finished difference Result 3008 states and 4412 transitions. [2022-01-11 01:51:20,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:20,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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) Word has length 110 [2022-01-11 01:51:20,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:20,395 INFO L225 Difference]: With dead ends: 3008 [2022-01-11 01:51:20,396 INFO L226 Difference]: Without dead ends: 1514 [2022-01-11 01:51:20,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 01:51:20,398 INFO L933 BasicCegarLoop]: 1222 mSDtfsCounter, 1208 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:20,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1208 Valid, 1222 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:20,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-01-11 01:51:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-01-11 01:51:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1512 states have (on average 1.462962962962963) internal successors, (2212), 1513 states have internal predecessors, (2212), 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-11 01:51:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2212 transitions. [2022-01-11 01:51:20,439 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2212 transitions. Word has length 110 [2022-01-11 01:51:20,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:20,439 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2212 transitions. [2022-01-11 01:51:20,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:20,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2212 transitions. [2022-01-11 01:51:20,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:51:20,440 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:20,440 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:20,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 01:51:20,440 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:20,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:20,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2085719123, now seen corresponding path program 1 times [2022-01-11 01:51:20,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:20,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958363990] [2022-01-11 01:51:20,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:20,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:20,468 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-11 01:51:20,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:20,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958363990] [2022-01-11 01:51:20,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958363990] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:20,469 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:20,469 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:20,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729019953] [2022-01-11 01:51:20,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:20,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:20,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:20,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:20,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:20,470 INFO L87 Difference]: Start difference. First operand 1514 states and 2212 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:20,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:20,532 INFO L93 Difference]: Finished difference Result 3007 states and 4395 transitions. [2022-01-11 01:51:20,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:20,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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) Word has length 110 [2022-01-11 01:51:20,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:20,535 INFO L225 Difference]: With dead ends: 3007 [2022-01-11 01:51:20,535 INFO L226 Difference]: Without dead ends: 1514 [2022-01-11 01:51:20,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 01:51:20,538 INFO L933 BasicCegarLoop]: 1217 mSDtfsCounter, 1202 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:20,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1202 Valid, 1217 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:20,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-01-11 01:51:20,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-01-11 01:51:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1512 states have (on average 1.4576719576719577) internal successors, (2204), 1513 states have internal predecessors, (2204), 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-11 01:51:20,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2204 transitions. [2022-01-11 01:51:20,595 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2204 transitions. Word has length 110 [2022-01-11 01:51:20,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:20,595 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2204 transitions. [2022-01-11 01:51:20,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:20,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2204 transitions. [2022-01-11 01:51:20,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:51:20,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:20,596 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:20,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 01:51:20,596 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:20,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:20,597 INFO L85 PathProgramCache]: Analyzing trace with hash 947041395, now seen corresponding path program 1 times [2022-01-11 01:51:20,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:20,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484363525] [2022-01-11 01:51:20,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:20,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:20,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:20,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:20,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:20,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484363525] [2022-01-11 01:51:20,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484363525] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:20,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:20,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:20,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373620215] [2022-01-11 01:51:20,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:20,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:20,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:20,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:20,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:20,629 INFO L87 Difference]: Start difference. First operand 1514 states and 2204 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:20,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:20,692 INFO L93 Difference]: Finished difference Result 3006 states and 4378 transitions. [2022-01-11 01:51:20,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:20,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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) Word has length 110 [2022-01-11 01:51:20,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:20,694 INFO L225 Difference]: With dead ends: 3006 [2022-01-11 01:51:20,695 INFO L226 Difference]: Without dead ends: 1514 [2022-01-11 01:51:20,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 01:51:20,697 INFO L933 BasicCegarLoop]: 1212 mSDtfsCounter, 1196 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:20,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1196 Valid, 1212 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:20,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-01-11 01:51:20,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-01-11 01:51:20,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1512 states have (on average 1.4523809523809523) internal successors, (2196), 1513 states have internal predecessors, (2196), 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-11 01:51:20,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2196 transitions. [2022-01-11 01:51:20,741 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2196 transitions. Word has length 110 [2022-01-11 01:51:20,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:20,742 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2196 transitions. [2022-01-11 01:51:20,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:20,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2196 transitions. [2022-01-11 01:51:20,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:51:20,742 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:20,742 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:20,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 01:51:20,743 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:20,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:20,743 INFO L85 PathProgramCache]: Analyzing trace with hash 494667859, now seen corresponding path program 1 times [2022-01-11 01:51:20,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:20,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075211573] [2022-01-11 01:51:20,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:20,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:20,775 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-11 01:51:20,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:20,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075211573] [2022-01-11 01:51:20,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075211573] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:20,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:20,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:20,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25986667] [2022-01-11 01:51:20,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:20,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:20,776 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:20,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:20,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:20,777 INFO L87 Difference]: Start difference. First operand 1514 states and 2196 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:20,854 INFO L93 Difference]: Finished difference Result 3004 states and 4359 transitions. [2022-01-11 01:51:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:20,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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) Word has length 110 [2022-01-11 01:51:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:20,857 INFO L225 Difference]: With dead ends: 3004 [2022-01-11 01:51:20,857 INFO L226 Difference]: Without dead ends: 1514 [2022-01-11 01:51:20,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 01:51:20,859 INFO L933 BasicCegarLoop]: 1187 mSDtfsCounter, 1097 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:20,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1097 Valid, 1265 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:20,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-01-11 01:51:20,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-01-11 01:51:20,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1512 states have (on average 1.4351851851851851) internal successors, (2170), 1513 states have internal predecessors, (2170), 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-11 01:51:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2170 transitions. [2022-01-11 01:51:20,903 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2170 transitions. Word has length 110 [2022-01-11 01:51:20,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:20,903 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2170 transitions. [2022-01-11 01:51:20,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2170 transitions. [2022-01-11 01:51:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:51:20,904 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:20,904 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:20,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 01:51:20,905 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:20,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:20,905 INFO L85 PathProgramCache]: Analyzing trace with hash -567663374, now seen corresponding path program 1 times [2022-01-11 01:51:20,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:20,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448942352] [2022-01-11 01:51:20,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:20,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:20,931 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-11 01:51:20,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:20,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448942352] [2022-01-11 01:51:20,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448942352] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:20,932 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:20,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:20,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421310374] [2022-01-11 01:51:20,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:20,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:20,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:20,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:20,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:20,933 INFO L87 Difference]: Start difference. First operand 1514 states and 2170 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:21,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:21,006 INFO L93 Difference]: Finished difference Result 3003 states and 4306 transitions. [2022-01-11 01:51:21,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:21,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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) Word has length 110 [2022-01-11 01:51:21,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:21,008 INFO L225 Difference]: With dead ends: 3003 [2022-01-11 01:51:21,008 INFO L226 Difference]: Without dead ends: 1514 [2022-01-11 01:51:21,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 01:51:21,010 INFO L933 BasicCegarLoop]: 1172 mSDtfsCounter, 1082 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:21,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1082 Valid, 1249 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:21,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-01-11 01:51:21,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-01-11 01:51:21,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1512 states have (on average 1.417989417989418) internal successors, (2144), 1513 states have internal predecessors, (2144), 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-11 01:51:21,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2144 transitions. [2022-01-11 01:51:21,054 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2144 transitions. Word has length 110 [2022-01-11 01:51:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:21,054 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2144 transitions. [2022-01-11 01:51:21,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:21,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2144 transitions. [2022-01-11 01:51:21,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:51:21,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:21,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:21,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 01:51:21,055 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:21,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:21,056 INFO L85 PathProgramCache]: Analyzing trace with hash -528160495, now seen corresponding path program 1 times [2022-01-11 01:51:21,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:21,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613349601] [2022-01-11 01:51:21,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:21,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:21,080 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-11 01:51:21,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:21,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613349601] [2022-01-11 01:51:21,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613349601] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:21,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:21,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:21,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209096089] [2022-01-11 01:51:21,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:21,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:21,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:21,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:21,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:21,082 INFO L87 Difference]: Start difference. First operand 1514 states and 2144 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:21,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:21,147 INFO L93 Difference]: Finished difference Result 3002 states and 4253 transitions. [2022-01-11 01:51:21,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:21,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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) Word has length 110 [2022-01-11 01:51:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:21,149 INFO L225 Difference]: With dead ends: 3002 [2022-01-11 01:51:21,150 INFO L226 Difference]: Without dead ends: 1514 [2022-01-11 01:51:21,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 01:51:21,151 INFO L933 BasicCegarLoop]: 1157 mSDtfsCounter, 1067 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:21,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1067 Valid, 1233 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:21,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-01-11 01:51:21,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-01-11 01:51:21,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1512 states have (on average 1.4007936507936507) internal successors, (2118), 1513 states have internal predecessors, (2118), 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-11 01:51:21,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2118 transitions. [2022-01-11 01:51:21,195 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2118 transitions. Word has length 110 [2022-01-11 01:51:21,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:21,195 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2118 transitions. [2022-01-11 01:51:21,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:21,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2118 transitions. [2022-01-11 01:51:21,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:51:21,196 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:21,196 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:51:21,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 01:51:21,196 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:21,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:21,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1183867952, now seen corresponding path program 1 times [2022-01-11 01:51:21,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:21,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052428617] [2022-01-11 01:51:21,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:21,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:21,221 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-11 01:51:21,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:21,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052428617] [2022-01-11 01:51:21,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052428617] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:21,221 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:21,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:21,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133530193] [2022-01-11 01:51:21,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:21,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:21,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:21,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:21,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:21,222 INFO L87 Difference]: Start difference. First operand 1514 states and 2118 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:21,291 INFO L93 Difference]: Finished difference Result 3001 states and 4200 transitions. [2022-01-11 01:51:21,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:21,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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) Word has length 110 [2022-01-11 01:51:21,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:21,293 INFO L225 Difference]: With dead ends: 3001 [2022-01-11 01:51:21,294 INFO L226 Difference]: Without dead ends: 1514 [2022-01-11 01:51:21,295 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 01:51:21,296 INFO L933 BasicCegarLoop]: 1142 mSDtfsCounter, 1052 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:21,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1052 Valid, 1217 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:21,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-01-11 01:51:21,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-01-11 01:51:21,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1512 states have (on average 1.3835978835978835) internal successors, (2092), 1513 states have internal predecessors, (2092), 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-11 01:51:21,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2092 transitions. [2022-01-11 01:51:21,357 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2092 transitions. Word has length 110 [2022-01-11 01:51:21,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:21,357 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2092 transitions. [2022-01-11 01:51:21,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2092 transitions. [2022-01-11 01:51:21,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:51:21,358 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:21,358 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:21,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 01:51:21,358 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:21,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:21,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1178241329, now seen corresponding path program 1 times [2022-01-11 01:51:21,359 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:21,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117575458] [2022-01-11 01:51:21,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:21,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:21,401 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-11 01:51:21,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:21,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117575458] [2022-01-11 01:51:21,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117575458] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:21,402 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:21,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:21,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578179047] [2022-01-11 01:51:21,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:21,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:21,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:21,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:21,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:21,403 INFO L87 Difference]: Start difference. First operand 1514 states and 2092 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:21,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:21,470 INFO L93 Difference]: Finished difference Result 3000 states and 4147 transitions. [2022-01-11 01:51:21,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:21,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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) Word has length 110 [2022-01-11 01:51:21,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:21,472 INFO L225 Difference]: With dead ends: 3000 [2022-01-11 01:51:21,472 INFO L226 Difference]: Without dead ends: 1514 [2022-01-11 01:51:21,474 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 01:51:21,474 INFO L933 BasicCegarLoop]: 1127 mSDtfsCounter, 1037 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:21,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1037 Valid, 1201 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:21,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-01-11 01:51:21,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-01-11 01:51:21,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1512 states have (on average 1.3664021164021165) internal successors, (2066), 1513 states have internal predecessors, (2066), 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-11 01:51:21,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2066 transitions. [2022-01-11 01:51:21,525 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2066 transitions. Word has length 110 [2022-01-11 01:51:21,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:21,525 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2066 transitions. [2022-01-11 01:51:21,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:21,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2066 transitions. [2022-01-11 01:51:21,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:51:21,526 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:21,526 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:21,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 01:51:21,527 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:21,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:21,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1728966546, now seen corresponding path program 1 times [2022-01-11 01:51:21,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:21,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603854171] [2022-01-11 01:51:21,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:21,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:21,554 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-11 01:51:21,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:21,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603854171] [2022-01-11 01:51:21,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603854171] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:21,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:21,555 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:21,555 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140235353] [2022-01-11 01:51:21,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:21,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:21,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:21,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:21,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:21,556 INFO L87 Difference]: Start difference. First operand 1514 states and 2066 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:21,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:21,623 INFO L93 Difference]: Finished difference Result 2999 states and 4094 transitions. [2022-01-11 01:51:21,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:21,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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) Word has length 110 [2022-01-11 01:51:21,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:21,626 INFO L225 Difference]: With dead ends: 2999 [2022-01-11 01:51:21,626 INFO L226 Difference]: Without dead ends: 1514 [2022-01-11 01:51:21,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 01:51:21,629 INFO L933 BasicCegarLoop]: 1112 mSDtfsCounter, 1022 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:21,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1022 Valid, 1185 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:21,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-01-11 01:51:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-01-11 01:51:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1512 states have (on average 1.3492063492063493) internal successors, (2040), 1513 states have internal predecessors, (2040), 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-11 01:51:21,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2040 transitions. [2022-01-11 01:51:21,676 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2040 transitions. Word has length 110 [2022-01-11 01:51:21,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:21,676 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2040 transitions. [2022-01-11 01:51:21,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:21,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2040 transitions. [2022-01-11 01:51:21,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:51:21,677 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:21,677 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:21,677 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 01:51:21,677 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:21,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:21,678 INFO L85 PathProgramCache]: Analyzing trace with hash 207171981, now seen corresponding path program 1 times [2022-01-11 01:51:21,678 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:21,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830503576] [2022-01-11 01:51:21,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:21,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:21,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:21,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830503576] [2022-01-11 01:51:21,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830503576] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:21,705 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:21,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:21,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106762939] [2022-01-11 01:51:21,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:21,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:21,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:21,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:21,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:21,707 INFO L87 Difference]: Start difference. First operand 1514 states and 2040 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:21,799 INFO L93 Difference]: Finished difference Result 2998 states and 4041 transitions. [2022-01-11 01:51:21,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:21,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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) Word has length 110 [2022-01-11 01:51:21,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:21,802 INFO L225 Difference]: With dead ends: 2998 [2022-01-11 01:51:21,802 INFO L226 Difference]: Without dead ends: 1514 [2022-01-11 01:51:21,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 01:51:21,804 INFO L933 BasicCegarLoop]: 1097 mSDtfsCounter, 1007 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1007 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:21,804 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1007 Valid, 1169 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:21,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2022-01-11 01:51:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1514. [2022-01-11 01:51:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1512 states have (on average 1.332010582010582) internal successors, (2014), 1513 states have internal predecessors, (2014), 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-11 01:51:21,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2014 transitions. [2022-01-11 01:51:21,858 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2014 transitions. Word has length 110 [2022-01-11 01:51:21,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:21,858 INFO L470 AbstractCegarLoop]: Abstraction has 1514 states and 2014 transitions. [2022-01-11 01:51:21,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2014 transitions. [2022-01-11 01:51:21,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:51:21,859 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:21,859 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:21,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 01:51:21,859 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:21,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:21,860 INFO L85 PathProgramCache]: Analyzing trace with hash -896882260, now seen corresponding path program 1 times [2022-01-11 01:51:21,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:21,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364830055] [2022-01-11 01:51:21,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:21,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:21,899 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-11 01:51:21,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:21,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364830055] [2022-01-11 01:51:21,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364830055] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:21,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:21,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:21,900 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138382902] [2022-01-11 01:51:21,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:21,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:21,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:21,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:21,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:21,900 INFO L87 Difference]: Start difference. First operand 1514 states and 2014 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:22,019 INFO L93 Difference]: Finished difference Result 4366 states and 5799 transitions. [2022-01-11 01:51:22,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:22,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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) Word has length 110 [2022-01-11 01:51:22,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:22,024 INFO L225 Difference]: With dead ends: 4366 [2022-01-11 01:51:22,024 INFO L226 Difference]: Without dead ends: 2884 [2022-01-11 01:51:22,026 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 01:51:22,028 INFO L933 BasicCegarLoop]: 1097 mSDtfsCounter, 1029 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:22,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1029 Valid, 2054 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:22,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2884 states. [2022-01-11 01:51:22,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2884 to 2774. [2022-01-11 01:51:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2774 states, 2772 states have (on average 1.321067821067821) internal successors, (3662), 2773 states have internal predecessors, (3662), 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-11 01:51:22,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 3662 transitions. [2022-01-11 01:51:22,177 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 3662 transitions. Word has length 110 [2022-01-11 01:51:22,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:22,177 INFO L470 AbstractCegarLoop]: Abstraction has 2774 states and 3662 transitions. [2022-01-11 01:51:22,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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-11 01:51:22,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 3662 transitions. [2022-01-11 01:51:22,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-11 01:51:22,179 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:22,180 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:51:22,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 01:51:22,180 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:22,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:22,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1429175119, now seen corresponding path program 1 times [2022-01-11 01:51:22,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:22,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804599440] [2022-01-11 01:51:22,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:22,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:51:22,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:22,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804599440] [2022-01-11 01:51:22,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804599440] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:22,237 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:22,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:51:22,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185098071] [2022-01-11 01:51:22,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:22,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:51:22,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:22,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:51:22,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:51:22,239 INFO L87 Difference]: Start difference. First operand 2774 states and 3662 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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-11 01:51:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:22,606 INFO L93 Difference]: Finished difference Result 8169 states and 10789 transitions. [2022-01-11 01:51:22,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:51:22,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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) Word has length 178 [2022-01-11 01:51:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:22,615 INFO L225 Difference]: With dead ends: 8169 [2022-01-11 01:51:22,615 INFO L226 Difference]: Without dead ends: 5431 [2022-01-11 01:51:22,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:51:22,620 INFO L933 BasicCegarLoop]: 1075 mSDtfsCounter, 3840 mSDsluCounter, 4347 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3840 SdHoareTripleChecker+Valid, 5422 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:22,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3840 Valid, 5422 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:51:22,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5431 states. [2022-01-11 01:51:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5431 to 2831. [2022-01-11 01:51:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2831 states, 2829 states have (on average 1.3082361258395192) internal successors, (3701), 2830 states have internal predecessors, (3701), 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-11 01:51:22,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2831 states to 2831 states and 3701 transitions. [2022-01-11 01:51:22,788 INFO L78 Accepts]: Start accepts. Automaton has 2831 states and 3701 transitions. Word has length 178 [2022-01-11 01:51:22,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:22,788 INFO L470 AbstractCegarLoop]: Abstraction has 2831 states and 3701 transitions. [2022-01-11 01:51:22,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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-11 01:51:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 2831 states and 3701 transitions. [2022-01-11 01:51:22,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-11 01:51:22,791 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:22,792 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:51:22,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 01:51:22,792 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:22,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:22,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2058987789, now seen corresponding path program 1 times [2022-01-11 01:51:22,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:22,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97657857] [2022-01-11 01:51:22,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:22,793 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:22,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:51:22,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:22,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97657857] [2022-01-11 01:51:22,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97657857] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:22,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:22,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:51:22,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618462904] [2022-01-11 01:51:22,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:22,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:51:22,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:22,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:51:22,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:51:22,844 INFO L87 Difference]: Start difference. First operand 2831 states and 3701 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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-11 01:51:23,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:23,150 INFO L93 Difference]: Finished difference Result 7216 states and 9504 transitions. [2022-01-11 01:51:23,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:51:23,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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) Word has length 178 [2022-01-11 01:51:23,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:23,169 INFO L225 Difference]: With dead ends: 7216 [2022-01-11 01:51:23,169 INFO L226 Difference]: Without dead ends: 4435 [2022-01-11 01:51:23,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:51:23,172 INFO L933 BasicCegarLoop]: 1162 mSDtfsCounter, 2881 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2881 SdHoareTripleChecker+Valid, 2948 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:23,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2881 Valid, 2948 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:51:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4435 states. [2022-01-11 01:51:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4435 to 2843. [2022-01-11 01:51:23,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2843 states, 2841 states have (on average 1.2953185498064061) internal successors, (3680), 2842 states have internal predecessors, (3680), 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-11 01:51:23,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2843 states to 2843 states and 3680 transitions. [2022-01-11 01:51:23,338 INFO L78 Accepts]: Start accepts. Automaton has 2843 states and 3680 transitions. Word has length 178 [2022-01-11 01:51:23,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:23,338 INFO L470 AbstractCegarLoop]: Abstraction has 2843 states and 3680 transitions. [2022-01-11 01:51:23,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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-11 01:51:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2843 states and 3680 transitions. [2022-01-11 01:51:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-11 01:51:23,340 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:23,341 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:51:23,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 01:51:23,341 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:23,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:23,342 INFO L85 PathProgramCache]: Analyzing trace with hash 38009909, now seen corresponding path program 1 times [2022-01-11 01:51:23,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:23,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567270653] [2022-01-11 01:51:23,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:23,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:23,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:51:23,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:23,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567270653] [2022-01-11 01:51:23,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567270653] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:23,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:23,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:51:23,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916747830] [2022-01-11 01:51:23,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:23,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:51:23,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:23,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:51:23,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:51:23,392 INFO L87 Difference]: Start difference. First operand 2843 states and 3680 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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-11 01:51:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:23,742 INFO L93 Difference]: Finished difference Result 7427 states and 9674 transitions. [2022-01-11 01:51:23,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:51:23,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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) Word has length 178 [2022-01-11 01:51:23,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:23,751 INFO L225 Difference]: With dead ends: 7427 [2022-01-11 01:51:23,751 INFO L226 Difference]: Without dead ends: 4641 [2022-01-11 01:51:23,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:51:23,754 INFO L933 BasicCegarLoop]: 1134 mSDtfsCounter, 2745 mSDsluCounter, 1995 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2745 SdHoareTripleChecker+Valid, 3129 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:23,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2745 Valid, 3129 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:51:23,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4641 states. [2022-01-11 01:51:23,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4641 to 2855. [2022-01-11 01:51:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2855 states, 2853 states have (on average 1.282509638976516) internal successors, (3659), 2854 states have internal predecessors, (3659), 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-11 01:51:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 3659 transitions. [2022-01-11 01:51:23,923 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 3659 transitions. Word has length 178 [2022-01-11 01:51:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:23,923 INFO L470 AbstractCegarLoop]: Abstraction has 2855 states and 3659 transitions. [2022-01-11 01:51:23,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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-11 01:51:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 3659 transitions. [2022-01-11 01:51:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-11 01:51:23,925 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:23,925 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:51:23,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 01:51:23,926 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:23,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:23,926 INFO L85 PathProgramCache]: Analyzing trace with hash -491832585, now seen corresponding path program 1 times [2022-01-11 01:51:23,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:23,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080711596] [2022-01-11 01:51:23,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:23,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:51:23,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:23,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080711596] [2022-01-11 01:51:23,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080711596] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:23,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:23,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:23,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239241692] [2022-01-11 01:51:23,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:23,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:23,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:23,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:23,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:23,964 INFO L87 Difference]: Start difference. First operand 2855 states and 3659 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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-11 01:51:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:24,204 INFO L93 Difference]: Finished difference Result 5636 states and 7219 transitions. [2022-01-11 01:51:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:24,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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) Word has length 178 [2022-01-11 01:51:24,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:24,209 INFO L225 Difference]: With dead ends: 5636 [2022-01-11 01:51:24,209 INFO L226 Difference]: Without dead ends: 2804 [2022-01-11 01:51:24,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 01:51:24,213 INFO L933 BasicCegarLoop]: 1051 mSDtfsCounter, 905 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:24,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [905 Valid, 1120 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804 states. [2022-01-11 01:51:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804 to 2804. [2022-01-11 01:51:24,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2804 states, 2802 states have (on average 1.270521056388294) internal successors, (3560), 2803 states have internal predecessors, (3560), 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-11 01:51:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 3560 transitions. [2022-01-11 01:51:24,422 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 3560 transitions. Word has length 178 [2022-01-11 01:51:24,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:24,422 INFO L470 AbstractCegarLoop]: Abstraction has 2804 states and 3560 transitions. [2022-01-11 01:51:24,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 2 states have internal predecessors, (170), 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-11 01:51:24,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 3560 transitions. [2022-01-11 01:51:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-11 01:51:24,424 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:24,424 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:51:24,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 01:51:24,425 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:24,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:24,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1462123592, now seen corresponding path program 1 times [2022-01-11 01:51:24,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:24,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143757251] [2022-01-11 01:51:24,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:24,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:24,467 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:24,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:24,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143757251] [2022-01-11 01:51:24,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143757251] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:24,467 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:24,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:24,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876447009] [2022-01-11 01:51:24,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:24,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:24,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:24,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:24,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:24,468 INFO L87 Difference]: Start difference. First operand 2804 states and 3560 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-11 01:51:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:24,812 INFO L93 Difference]: Finished difference Result 8196 states and 10429 transitions. [2022-01-11 01:51:24,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:24,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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) Word has length 178 [2022-01-11 01:51:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:24,818 INFO L225 Difference]: With dead ends: 8196 [2022-01-11 01:51:24,819 INFO L226 Difference]: Without dead ends: 5430 [2022-01-11 01:51:24,820 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-11 01:51:24,821 INFO L933 BasicCegarLoop]: 1050 mSDtfsCounter, 950 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:24,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [950 Valid, 1968 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:24,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5430 states. [2022-01-11 01:51:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5430 to 5214. [2022-01-11 01:51:25,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5214 states, 5212 states have (on average 1.2686108979278587) internal successors, (6612), 5213 states have internal predecessors, (6612), 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-11 01:51:25,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5214 states to 5214 states and 6612 transitions. [2022-01-11 01:51:25,116 INFO L78 Accepts]: Start accepts. Automaton has 5214 states and 6612 transitions. Word has length 178 [2022-01-11 01:51:25,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:25,116 INFO L470 AbstractCegarLoop]: Abstraction has 5214 states and 6612 transitions. [2022-01-11 01:51:25,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-11 01:51:25,116 INFO L276 IsEmpty]: Start isEmpty. Operand 5214 states and 6612 transitions. [2022-01-11 01:51:25,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-11 01:51:25,119 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:25,119 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:51:25,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 01:51:25,119 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:25,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:25,120 INFO L85 PathProgramCache]: Analyzing trace with hash -991549641, now seen corresponding path program 1 times [2022-01-11 01:51:25,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:25,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300267415] [2022-01-11 01:51:25,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:25,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:25,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:25,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300267415] [2022-01-11 01:51:25,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300267415] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:25,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:25,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:25,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096543369] [2022-01-11 01:51:25,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:25,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:25,175 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:25,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:25,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:25,176 INFO L87 Difference]: Start difference. First operand 5214 states and 6612 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-11 01:51:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:25,764 INFO L93 Difference]: Finished difference Result 15307 states and 19307 transitions. [2022-01-11 01:51:25,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:25,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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) Word has length 178 [2022-01-11 01:51:25,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:25,777 INFO L225 Difference]: With dead ends: 15307 [2022-01-11 01:51:25,777 INFO L226 Difference]: Without dead ends: 10195 [2022-01-11 01:51:25,783 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-11 01:51:25,783 INFO L933 BasicCegarLoop]: 1257 mSDtfsCounter, 947 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:25,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [947 Valid, 2289 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10195 states. [2022-01-11 01:51:26,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10195 to 9995. [2022-01-11 01:51:26,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9995 states, 9993 states have (on average 1.2545782047433203) internal successors, (12537), 9994 states have internal predecessors, (12537), 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-11 01:51:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9995 states to 9995 states and 12537 transitions. [2022-01-11 01:51:26,444 INFO L78 Accepts]: Start accepts. Automaton has 9995 states and 12537 transitions. Word has length 178 [2022-01-11 01:51:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:26,444 INFO L470 AbstractCegarLoop]: Abstraction has 9995 states and 12537 transitions. [2022-01-11 01:51:26,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-11 01:51:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 9995 states and 12537 transitions. [2022-01-11 01:51:26,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-01-11 01:51:26,449 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:26,449 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:51:26,449 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 01:51:26,450 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:26,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:26,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1360606120, now seen corresponding path program 1 times [2022-01-11 01:51:26,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:26,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749163579] [2022-01-11 01:51:26,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:26,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:26,479 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:51:26,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:26,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749163579] [2022-01-11 01:51:26,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749163579] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:26,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:26,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:26,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452956671] [2022-01-11 01:51:26,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:26,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:26,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:26,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:26,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:26,481 INFO L87 Difference]: Start difference. First operand 9995 states and 12537 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-11 01:51:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:27,142 INFO L93 Difference]: Finished difference Result 19853 states and 24913 transitions. [2022-01-11 01:51:27,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:27,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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) Word has length 178 [2022-01-11 01:51:27,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:27,152 INFO L225 Difference]: With dead ends: 19853 [2022-01-11 01:51:27,152 INFO L226 Difference]: Without dead ends: 9900 [2022-01-11 01:51:27,160 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-11 01:51:27,160 INFO L933 BasicCegarLoop]: 1061 mSDtfsCounter, 1056 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:27,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1056 Valid, 1062 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:27,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9900 states. [2022-01-11 01:51:27,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9900 to 9900. [2022-01-11 01:51:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9900 states, 9898 states have (on average 1.2553041018387554) internal successors, (12425), 9899 states have internal predecessors, (12425), 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-11 01:51:27,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9900 states to 9900 states and 12425 transitions. [2022-01-11 01:51:27,777 INFO L78 Accepts]: Start accepts. Automaton has 9900 states and 12425 transitions. Word has length 178 [2022-01-11 01:51:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:27,777 INFO L470 AbstractCegarLoop]: Abstraction has 9900 states and 12425 transitions. [2022-01-11 01:51:27,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 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-11 01:51:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 9900 states and 12425 transitions. [2022-01-11 01:51:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-01-11 01:51:27,785 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:27,786 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:51:27,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 01:51:27,786 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:27,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:27,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1221522224, now seen corresponding path program 1 times [2022-01-11 01:51:27,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:27,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588571250] [2022-01-11 01:51:27,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:27,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:27,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:27,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588571250] [2022-01-11 01:51:27,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588571250] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:27,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:27,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:27,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772709783] [2022-01-11 01:51:27,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:27,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:27,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:27,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:27,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:27,835 INFO L87 Difference]: Start difference. First operand 9900 states and 12425 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-11 01:51:28,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:28,946 INFO L93 Difference]: Finished difference Result 28414 states and 35578 transitions. [2022-01-11 01:51:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:28,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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) Word has length 179 [2022-01-11 01:51:28,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:28,965 INFO L225 Difference]: With dead ends: 28414 [2022-01-11 01:51:28,965 INFO L226 Difference]: Without dead ends: 18616 [2022-01-11 01:51:28,971 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-11 01:51:28,972 INFO L933 BasicCegarLoop]: 1539 mSDtfsCounter, 787 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 787 SdHoareTripleChecker+Valid, 2579 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:28,972 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [787 Valid, 2579 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:28,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18616 states. [2022-01-11 01:51:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18616 to 18612. [2022-01-11 01:51:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18612 states, 18610 states have (on average 1.2482536270822138) internal successors, (23230), 18611 states have internal predecessors, (23230), 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-11 01:51:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18612 states to 18612 states and 23230 transitions. [2022-01-11 01:51:30,399 INFO L78 Accepts]: Start accepts. Automaton has 18612 states and 23230 transitions. Word has length 179 [2022-01-11 01:51:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:30,400 INFO L470 AbstractCegarLoop]: Abstraction has 18612 states and 23230 transitions. [2022-01-11 01:51:30,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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-11 01:51:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 18612 states and 23230 transitions. [2022-01-11 01:51:30,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-01-11 01:51:30,407 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:30,407 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:51:30,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 01:51:30,407 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:30,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:30,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1905752529, now seen corresponding path program 1 times [2022-01-11 01:51:30,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:30,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712005538] [2022-01-11 01:51:30,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:30,408 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:51:30,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:30,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712005538] [2022-01-11 01:51:30,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712005538] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:30,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:30,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:30,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148595672] [2022-01-11 01:51:30,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:30,438 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:30,438 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:30,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:30,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:30,439 INFO L87 Difference]: Start difference. First operand 18612 states and 23230 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-11 01:51:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:31,768 INFO L93 Difference]: Finished difference Result 37028 states and 46232 transitions. [2022-01-11 01:51:31,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:31,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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) Word has length 179 [2022-01-11 01:51:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:31,796 INFO L225 Difference]: With dead ends: 37028 [2022-01-11 01:51:31,796 INFO L226 Difference]: Without dead ends: 18518 [2022-01-11 01:51:31,815 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-11 01:51:31,816 INFO L933 BasicCegarLoop]: 1060 mSDtfsCounter, 1054 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:31,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1054 Valid, 1061 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18518 states. [2022-01-11 01:51:33,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18518 to 18518. [2022-01-11 01:51:33,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18518 states, 18516 states have (on average 1.248649816375027) internal successors, (23120), 18517 states have internal predecessors, (23120), 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-11 01:51:33,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18518 states to 18518 states and 23120 transitions. [2022-01-11 01:51:33,051 INFO L78 Accepts]: Start accepts. Automaton has 18518 states and 23120 transitions. Word has length 179 [2022-01-11 01:51:33,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:33,052 INFO L470 AbstractCegarLoop]: Abstraction has 18518 states and 23120 transitions. [2022-01-11 01:51:33,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 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-11 01:51:33,052 INFO L276 IsEmpty]: Start isEmpty. Operand 18518 states and 23120 transitions. [2022-01-11 01:51:33,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-01-11 01:51:33,058 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:33,058 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:51:33,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 01:51:33,059 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:33,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:33,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1091072502, now seen corresponding path program 1 times [2022-01-11 01:51:33,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:33,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19334294] [2022-01-11 01:51:33,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:33,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:33,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:33,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19334294] [2022-01-11 01:51:33,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19334294] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:33,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:33,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:33,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997908346] [2022-01-11 01:51:33,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:33,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:33,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:33,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:33,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:33,105 INFO L87 Difference]: Start difference. First operand 18518 states and 23120 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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-11 01:51:35,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:35,233 INFO L93 Difference]: Finished difference Result 53331 states and 66511 transitions. [2022-01-11 01:51:35,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:35,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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) Word has length 180 [2022-01-11 01:51:35,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:35,272 INFO L225 Difference]: With dead ends: 53331 [2022-01-11 01:51:35,272 INFO L226 Difference]: Without dead ends: 34915 [2022-01-11 01:51:35,292 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-11 01:51:35,292 INFO L933 BasicCegarLoop]: 1508 mSDtfsCounter, 792 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:35,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [792 Valid, 2546 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34915 states. [2022-01-11 01:51:37,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34915 to 34911. [2022-01-11 01:51:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34911 states, 34909 states have (on average 1.2446933455555873) internal successors, (43451), 34910 states have internal predecessors, (43451), 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-11 01:51:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34911 states to 34911 states and 43451 transitions. [2022-01-11 01:51:37,746 INFO L78 Accepts]: Start accepts. Automaton has 34911 states and 43451 transitions. Word has length 180 [2022-01-11 01:51:37,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:37,747 INFO L470 AbstractCegarLoop]: Abstraction has 34911 states and 43451 transitions. [2022-01-11 01:51:37,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 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-11 01:51:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 34911 states and 43451 transitions. [2022-01-11 01:51:37,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-01-11 01:51:37,759 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:37,759 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:51:37,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 01:51:37,760 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:37,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:37,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1775302807, now seen corresponding path program 1 times [2022-01-11 01:51:37,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:37,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384783415] [2022-01-11 01:51:37,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:37,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:37,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:51:37,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:37,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384783415] [2022-01-11 01:51:37,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384783415] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:37,817 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:37,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:37,817 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131378076] [2022-01-11 01:51:37,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:37,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:37,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:37,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:37,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:37,818 INFO L87 Difference]: Start difference. First operand 34911 states and 43451 transitions. Second operand has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-11 01:51:40,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:40,510 INFO L93 Difference]: Finished difference Result 69627 states and 86677 transitions. [2022-01-11 01:51:40,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:40,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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) Word has length 180 [2022-01-11 01:51:40,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:40,556 INFO L225 Difference]: With dead ends: 69627 [2022-01-11 01:51:40,556 INFO L226 Difference]: Without dead ends: 34818 [2022-01-11 01:51:40,584 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-11 01:51:40,584 INFO L933 BasicCegarLoop]: 1059 mSDtfsCounter, 1052 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:40,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1052 Valid, 1060 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:40,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34818 states. [2022-01-11 01:51:43,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34818 to 34818. [2022-01-11 01:51:43,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34818 states, 34816 states have (on average 1.2449161305147058) internal successors, (43343), 34817 states have internal predecessors, (43343), 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-11 01:51:43,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34818 states to 34818 states and 43343 transitions. [2022-01-11 01:51:43,113 INFO L78 Accepts]: Start accepts. Automaton has 34818 states and 43343 transitions. Word has length 180 [2022-01-11 01:51:43,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:43,113 INFO L470 AbstractCegarLoop]: Abstraction has 34818 states and 43343 transitions. [2022-01-11 01:51:43,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.333333333333336) internal successors, (172), 3 states have internal predecessors, (172), 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-11 01:51:43,113 INFO L276 IsEmpty]: Start isEmpty. Operand 34818 states and 43343 transitions. [2022-01-11 01:51:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-01-11 01:51:43,124 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:43,125 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:51:43,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 01:51:43,125 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:43,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:43,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1652214271, now seen corresponding path program 1 times [2022-01-11 01:51:43,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:43,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851159350] [2022-01-11 01:51:43,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:43,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:43,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:43,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851159350] [2022-01-11 01:51:43,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851159350] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:43,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:43,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:43,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459097619] [2022-01-11 01:51:43,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:43,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:43,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:43,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:43,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:43,167 INFO L87 Difference]: Start difference. First operand 34818 states and 43343 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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-11 01:51:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:47,887 INFO L93 Difference]: Finished difference Result 101838 states and 126748 transitions. [2022-01-11 01:51:47,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:47,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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) Word has length 181 [2022-01-11 01:51:47,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:47,990 INFO L225 Difference]: With dead ends: 101838 [2022-01-11 01:51:47,990 INFO L226 Difference]: Without dead ends: 67122 [2022-01-11 01:51:48,032 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-11 01:51:48,035 INFO L933 BasicCegarLoop]: 1326 mSDtfsCounter, 948 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:48,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [948 Valid, 2352 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:51:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67122 states. [2022-01-11 01:51:52,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67122 to 65518. [2022-01-11 01:51:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65518 states, 65516 states have (on average 1.242200378533488) internal successors, (81384), 65517 states have internal predecessors, (81384), 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-11 01:51:52,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65518 states to 65518 states and 81384 transitions. [2022-01-11 01:51:52,867 INFO L78 Accepts]: Start accepts. Automaton has 65518 states and 81384 transitions. Word has length 181 [2022-01-11 01:51:52,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:52,868 INFO L470 AbstractCegarLoop]: Abstraction has 65518 states and 81384 transitions. [2022-01-11 01:51:52,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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-11 01:51:52,868 INFO L276 IsEmpty]: Start isEmpty. Operand 65518 states and 81384 transitions. [2022-01-11 01:51:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-01-11 01:51:52,889 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:52,889 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:51:52,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 01:51:52,890 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:51:52,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:52,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2056107998, now seen corresponding path program 1 times [2022-01-11 01:51:52,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:52,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456827014] [2022-01-11 01:51:52,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:52,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:51:52,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:52,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456827014] [2022-01-11 01:51:52,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456827014] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:52,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:52,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:52,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634659350] [2022-01-11 01:51:52,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:52,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:52,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:52,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:52,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:52,946 INFO L87 Difference]: Start difference. First operand 65518 states and 81384 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-11 01:51:57,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:57,665 INFO L93 Difference]: Finished difference Result 130881 states and 162591 transitions. [2022-01-11 01:51:57,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:57,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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) Word has length 181 [2022-01-11 01:51:57,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:57,780 INFO L225 Difference]: With dead ends: 130881 [2022-01-11 01:51:57,780 INFO L226 Difference]: Without dead ends: 65426 [2022-01-11 01:51:57,837 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-11 01:51:57,838 INFO L933 BasicCegarLoop]: 1058 mSDtfsCounter, 1050 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:57,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1050 Valid, 1059 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:57,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65426 states. [2022-01-11 01:52:02,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65426 to 65426. [2022-01-11 01:52:02,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65426 states, 65424 states have (on average 1.242326974810467) internal successors, (81278), 65425 states have internal predecessors, (81278), 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-11 01:52:02,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65426 states to 65426 states and 81278 transitions. [2022-01-11 01:52:02,988 INFO L78 Accepts]: Start accepts. Automaton has 65426 states and 81278 transitions. Word has length 181 [2022-01-11 01:52:02,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:52:02,988 INFO L470 AbstractCegarLoop]: Abstraction has 65426 states and 81278 transitions. [2022-01-11 01:52:02,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 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-11 01:52:02,989 INFO L276 IsEmpty]: Start isEmpty. Operand 65426 states and 81278 transitions. [2022-01-11 01:52:03,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-01-11 01:52:03,008 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:52:03,008 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:52:03,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 01:52:03,008 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:52:03,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:52:03,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1162715766, now seen corresponding path program 1 times [2022-01-11 01:52:03,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:52:03,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600620295] [2022-01-11 01:52:03,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:52:03,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:52:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:52:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:52:03,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:52:03,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600620295] [2022-01-11 01:52:03,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600620295] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:52:03,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:52:03,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:52:03,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529426667] [2022-01-11 01:52:03,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:52:03,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:52:03,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:52:03,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:52:03,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:52:03,052 INFO L87 Difference]: Start difference. First operand 65426 states and 81278 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-11 01:52:11,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:52:11,823 INFO L93 Difference]: Finished difference Result 190357 states and 236441 transitions. [2022-01-11 01:52:11,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:52:11,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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) Word has length 182 [2022-01-11 01:52:11,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:52:12,060 INFO L225 Difference]: With dead ends: 190357 [2022-01-11 01:52:12,060 INFO L226 Difference]: Without dead ends: 125033 [2022-01-11 01:52:12,278 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-11 01:52:12,279 INFO L933 BasicCegarLoop]: 1273 mSDtfsCounter, 948 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 2297 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:52:12,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [948 Valid, 2297 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:52:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125033 states. [2022-01-11 01:52:21,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125033 to 122725. [2022-01-11 01:52:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122725 states, 122723 states have (on average 1.2400365049746176) internal successors, (152181), 122724 states have internal predecessors, (152181), 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-11 01:52:21,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122725 states to 122725 states and 152181 transitions. [2022-01-11 01:52:21,965 INFO L78 Accepts]: Start accepts. Automaton has 122725 states and 152181 transitions. Word has length 182 [2022-01-11 01:52:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:52:21,965 INFO L470 AbstractCegarLoop]: Abstraction has 122725 states and 152181 transitions. [2022-01-11 01:52:21,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 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-11 01:52:21,965 INFO L276 IsEmpty]: Start isEmpty. Operand 122725 states and 152181 transitions. [2022-01-11 01:52:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-01-11 01:52:22,004 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:52:22,004 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:52:22,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 01:52:22,004 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:52:22,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:52:22,004 INFO L85 PathProgramCache]: Analyzing trace with hash 842284183, now seen corresponding path program 1 times [2022-01-11 01:52:22,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:52:22,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481878786] [2022-01-11 01:52:22,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:52:22,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:52:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:52:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:52:22,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:52:22,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481878786] [2022-01-11 01:52:22,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481878786] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:52:22,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:52:22,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:52:22,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150180810] [2022-01-11 01:52:22,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:52:22,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:52:22,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:52:22,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:52:22,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:52:22,032 INFO L87 Difference]: Start difference. First operand 122725 states and 152181 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 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)