/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_2.cil-1+token_ring.13.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 01:50:07,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 01:50:07,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 01:50:08,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 01:50:08,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 01:50:08,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 01:50:08,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 01:50:08,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 01:50:08,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 01:50:08,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 01:50:08,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 01:50:08,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 01:50:08,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 01:50:08,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 01:50:08,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 01:50:08,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 01:50:08,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 01:50:08,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 01:50:08,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 01:50:08,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 01:50:08,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 01:50:08,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 01:50:08,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 01:50:08,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 01:50:08,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 01:50:08,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 01:50:08,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 01:50:08,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 01:50:08,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 01:50:08,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 01:50:08,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 01:50:08,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 01:50:08,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 01:50:08,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 01:50:08,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 01:50:08,096 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 01:50:08,096 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 01:50:08,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 01:50:08,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 01:50:08,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 01:50:08,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 01:50:08,098 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:50:08,134 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 01:50:08,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 01:50:08,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 01:50:08,135 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 01:50:08,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 01:50:08,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 01:50:08,136 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 01:50:08,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 01:50:08,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 01:50:08,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 01:50:08,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 01:50:08,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 01:50:08,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 01:50:08,138 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 01:50:08,138 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 01:50:08,138 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 01:50:08,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 01:50:08,138 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 01:50:08,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 01:50:08,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 01:50:08,138 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 01:50:08,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:50:08,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 01:50:08,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 01:50:08,139 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 01:50:08,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 01:50:08,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 01:50:08,139 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 01:50:08,140 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 01:50:08,140 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 01:50:08,140 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 01:50:08,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 01:50:08,141 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 01:50:08,141 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:50:08,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 01:50:08,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 01:50:08,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 01:50:08,402 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 01:50:08,403 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 01:50:08,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-2.c [2022-01-11 01:50:08,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/870c306bb/3f074346de4b442a95bedc3cf9f0d6f3/FLAG8ffb29d83 [2022-01-11 01:50:08,920 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 01:50:08,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.13.cil-2.c [2022-01-11 01:50:08,933 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/870c306bb/3f074346de4b442a95bedc3cf9f0d6f3/FLAG8ffb29d83 [2022-01-11 01:50:09,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/870c306bb/3f074346de4b442a95bedc3cf9f0d6f3 [2022-01-11 01:50:09,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 01:50:09,262 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 01:50:09,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 01:50:09,263 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 01:50:09,268 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 01:50:09,269 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:50:09" (1/1) ... [2022-01-11 01:50:09,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3887c39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:09, skipping insertion in model container [2022-01-11 01:50:09,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:50:09" (1/1) ... [2022-01-11 01:50:09,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 01:50:09,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 01:50:09,488 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_2.cil-1+token_ring.13.cil-2.c[914,927] [2022-01-11 01:50:09,537 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_2.cil-1+token_ring.13.cil-2.c[7115,7128] [2022-01-11 01:50:09,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:50:09,670 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 01:50:09,681 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_2.cil-1+token_ring.13.cil-2.c[914,927] [2022-01-11 01:50:09,698 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_2.cil-1+token_ring.13.cil-2.c[7115,7128] [2022-01-11 01:50:09,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:50:09,826 INFO L208 MainTranslator]: Completed translation [2022-01-11 01:50:09,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:09 WrapperNode [2022-01-11 01:50:09,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 01:50:09,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 01:50:09,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 01:50:09,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 01:50:09,833 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:50:09" (1/1) ... [2022-01-11 01:50:09,848 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:50:09" (1/1) ... [2022-01-11 01:50:09,940 INFO L137 Inliner]: procedures = 80, calls = 96, calls flagged for inlining = 91, calls inlined = 329, statements flattened = 4954 [2022-01-11 01:50:09,940 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 01:50:09,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 01:50:09,941 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 01:50:09,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 01:50:09,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:09" (1/1) ... [2022-01-11 01:50:09,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:09" (1/1) ... [2022-01-11 01:50:09,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:09" (1/1) ... [2022-01-11 01:50:09,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:09" (1/1) ... [2022-01-11 01:50:10,031 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:09" (1/1) ... [2022-01-11 01:50:10,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:09" (1/1) ... [2022-01-11 01:50:10,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:09" (1/1) ... [2022-01-11 01:50:10,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 01:50:10,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 01:50:10,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 01:50:10,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 01:50:10,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:09" (1/1) ... [2022-01-11 01:50:10,127 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:50:10,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:50:10,147 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:50:10,172 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:50:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 01:50:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 01:50:10,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 01:50:10,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 01:50:10,338 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 01:50:10,339 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 01:50:12,782 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 01:50:12,804 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 01:50:12,804 INFO L299 CfgBuilder]: Removed 20 assume(true) statements. [2022-01-11 01:50:12,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:50:12 BoogieIcfgContainer [2022-01-11 01:50:12,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 01:50:12,809 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 01:50:12,809 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 01:50:12,810 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 01:50:12,813 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:50:12" (1/1) ... [2022-01-11 01:50:13,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:50:13 BasicIcfg [2022-01-11 01:50:13,273 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 01:50:13,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 01:50:13,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 01:50:13,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 01:50:13,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 01:50:09" (1/4) ... [2022-01-11 01:50:13,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b7b89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:50:13, skipping insertion in model container [2022-01-11 01:50:13,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:09" (2/4) ... [2022-01-11 01:50:13,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b7b89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:50:13, skipping insertion in model container [2022-01-11 01:50:13,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:50:12" (3/4) ... [2022-01-11 01:50:13,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b7b89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:50:13, skipping insertion in model container [2022-01-11 01:50:13,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:50:13" (4/4) ... [2022-01-11 01:50:13,280 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.13.cil-2.cTransformedIcfg [2022-01-11 01:50:13,285 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 01:50:13,286 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-11 01:50:13,342 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 01:50:13,349 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:50:13,349 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-11 01:50:13,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 2128 states, 2124 states have (on average 1.5) internal successors, (3186), 2127 states have internal predecessors, (3186), 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:50:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:50:13,404 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:13,404 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:50:13,405 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:13,409 INFO L85 PathProgramCache]: Analyzing trace with hash 517787760, now seen corresponding path program 1 times [2022-01-11 01:50:13,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:13,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134186443] [2022-01-11 01:50:13,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:13,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:13,806 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:50:13,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:13,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134186443] [2022-01-11 01:50:13,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134186443] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:13,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:13,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:13,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365912234] [2022-01-11 01:50:13,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:13,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:13,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:13,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:13,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:13,861 INFO L87 Difference]: Start difference. First operand has 2128 states, 2124 states have (on average 1.5) internal successors, (3186), 2127 states have internal predecessors, (3186), 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:50:14,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:14,103 INFO L93 Difference]: Finished difference Result 4165 states and 6214 transitions. [2022-01-11 01:50:14,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:14,105 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:50:14,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:14,130 INFO L225 Difference]: With dead ends: 4165 [2022-01-11 01:50:14,130 INFO L226 Difference]: Without dead ends: 2212 [2022-01-11 01:50:14,141 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:50:14,147 INFO L933 BasicCegarLoop]: 3132 mSDtfsCounter, 124 mSDsluCounter, 3106 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 6238 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:14,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 6238 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:50:14,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2212 states. [2022-01-11 01:50:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2212 to 2208. [2022-01-11 01:50:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2208 states, 2205 states have (on average 1.4757369614512472) internal successors, (3254), 2207 states have internal predecessors, (3254), 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:50:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 3254 transitions. [2022-01-11 01:50:14,282 INFO L78 Accepts]: Start accepts. Automaton has 2208 states and 3254 transitions. Word has length 44 [2022-01-11 01:50:14,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:14,283 INFO L470 AbstractCegarLoop]: Abstraction has 2208 states and 3254 transitions. [2022-01-11 01:50:14,283 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:50:14,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2208 states and 3254 transitions. [2022-01-11 01:50:14,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:50:14,288 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:14,289 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:50:14,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 01:50:14,289 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:14,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:14,291 INFO L85 PathProgramCache]: Analyzing trace with hash 878529010, now seen corresponding path program 1 times [2022-01-11 01:50:14,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:14,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156502202] [2022-01-11 01:50:14,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:14,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:14,436 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:50:14,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:14,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156502202] [2022-01-11 01:50:14,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156502202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:14,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:14,437 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:14,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341927154] [2022-01-11 01:50:14,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:14,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:14,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:14,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:14,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:14,440 INFO L87 Difference]: Start difference. First operand 2208 states and 3254 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:50:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:14,514 INFO L93 Difference]: Finished difference Result 2494 states and 3652 transitions. [2022-01-11 01:50:14,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:14,515 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:50:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:14,524 INFO L225 Difference]: With dead ends: 2494 [2022-01-11 01:50:14,524 INFO L226 Difference]: Without dead ends: 2364 [2022-01-11 01:50:14,526 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:50:14,528 INFO L933 BasicCegarLoop]: 3129 mSDtfsCounter, 3092 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3092 SdHoareTripleChecker+Valid, 3247 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:14,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3092 Valid, 3247 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:14,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2022-01-11 01:50:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2360. [2022-01-11 01:50:14,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2360 states, 2357 states have (on average 1.467967755621553) internal successors, (3460), 2359 states have internal predecessors, (3460), 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:50:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2360 states to 2360 states and 3460 transitions. [2022-01-11 01:50:14,590 INFO L78 Accepts]: Start accepts. Automaton has 2360 states and 3460 transitions. Word has length 44 [2022-01-11 01:50:14,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:14,590 INFO L470 AbstractCegarLoop]: Abstraction has 2360 states and 3460 transitions. [2022-01-11 01:50:14,591 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:50:14,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2360 states and 3460 transitions. [2022-01-11 01:50:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 01:50:14,599 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:14,599 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:50:14,602 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 01:50:14,602 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:14,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:14,603 INFO L85 PathProgramCache]: Analyzing trace with hash 59690783, now seen corresponding path program 1 times [2022-01-11 01:50:14,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:14,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101817913] [2022-01-11 01:50:14,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:14,603 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:14,700 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:50:14,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:14,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101817913] [2022-01-11 01:50:14,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101817913] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:14,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:14,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:14,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094857313] [2022-01-11 01:50:14,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:14,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:14,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:14,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:14,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:14,703 INFO L87 Difference]: Start difference. First operand 2360 states and 3460 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:50:14,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:14,815 INFO L93 Difference]: Finished difference Result 2908 states and 4220 transitions. [2022-01-11 01:50:14,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:14,816 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:50:14,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:14,826 INFO L225 Difference]: With dead ends: 2908 [2022-01-11 01:50:14,827 INFO L226 Difference]: Without dead ends: 2573 [2022-01-11 01:50:14,832 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:50:14,835 INFO L933 BasicCegarLoop]: 3124 mSDtfsCounter, 94 mSDsluCounter, 3068 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 6192 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:14,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 6192 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:50:14,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2022-01-11 01:50:14,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2559. [2022-01-11 01:50:14,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 2556 states have (on average 1.458528951486698) internal successors, (3728), 2558 states have internal predecessors, (3728), 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:50:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 3728 transitions. [2022-01-11 01:50:14,900 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 3728 transitions. Word has length 45 [2022-01-11 01:50:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:14,900 INFO L470 AbstractCegarLoop]: Abstraction has 2559 states and 3728 transitions. [2022-01-11 01:50:14,900 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:50:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 3728 transitions. [2022-01-11 01:50:14,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 01:50:14,901 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:14,901 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:50:14,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 01:50:14,902 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:14,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:14,903 INFO L85 PathProgramCache]: Analyzing trace with hash 89273246, now seen corresponding path program 1 times [2022-01-11 01:50:14,903 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:14,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573240645] [2022-01-11 01:50:14,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:14,903 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:15,004 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:50:15,004 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:15,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573240645] [2022-01-11 01:50:15,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573240645] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:15,005 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:15,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:15,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775658632] [2022-01-11 01:50:15,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:15,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:15,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:15,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:15,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:15,007 INFO L87 Difference]: Start difference. First operand 2559 states and 3728 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:50:15,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:15,111 INFO L93 Difference]: Finished difference Result 3447 states and 4940 transitions. [2022-01-11 01:50:15,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:15,112 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:50:15,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:15,122 INFO L225 Difference]: With dead ends: 3447 [2022-01-11 01:50:15,123 INFO L226 Difference]: Without dead ends: 2971 [2022-01-11 01:50:15,124 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:50:15,125 INFO L933 BasicCegarLoop]: 3124 mSDtfsCounter, 3080 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3080 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:15,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3080 Valid, 3213 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2022-01-11 01:50:15,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2939. [2022-01-11 01:50:15,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2936 states have (on average 1.4400544959128065) internal successors, (4228), 2938 states have internal predecessors, (4228), 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:50:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 4228 transitions. [2022-01-11 01:50:15,215 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 4228 transitions. Word has length 45 [2022-01-11 01:50:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:15,216 INFO L470 AbstractCegarLoop]: Abstraction has 2939 states and 4228 transitions. [2022-01-11 01:50:15,216 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:50:15,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 4228 transitions. [2022-01-11 01:50:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 01:50:15,217 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:15,217 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:15,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 01:50:15,218 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:15,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:15,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1895292741, now seen corresponding path program 1 times [2022-01-11 01:50:15,218 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:15,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075126877] [2022-01-11 01:50:15,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:15,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:15,269 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:50:15,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:15,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075126877] [2022-01-11 01:50:15,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075126877] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:15,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:15,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:15,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122612524] [2022-01-11 01:50:15,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:15,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:15,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:15,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:15,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:15,272 INFO L87 Difference]: Start difference. First operand 2939 states and 4228 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:50:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:15,379 INFO L93 Difference]: Finished difference Result 4142 states and 5841 transitions. [2022-01-11 01:50:15,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:15,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2022-01-11 01:50:15,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:15,392 INFO L225 Difference]: With dead ends: 4142 [2022-01-11 01:50:15,392 INFO L226 Difference]: Without dead ends: 3258 [2022-01-11 01:50:15,395 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:50:15,395 INFO L933 BasicCegarLoop]: 3128 mSDtfsCounter, 3077 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3077 SdHoareTripleChecker+Valid, 3217 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:15,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3077 Valid, 3217 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:15,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3258 states. [2022-01-11 01:50:15,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3258 to 3236. [2022-01-11 01:50:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3236 states, 3233 states have (on average 1.426848128673059) internal successors, (4613), 3235 states have internal predecessors, (4613), 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:50:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 4613 transitions. [2022-01-11 01:50:15,498 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 4613 transitions. Word has length 51 [2022-01-11 01:50:15,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:15,501 INFO L470 AbstractCegarLoop]: Abstraction has 3236 states and 4613 transitions. [2022-01-11 01:50:15,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:50:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4613 transitions. [2022-01-11 01:50:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:50:15,505 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:15,505 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 01:50:15,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 01:50:15,506 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:15,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:15,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1339826872, now seen corresponding path program 1 times [2022-01-11 01:50:15,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:15,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142305056] [2022-01-11 01:50:15,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:15,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:50:15,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:15,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142305056] [2022-01-11 01:50:15,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142305056] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:15,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:15,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:50:15,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760088539] [2022-01-11 01:50:15,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:15,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:50:15,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:15,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:50:15,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:50:15,626 INFO L87 Difference]: Start difference. First operand 3236 states and 4613 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:50:15,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:15,808 INFO L93 Difference]: Finished difference Result 4862 states and 6817 transitions. [2022-01-11 01:50:15,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:50:15,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 52 [2022-01-11 01:50:15,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:15,824 INFO L225 Difference]: With dead ends: 4862 [2022-01-11 01:50:15,825 INFO L226 Difference]: Without dead ends: 3911 [2022-01-11 01:50:15,829 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:50:15,832 INFO L933 BasicCegarLoop]: 3117 mSDtfsCounter, 395 mSDsluCounter, 9460 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 12577 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:15,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 12577 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:15,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3911 states. [2022-01-11 01:50:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3911 to 3260. [2022-01-11 01:50:15,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3260 states, 3257 states have (on average 1.4181762357998158) internal successors, (4619), 3259 states have internal predecessors, (4619), 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:50:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 3260 states and 4619 transitions. [2022-01-11 01:50:15,967 INFO L78 Accepts]: Start accepts. Automaton has 3260 states and 4619 transitions. Word has length 52 [2022-01-11 01:50:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:15,967 INFO L470 AbstractCegarLoop]: Abstraction has 3260 states and 4619 transitions. [2022-01-11 01:50:15,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:50:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 3260 states and 4619 transitions. [2022-01-11 01:50:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:50:15,968 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:15,968 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 01:50:15,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 01:50:15,969 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:15,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:15,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1004840169, now seen corresponding path program 1 times [2022-01-11 01:50:15,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:15,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727286423] [2022-01-11 01:50:15,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:15,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:16,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:50:16,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:16,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727286423] [2022-01-11 01:50:16,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727286423] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:16,034 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:16,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:50:16,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964982741] [2022-01-11 01:50:16,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:16,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:50:16,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:16,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:50:16,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:50:16,035 INFO L87 Difference]: Start difference. First operand 3260 states and 4619 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:50:16,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:16,244 INFO L93 Difference]: Finished difference Result 5015 states and 6968 transitions. [2022-01-11 01:50:16,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:50:16,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 52 [2022-01-11 01:50:16,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:16,260 INFO L225 Difference]: With dead ends: 5015 [2022-01-11 01:50:16,260 INFO L226 Difference]: Without dead ends: 3850 [2022-01-11 01:50:16,262 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:50:16,265 INFO L933 BasicCegarLoop]: 3116 mSDtfsCounter, 354 mSDsluCounter, 9477 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 12593 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:16,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 12593 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:16,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3850 states. [2022-01-11 01:50:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3850 to 3278. [2022-01-11 01:50:16,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 3275 states have (on average 1.4097709923664121) internal successors, (4617), 3277 states have internal predecessors, (4617), 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:50:16,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 4617 transitions. [2022-01-11 01:50:16,408 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 4617 transitions. Word has length 52 [2022-01-11 01:50:16,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:16,409 INFO L470 AbstractCegarLoop]: Abstraction has 3278 states and 4617 transitions. [2022-01-11 01:50:16,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:50:16,409 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 4617 transitions. [2022-01-11 01:50:16,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 01:50:16,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:16,410 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 01:50:16,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 01:50:16,410 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:16,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:16,411 INFO L85 PathProgramCache]: Analyzing trace with hash -993524042, now seen corresponding path program 1 times [2022-01-11 01:50:16,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:16,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027866185] [2022-01-11 01:50:16,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:16,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:16,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:16,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027866185] [2022-01-11 01:50:16,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027866185] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:16,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:16,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 01:50:16,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20799843] [2022-01-11 01:50:16,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:16,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 01:50:16,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:16,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 01:50:16,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 01:50:16,519 INFO L87 Difference]: Start difference. First operand 3278 states and 4617 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:50:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:16,726 INFO L93 Difference]: Finished difference Result 3510 states and 4917 transitions. [2022-01-11 01:50:16,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 01:50:16,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2022-01-11 01:50:16,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:16,740 INFO L225 Difference]: With dead ends: 3510 [2022-01-11 01:50:16,740 INFO L226 Difference]: Without dead ends: 3508 [2022-01-11 01:50:16,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:50:16,743 INFO L933 BasicCegarLoop]: 3125 mSDtfsCounter, 6293 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6293 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:16,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6293 Valid, 3213 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:16,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2022-01-11 01:50:16,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 3276. [2022-01-11 01:50:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3276 states, 3274 states have (on average 1.4074526572999388) internal successors, (4608), 3275 states have internal predecessors, (4608), 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:50:16,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 4608 transitions. [2022-01-11 01:50:16,959 INFO L78 Accepts]: Start accepts. Automaton has 3276 states and 4608 transitions. Word has length 52 [2022-01-11 01:50:16,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:16,959 INFO L470 AbstractCegarLoop]: Abstraction has 3276 states and 4608 transitions. [2022-01-11 01:50:16,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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:50:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3276 states and 4608 transitions. [2022-01-11 01:50:16,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-11 01:50:16,961 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:16,961 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-11 01:50:16,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 01:50:16,962 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:16,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:16,962 INFO L85 PathProgramCache]: Analyzing trace with hash -734467272, now seen corresponding path program 1 times [2022-01-11 01:50:16,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:16,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764983108] [2022-01-11 01:50:16,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:16,963 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:17,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:17,219 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:17,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764983108] [2022-01-11 01:50:17,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764983108] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 01:50:17,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408505037] [2022-01-11 01:50:17,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:17,219 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:50:17,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:50:17,227 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 01:50:17,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 01:50:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:17,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-11 01:50:17,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 01:50:17,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:17,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 01:50:18,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:18,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408505037] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 01:50:18,008 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 01:50:18,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-11 01:50:18,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439006022] [2022-01-11 01:50:18,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 01:50:18,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 01:50:18,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:18,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 01:50:18,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:50:18,011 INFO L87 Difference]: Start difference. First operand 3276 states and 4608 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 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:50:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:18,697 INFO L93 Difference]: Finished difference Result 5633 states and 7708 transitions. [2022-01-11 01:50:18,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 01:50:18,700 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 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 53 [2022-01-11 01:50:18,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:18,730 INFO L225 Difference]: With dead ends: 5633 [2022-01-11 01:50:18,730 INFO L226 Difference]: Without dead ends: 5631 [2022-01-11 01:50:18,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:50:18,735 INFO L933 BasicCegarLoop]: 3276 mSDtfsCounter, 3669 mSDsluCounter, 7098 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3669 SdHoareTripleChecker+Valid, 10374 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:18,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3669 Valid, 10374 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:50:18,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5631 states. [2022-01-11 01:50:19,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5631 to 4251. [2022-01-11 01:50:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4251 states, 4249 states have (on average 1.385973170157684) internal successors, (5889), 4250 states have internal predecessors, (5889), 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:50:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4251 states to 4251 states and 5889 transitions. [2022-01-11 01:50:19,118 INFO L78 Accepts]: Start accepts. Automaton has 4251 states and 5889 transitions. Word has length 53 [2022-01-11 01:50:19,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:19,118 INFO L470 AbstractCegarLoop]: Abstraction has 4251 states and 5889 transitions. [2022-01-11 01:50:19,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 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:50:19,119 INFO L276 IsEmpty]: Start isEmpty. Operand 4251 states and 5889 transitions. [2022-01-11 01:50:19,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:50:19,120 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:19,120 INFO L514 BasicCegarLoop]: trace histogram [3, 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] [2022-01-11 01:50:19,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 01:50:19,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:50:19,340 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:19,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:19,340 INFO L85 PathProgramCache]: Analyzing trace with hash -267250938, now seen corresponding path program 2 times [2022-01-11 01:50:19,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:19,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568794306] [2022-01-11 01:50:19,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:19,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:19,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:19,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568794306] [2022-01-11 01:50:19,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568794306] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:19,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:19,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:19,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842637326] [2022-01-11 01:50:19,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:19,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:19,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:19,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:19,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:19,401 INFO L87 Difference]: Start difference. First operand 4251 states and 5889 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:50:19,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:19,659 INFO L93 Difference]: Finished difference Result 5345 states and 7334 transitions. [2022-01-11 01:50:19,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:19,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 56 [2022-01-11 01:50:19,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:19,668 INFO L225 Difference]: With dead ends: 5345 [2022-01-11 01:50:19,668 INFO L226 Difference]: Without dead ends: 3605 [2022-01-11 01:50:19,672 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:50:19,673 INFO L933 BasicCegarLoop]: 3188 mSDtfsCounter, 3071 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3071 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:19,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3071 Valid, 3304 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3605 states. [2022-01-11 01:50:19,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3605 to 3589. [2022-01-11 01:50:19,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3589 states, 3587 states have (on average 1.3897407304153888) internal successors, (4985), 3588 states have internal predecessors, (4985), 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:50:19,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3589 states to 3589 states and 4985 transitions. [2022-01-11 01:50:19,925 INFO L78 Accepts]: Start accepts. Automaton has 3589 states and 4985 transitions. Word has length 56 [2022-01-11 01:50:19,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:19,926 INFO L470 AbstractCegarLoop]: Abstraction has 3589 states and 4985 transitions. [2022-01-11 01:50:19,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:50:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3589 states and 4985 transitions. [2022-01-11 01:50:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-11 01:50:19,927 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:19,927 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] [2022-01-11 01:50:19,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 01:50:19,928 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:19,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:19,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1272217538, now seen corresponding path program 1 times [2022-01-11 01:50:19,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:19,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588586637] [2022-01-11 01:50:19,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:19,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:19,968 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:50:19,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:19,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588586637] [2022-01-11 01:50:19,969 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588586637] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:19,969 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:19,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:19,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321335172] [2022-01-11 01:50:19,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:19,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:19,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:19,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:19,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:19,970 INFO L87 Difference]: Start difference. First operand 3589 states and 4985 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:50:20,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:20,313 INFO L93 Difference]: Finished difference Result 6076 states and 8133 transitions. [2022-01-11 01:50:20,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:20,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2022-01-11 01:50:20,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:20,322 INFO L225 Difference]: With dead ends: 6076 [2022-01-11 01:50:20,323 INFO L226 Difference]: Without dead ends: 3974 [2022-01-11 01:50:20,326 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:50:20,327 INFO L933 BasicCegarLoop]: 3211 mSDtfsCounter, 89 mSDsluCounter, 3107 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 6318 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:20,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 6318 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974 states. [2022-01-11 01:50:20,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 3974. [2022-01-11 01:50:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3974 states, 3972 states have (on average 1.3705941591137967) internal successors, (5444), 3973 states have internal predecessors, (5444), 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:50:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 5444 transitions. [2022-01-11 01:50:20,581 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 5444 transitions. Word has length 60 [2022-01-11 01:50:20,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:20,581 INFO L470 AbstractCegarLoop]: Abstraction has 3974 states and 5444 transitions. [2022-01-11 01:50:20,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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:50:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 5444 transitions. [2022-01-11 01:50:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-11 01:50:20,585 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:20,585 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:20,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 01:50:20,585 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:20,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:20,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1943038269, now seen corresponding path program 1 times [2022-01-11 01:50:20,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:20,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359626069] [2022-01-11 01:50:20,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:20,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:50:20,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:20,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359626069] [2022-01-11 01:50:20,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359626069] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:20,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:20,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:20,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867893238] [2022-01-11 01:50:20,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:20,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:20,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:20,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:20,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:20,634 INFO L87 Difference]: Start difference. First operand 3974 states and 5444 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:50:21,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:21,001 INFO L93 Difference]: Finished difference Result 5837 states and 7796 transitions. [2022-01-11 01:50:21,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:21,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 68 [2022-01-11 01:50:21,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:21,012 INFO L225 Difference]: With dead ends: 5837 [2022-01-11 01:50:21,012 INFO L226 Difference]: Without dead ends: 3974 [2022-01-11 01:50:21,017 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:50:21,018 INFO L933 BasicCegarLoop]: 3120 mSDtfsCounter, 3063 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3063 SdHoareTripleChecker+Valid, 3204 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:21,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3063 Valid, 3204 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:21,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3974 states. [2022-01-11 01:50:21,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3974 to 3974. [2022-01-11 01:50:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3974 states, 3972 states have (on average 1.3605236656596174) internal successors, (5404), 3973 states have internal predecessors, (5404), 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:50:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 5404 transitions. [2022-01-11 01:50:21,285 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 5404 transitions. Word has length 68 [2022-01-11 01:50:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:21,285 INFO L470 AbstractCegarLoop]: Abstraction has 3974 states and 5404 transitions. [2022-01-11 01:50:21,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:50:21,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 5404 transitions. [2022-01-11 01:50:21,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-11 01:50:21,289 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:21,289 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:21,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 01:50:21,290 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:21,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:21,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1180748121, now seen corresponding path program 1 times [2022-01-11 01:50:21,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:21,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616388559] [2022-01-11 01:50:21,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:21,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:21,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 01:50:21,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:21,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616388559] [2022-01-11 01:50:21,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616388559] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:21,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:21,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:21,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174150636] [2022-01-11 01:50:21,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:21,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:21,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:21,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:21,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:21,335 INFO L87 Difference]: Start difference. First operand 3974 states and 5404 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:50:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:21,581 INFO L93 Difference]: Finished difference Result 5273 states and 7038 transitions. [2022-01-11 01:50:21,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:21,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 69 [2022-01-11 01:50:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:21,591 INFO L225 Difference]: With dead ends: 5273 [2022-01-11 01:50:21,591 INFO L226 Difference]: Without dead ends: 3648 [2022-01-11 01:50:21,594 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:50:21,595 INFO L933 BasicCegarLoop]: 3203 mSDtfsCounter, 99 mSDsluCounter, 3102 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 6305 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:50:21,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 6305 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2022-01-11 01:50:21,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 3646. [2022-01-11 01:50:21,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3646 states, 3644 states have (on average 1.3638858397365532) internal successors, (4970), 3645 states have internal predecessors, (4970), 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:50:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3646 states to 3646 states and 4970 transitions. [2022-01-11 01:50:21,803 INFO L78 Accepts]: Start accepts. Automaton has 3646 states and 4970 transitions. Word has length 69 [2022-01-11 01:50:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:21,804 INFO L470 AbstractCegarLoop]: Abstraction has 3646 states and 4970 transitions. [2022-01-11 01:50:21,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:50:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3646 states and 4970 transitions. [2022-01-11 01:50:21,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-11 01:50:21,807 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:21,807 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] [2022-01-11 01:50:21,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 01:50:21,807 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:21,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:21,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2145666930, now seen corresponding path program 1 times [2022-01-11 01:50:21,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:21,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256417793] [2022-01-11 01:50:21,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:21,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:21,847 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-11 01:50:21,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:21,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256417793] [2022-01-11 01:50:21,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256417793] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:21,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:21,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:21,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184821817] [2022-01-11 01:50:21,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:21,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:21,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:21,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:21,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:21,850 INFO L87 Difference]: Start difference. First operand 3646 states and 4970 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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:50:22,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:22,118 INFO L93 Difference]: Finished difference Result 5290 states and 7074 transitions. [2022-01-11 01:50:22,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:22,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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 100 [2022-01-11 01:50:22,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:22,126 INFO L225 Difference]: With dead ends: 5290 [2022-01-11 01:50:22,127 INFO L226 Difference]: Without dead ends: 3922 [2022-01-11 01:50:22,130 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:50:22,131 INFO L933 BasicCegarLoop]: 3114 mSDtfsCounter, 3094 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3094 SdHoareTripleChecker+Valid, 3202 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:22,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3094 Valid, 3202 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:22,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2022-01-11 01:50:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 3883. [2022-01-11 01:50:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3883 states, 3881 states have (on average 1.36768874001546) internal successors, (5308), 3882 states have internal predecessors, (5308), 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:50:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3883 states to 3883 states and 5308 transitions. [2022-01-11 01:50:22,360 INFO L78 Accepts]: Start accepts. Automaton has 3883 states and 5308 transitions. Word has length 100 [2022-01-11 01:50:22,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:22,360 INFO L470 AbstractCegarLoop]: Abstraction has 3883 states and 5308 transitions. [2022-01-11 01:50:22,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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:50:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3883 states and 5308 transitions. [2022-01-11 01:50:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:50:22,362 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:22,363 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:22,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 01:50:22,363 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:22,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:22,364 INFO L85 PathProgramCache]: Analyzing trace with hash 798906214, now seen corresponding path program 1 times [2022-01-11 01:50:22,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:22,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440940205] [2022-01-11 01:50:22,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:22,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 01:50:22,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:22,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440940205] [2022-01-11 01:50:22,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440940205] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:22,414 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:22,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:22,416 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393691215] [2022-01-11 01:50:22,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:22,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:22,417 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:22,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:22,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:22,417 INFO L87 Difference]: Start difference. First operand 3883 states and 5308 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:50:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:22,664 INFO L93 Difference]: Finished difference Result 5492 states and 7353 transitions. [2022-01-11 01:50:22,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:22,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:50:22,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:22,672 INFO L225 Difference]: With dead ends: 5492 [2022-01-11 01:50:22,672 INFO L226 Difference]: Without dead ends: 3891 [2022-01-11 01:50:22,674 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:50:22,675 INFO L933 BasicCegarLoop]: 3102 mSDtfsCounter, 69 mSDsluCounter, 2992 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 6094 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:22,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 6094 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:22,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3891 states. [2022-01-11 01:50:22,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3891 to 3891. [2022-01-11 01:50:22,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3891 states, 3889 states have (on average 1.3602468500899974) internal successors, (5290), 3890 states have internal predecessors, (5290), 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:50:22,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3891 states to 3891 states and 5290 transitions. [2022-01-11 01:50:22,911 INFO L78 Accepts]: Start accepts. Automaton has 3891 states and 5290 transitions. Word has length 110 [2022-01-11 01:50:22,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:22,912 INFO L470 AbstractCegarLoop]: Abstraction has 3891 states and 5290 transitions. [2022-01-11 01:50:22,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:50:22,912 INFO L276 IsEmpty]: Start isEmpty. Operand 3891 states and 5290 transitions. [2022-01-11 01:50:22,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:50:22,914 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:22,915 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:22,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 01:50:22,915 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:22,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash 558366085, now seen corresponding path program 1 times [2022-01-11 01:50:22,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:22,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918258128] [2022-01-11 01:50:22,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:22,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:22,960 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 01:50:22,961 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:22,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918258128] [2022-01-11 01:50:22,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918258128] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:22,961 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:22,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:22,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978693844] [2022-01-11 01:50:22,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:22,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:22,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:22,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:22,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:22,962 INFO L87 Difference]: Start difference. First operand 3891 states and 5290 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:50:23,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:23,250 INFO L93 Difference]: Finished difference Result 5533 states and 7349 transitions. [2022-01-11 01:50:23,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:23,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:50:23,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:23,260 INFO L225 Difference]: With dead ends: 5533 [2022-01-11 01:50:23,260 INFO L226 Difference]: Without dead ends: 3924 [2022-01-11 01:50:23,264 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:50:23,264 INFO L933 BasicCegarLoop]: 3110 mSDtfsCounter, 2989 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2989 SdHoareTripleChecker+Valid, 3218 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:23,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2989 Valid, 3218 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3924 states. [2022-01-11 01:50:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3924 to 3924. [2022-01-11 01:50:23,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3924 states, 3922 states have (on average 1.35721570627231) internal successors, (5323), 3923 states have internal predecessors, (5323), 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:50:23,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 5323 transitions. [2022-01-11 01:50:23,484 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 5323 transitions. Word has length 110 [2022-01-11 01:50:23,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:23,484 INFO L470 AbstractCegarLoop]: Abstraction has 3924 states and 5323 transitions. [2022-01-11 01:50:23,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:50:23,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 5323 transitions. [2022-01-11 01:50:23,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 01:50:23,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:23,486 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:23,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 01:50:23,487 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:23,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:23,487 INFO L85 PathProgramCache]: Analyzing trace with hash 566125444, now seen corresponding path program 1 times [2022-01-11 01:50:23,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:23,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609041999] [2022-01-11 01:50:23,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:23,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 01:50:23,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:23,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609041999] [2022-01-11 01:50:23,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609041999] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:23,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:23,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:23,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766823364] [2022-01-11 01:50:23,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:23,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:23,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:23,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:23,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:23,540 INFO L87 Difference]: Start difference. First operand 3924 states and 5323 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:50:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:23,756 INFO L93 Difference]: Finished difference Result 4693 states and 6287 transitions. [2022-01-11 01:50:23,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:23,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:50:23,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:23,762 INFO L225 Difference]: With dead ends: 4693 [2022-01-11 01:50:23,763 INFO L226 Difference]: Without dead ends: 3054 [2022-01-11 01:50:23,765 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:50:23,765 INFO L933 BasicCegarLoop]: 3105 mSDtfsCounter, 3067 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3067 SdHoareTripleChecker+Valid, 3126 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:23,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3067 Valid, 3126 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:23,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3054 states. [2022-01-11 01:50:23,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3054 to 3054. [2022-01-11 01:50:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3054 states, 3052 states have (on average 1.381389252948886) internal successors, (4216), 3053 states have internal predecessors, (4216), 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:50:23,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3054 states to 3054 states and 4216 transitions. [2022-01-11 01:50:23,943 INFO L78 Accepts]: Start accepts. Automaton has 3054 states and 4216 transitions. Word has length 110 [2022-01-11 01:50:23,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:23,944 INFO L470 AbstractCegarLoop]: Abstraction has 3054 states and 4216 transitions. [2022-01-11 01:50:23,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:50:23,944 INFO L276 IsEmpty]: Start isEmpty. Operand 3054 states and 4216 transitions. [2022-01-11 01:50:23,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-11 01:50:23,946 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:23,946 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:23,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 01:50:23,946 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:23,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:23,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1607944478, now seen corresponding path program 1 times [2022-01-11 01:50:23,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:23,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059967268] [2022-01-11 01:50:23,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:23,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 01:50:24,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:24,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059967268] [2022-01-11 01:50:24,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059967268] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:24,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:24,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:24,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383441661] [2022-01-11 01:50:24,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:24,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:24,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:24,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:24,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:24,002 INFO L87 Difference]: Start difference. First operand 3054 states and 4216 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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:50:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:24,206 INFO L93 Difference]: Finished difference Result 4119 states and 5524 transitions. [2022-01-11 01:50:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:24,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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 113 [2022-01-11 01:50:24,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:24,212 INFO L225 Difference]: With dead ends: 4119 [2022-01-11 01:50:24,212 INFO L226 Difference]: Without dead ends: 3350 [2022-01-11 01:50:24,214 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:50:24,214 INFO L933 BasicCegarLoop]: 3103 mSDtfsCounter, 3054 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3054 SdHoareTripleChecker+Valid, 3124 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:24,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3054 Valid, 3124 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2022-01-11 01:50:24,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 3350. [2022-01-11 01:50:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3350 states, 3348 states have (on average 1.3611111111111112) internal successors, (4557), 3349 states have internal predecessors, (4557), 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:50:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3350 states to 3350 states and 4557 transitions. [2022-01-11 01:50:24,444 INFO L78 Accepts]: Start accepts. Automaton has 3350 states and 4557 transitions. Word has length 113 [2022-01-11 01:50:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:24,444 INFO L470 AbstractCegarLoop]: Abstraction has 3350 states and 4557 transitions. [2022-01-11 01:50:24,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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:50:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3350 states and 4557 transitions. [2022-01-11 01:50:24,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-11 01:50:24,446 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:24,446 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:24,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 01:50:24,447 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:24,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:24,447 INFO L85 PathProgramCache]: Analyzing trace with hash 2056641117, now seen corresponding path program 1 times [2022-01-11 01:50:24,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:24,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159183580] [2022-01-11 01:50:24,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:24,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:24,510 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 01:50:24,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:24,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159183580] [2022-01-11 01:50:24,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159183580] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:24,511 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:24,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:24,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565114680] [2022-01-11 01:50:24,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:24,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:24,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:24,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:24,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:24,513 INFO L87 Difference]: Start difference. First operand 3350 states and 4557 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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:50:24,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:24,672 INFO L93 Difference]: Finished difference Result 3745 states and 5012 transitions. [2022-01-11 01:50:24,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:24,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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 113 [2022-01-11 01:50:24,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:24,677 INFO L225 Difference]: With dead ends: 3745 [2022-01-11 01:50:24,677 INFO L226 Difference]: Without dead ends: 2021 [2022-01-11 01:50:24,679 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:50:24,680 INFO L933 BasicCegarLoop]: 3102 mSDtfsCounter, 58 mSDsluCounter, 2994 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 6096 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:24,680 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 6096 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:24,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2022-01-11 01:50:24,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 2021. [2022-01-11 01:50:24,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2021 states, 2020 states have (on average 1.4801980198019802) internal successors, (2990), 2020 states have internal predecessors, (2990), 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:50:24,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2990 transitions. [2022-01-11 01:50:24,757 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2990 transitions. Word has length 113 [2022-01-11 01:50:24,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:24,758 INFO L470 AbstractCegarLoop]: Abstraction has 2021 states and 2990 transitions. [2022-01-11 01:50:24,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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:50:24,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2990 transitions. [2022-01-11 01:50:24,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:24,759 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:24,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:24,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 01:50:24,760 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:24,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:24,760 INFO L85 PathProgramCache]: Analyzing trace with hash 875153621, now seen corresponding path program 1 times [2022-01-11 01:50:24,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:24,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218380651] [2022-01-11 01:50:24,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:24,761 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:24,818 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:50:24,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:24,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218380651] [2022-01-11 01:50:24,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218380651] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:24,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:24,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:24,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752324430] [2022-01-11 01:50:24,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:24,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:24,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:24,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:24,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:24,820 INFO L87 Difference]: Start difference. First operand 2021 states and 2990 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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:50:24,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:24,919 INFO L93 Difference]: Finished difference Result 4025 states and 5951 transitions. [2022-01-11 01:50:24,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:24,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:24,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:24,923 INFO L225 Difference]: With dead ends: 4025 [2022-01-11 01:50:24,924 INFO L226 Difference]: Without dead ends: 2021 [2022-01-11 01:50:24,926 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:50:24,927 INFO L933 BasicCegarLoop]: 2988 mSDtfsCounter, 2973 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2973 SdHoareTripleChecker+Valid, 2989 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:50:24,927 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2973 Valid, 2989 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:24,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2022-01-11 01:50:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 2021. [2022-01-11 01:50:25,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2021 states, 2020 states have (on average 1.4797029702970297) internal successors, (2989), 2020 states have internal predecessors, (2989), 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:50:25,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 2989 transitions. [2022-01-11 01:50:25,043 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 2989 transitions. Word has length 176 [2022-01-11 01:50:25,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:25,043 INFO L470 AbstractCegarLoop]: Abstraction has 2021 states and 2989 transitions. [2022-01-11 01:50:25,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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:50:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 2989 transitions. [2022-01-11 01:50:25,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:25,045 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:25,045 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:25,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 01:50:25,045 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:25,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:25,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1268152566, now seen corresponding path program 1 times [2022-01-11 01:50:25,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:25,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286232757] [2022-01-11 01:50:25,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:25,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:25,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:25,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:25,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286232757] [2022-01-11 01:50:25,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286232757] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:25,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:25,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:25,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325734546] [2022-01-11 01:50:25,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:25,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:25,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:25,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:25,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:25,110 INFO L87 Difference]: Start difference. First operand 2021 states and 2989 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:25,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:25,291 INFO L93 Difference]: Finished difference Result 5766 states and 8502 transitions. [2022-01-11 01:50:25,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:25,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:25,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:25,300 INFO L225 Difference]: With dead ends: 5766 [2022-01-11 01:50:25,300 INFO L226 Difference]: Without dead ends: 3766 [2022-01-11 01:50:25,305 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:50:25,306 INFO L933 BasicCegarLoop]: 3038 mSDtfsCounter, 2821 mSDsluCounter, 2695 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2821 SdHoareTripleChecker+Valid, 5733 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:50:25,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2821 Valid, 5733 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:25,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3766 states. [2022-01-11 01:50:25,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 3764. [2022-01-11 01:50:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.473026840287005) internal successors, (5543), 3763 states have internal predecessors, (5543), 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:50:25,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5543 transitions. [2022-01-11 01:50:25,471 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5543 transitions. Word has length 176 [2022-01-11 01:50:25,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:25,471 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5543 transitions. [2022-01-11 01:50:25,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:25,472 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5543 transitions. [2022-01-11 01:50:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:25,473 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:25,473 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:25,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 01:50:25,473 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:25,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:25,474 INFO L85 PathProgramCache]: Analyzing trace with hash -837550314, now seen corresponding path program 1 times [2022-01-11 01:50:25,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:25,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188840077] [2022-01-11 01:50:25,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:25,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:25,523 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:50:25,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:25,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188840077] [2022-01-11 01:50:25,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188840077] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:25,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:25,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:25,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013323458] [2022-01-11 01:50:25,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:25,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:25,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:25,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:25,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:25,527 INFO L87 Difference]: Start difference. First operand 3764 states and 5543 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:25,747 INFO L93 Difference]: Finished difference Result 7506 states and 11050 transitions. [2022-01-11 01:50:25,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:25,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:25,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:25,755 INFO L225 Difference]: With dead ends: 7506 [2022-01-11 01:50:25,756 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:25,759 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:50:25,761 INFO L933 BasicCegarLoop]: 2977 mSDtfsCounter, 2961 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2961 SdHoareTripleChecker+Valid, 2977 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:50:25,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2961 Valid, 2977 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:25,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:25,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.4709008769598724) internal successors, (5535), 3763 states have internal predecessors, (5535), 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:50:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5535 transitions. [2022-01-11 01:50:25,978 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5535 transitions. Word has length 176 [2022-01-11 01:50:25,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:25,979 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5535 transitions. [2022-01-11 01:50:25,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5535 transitions. [2022-01-11 01:50:25,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:25,981 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:25,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:25,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 01:50:25,981 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:25,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:25,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1598212874, now seen corresponding path program 1 times [2022-01-11 01:50:25,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:25,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176760649] [2022-01-11 01:50:25,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:25,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:26,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:26,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:26,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176760649] [2022-01-11 01:50:26,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176760649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:26,039 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:26,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:26,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020824939] [2022-01-11 01:50:26,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:26,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:26,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:26,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:26,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:26,041 INFO L87 Difference]: Start difference. First operand 3764 states and 5535 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:26,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:26,240 INFO L93 Difference]: Finished difference Result 7505 states and 11033 transitions. [2022-01-11 01:50:26,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:26,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:26,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:26,249 INFO L225 Difference]: With dead ends: 7505 [2022-01-11 01:50:26,249 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:26,255 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:50:26,256 INFO L933 BasicCegarLoop]: 2972 mSDtfsCounter, 2955 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2955 SdHoareTripleChecker+Valid, 2972 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:50:26,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2955 Valid, 2972 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:26,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:26,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.46877491363274) internal successors, (5527), 3763 states have internal predecessors, (5527), 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:50:26,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5527 transitions. [2022-01-11 01:50:26,442 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5527 transitions. Word has length 176 [2022-01-11 01:50:26,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:26,442 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5527 transitions. [2022-01-11 01:50:26,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5527 transitions. [2022-01-11 01:50:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:26,444 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:26,444 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:26,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 01:50:26,444 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:26,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:26,444 INFO L85 PathProgramCache]: Analyzing trace with hash 455459606, now seen corresponding path program 1 times [2022-01-11 01:50:26,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:26,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640920404] [2022-01-11 01:50:26,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:26,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:26,505 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:50:26,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:26,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640920404] [2022-01-11 01:50:26,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640920404] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:26,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:26,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:26,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045951777] [2022-01-11 01:50:26,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:26,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:26,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:26,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:26,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:26,507 INFO L87 Difference]: Start difference. First operand 3764 states and 5527 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:26,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:26,719 INFO L93 Difference]: Finished difference Result 7504 states and 11016 transitions. [2022-01-11 01:50:26,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:26,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:26,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:26,728 INFO L225 Difference]: With dead ends: 7504 [2022-01-11 01:50:26,728 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:26,733 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:50:26,733 INFO L933 BasicCegarLoop]: 2967 mSDtfsCounter, 2949 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2949 SdHoareTripleChecker+Valid, 2967 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:50:26,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2949 Valid, 2967 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:26,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:26,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:26,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.4666489503056073) internal successors, (5519), 3763 states have internal predecessors, (5519), 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:50:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5519 transitions. [2022-01-11 01:50:26,925 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5519 transitions. Word has length 176 [2022-01-11 01:50:26,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:26,926 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5519 transitions. [2022-01-11 01:50:26,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:26,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5519 transitions. [2022-01-11 01:50:26,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:26,927 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:26,928 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:26,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 01:50:26,928 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:26,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:26,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1214443766, now seen corresponding path program 1 times [2022-01-11 01:50:26,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:26,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13447570] [2022-01-11 01:50:26,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:26,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:26,974 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:50:26,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:26,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13447570] [2022-01-11 01:50:26,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13447570] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:26,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:26,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:26,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856746624] [2022-01-11 01:50:26,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:26,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:26,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:26,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:26,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:26,977 INFO L87 Difference]: Start difference. First operand 3764 states and 5519 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:27,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:27,185 INFO L93 Difference]: Finished difference Result 7503 states and 10999 transitions. [2022-01-11 01:50:27,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:27,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:27,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:27,194 INFO L225 Difference]: With dead ends: 7503 [2022-01-11 01:50:27,194 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:27,200 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:50:27,200 INFO L933 BasicCegarLoop]: 2962 mSDtfsCounter, 2943 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2943 SdHoareTripleChecker+Valid, 2962 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:50:27,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2943 Valid, 2962 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:27,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:27,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:27,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.4645229869784746) internal successors, (5511), 3763 states have internal predecessors, (5511), 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:50:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5511 transitions. [2022-01-11 01:50:27,431 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5511 transitions. Word has length 176 [2022-01-11 01:50:27,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:27,431 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5511 transitions. [2022-01-11 01:50:27,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:27,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5511 transitions. [2022-01-11 01:50:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:27,434 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:27,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:27,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 01:50:27,435 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:27,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:27,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1238927126, now seen corresponding path program 1 times [2022-01-11 01:50:27,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:27,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007269611] [2022-01-11 01:50:27,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:27,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:27,483 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:50:27,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:27,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007269611] [2022-01-11 01:50:27,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007269611] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:27,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:27,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:27,483 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673454309] [2022-01-11 01:50:27,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:27,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:27,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:27,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:27,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:27,485 INFO L87 Difference]: Start difference. First operand 3764 states and 5511 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:27,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:27,685 INFO L93 Difference]: Finished difference Result 7501 states and 10980 transitions. [2022-01-11 01:50:27,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:27,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:27,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:27,693 INFO L225 Difference]: With dead ends: 7501 [2022-01-11 01:50:27,693 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:27,700 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:50:27,701 INFO L933 BasicCegarLoop]: 2957 mSDtfsCounter, 2936 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2936 SdHoareTripleChecker+Valid, 2957 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:50:27,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2936 Valid, 2957 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:27,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.462397023651342) internal successors, (5503), 3763 states have internal predecessors, (5503), 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:50:27,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5503 transitions. [2022-01-11 01:50:27,889 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5503 transitions. Word has length 176 [2022-01-11 01:50:27,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:27,889 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5503 transitions. [2022-01-11 01:50:27,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:27,889 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5503 transitions. [2022-01-11 01:50:27,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:27,891 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:27,891 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:27,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 01:50:27,891 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:27,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:27,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1040374474, now seen corresponding path program 1 times [2022-01-11 01:50:27,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:27,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838904695] [2022-01-11 01:50:27,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:27,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:27,938 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:50:27,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:27,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838904695] [2022-01-11 01:50:27,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838904695] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:27,938 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:27,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:27,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904803307] [2022-01-11 01:50:27,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:27,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:27,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:27,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:27,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:27,939 INFO L87 Difference]: Start difference. First operand 3764 states and 5503 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:28,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:28,191 INFO L93 Difference]: Finished difference Result 7500 states and 10963 transitions. [2022-01-11 01:50:28,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:28,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:28,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:28,198 INFO L225 Difference]: With dead ends: 7500 [2022-01-11 01:50:28,198 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:28,202 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:50:28,203 INFO L933 BasicCegarLoop]: 2952 mSDtfsCounter, 2930 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2930 SdHoareTripleChecker+Valid, 2952 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:50:28,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2930 Valid, 2952 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:28,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:28,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.4602710603242095) internal successors, (5495), 3763 states have internal predecessors, (5495), 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:50:28,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5495 transitions. [2022-01-11 01:50:28,415 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5495 transitions. Word has length 176 [2022-01-11 01:50:28,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:28,416 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5495 transitions. [2022-01-11 01:50:28,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:28,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5495 transitions. [2022-01-11 01:50:28,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:28,417 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:28,418 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:28,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 01:50:28,418 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:28,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:28,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1102856982, now seen corresponding path program 1 times [2022-01-11 01:50:28,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:28,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335749126] [2022-01-11 01:50:28,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:28,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:28,478 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:50:28,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:28,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335749126] [2022-01-11 01:50:28,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335749126] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:28,478 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:28,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:28,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824816458] [2022-01-11 01:50:28,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:28,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:28,479 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:28,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:28,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:28,480 INFO L87 Difference]: Start difference. First operand 3764 states and 5495 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:28,644 INFO L93 Difference]: Finished difference Result 7499 states and 10946 transitions. [2022-01-11 01:50:28,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:28,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:28,652 INFO L225 Difference]: With dead ends: 7499 [2022-01-11 01:50:28,652 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:28,658 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:50:28,658 INFO L933 BasicCegarLoop]: 2947 mSDtfsCounter, 2924 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2924 SdHoareTripleChecker+Valid, 2947 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:50:28,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2924 Valid, 2947 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:28,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:28,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.4581450969970768) internal successors, (5487), 3763 states have internal predecessors, (5487), 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:50:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5487 transitions. [2022-01-11 01:50:28,930 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5487 transitions. Word has length 176 [2022-01-11 01:50:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:28,930 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5487 transitions. [2022-01-11 01:50:28,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5487 transitions. [2022-01-11 01:50:28,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:28,932 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:28,933 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:28,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 01:50:28,933 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:28,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1598953162, now seen corresponding path program 1 times [2022-01-11 01:50:28,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:28,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067880785] [2022-01-11 01:50:28,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:28,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:28,991 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:28,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067880785] [2022-01-11 01:50:28,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067880785] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:28,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:28,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:28,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493968410] [2022-01-11 01:50:28,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:28,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:28,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:28,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:28,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:28,993 INFO L87 Difference]: Start difference. First operand 3764 states and 5487 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:29,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:29,257 INFO L93 Difference]: Finished difference Result 7498 states and 10929 transitions. [2022-01-11 01:50:29,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:29,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:29,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:29,262 INFO L225 Difference]: With dead ends: 7498 [2022-01-11 01:50:29,262 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:29,268 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:50:29,269 INFO L933 BasicCegarLoop]: 2942 mSDtfsCounter, 2918 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2918 SdHoareTripleChecker+Valid, 2942 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:50:29,269 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2918 Valid, 2942 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:29,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:29,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:29,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.4560191336699442) internal successors, (5479), 3763 states have internal predecessors, (5479), 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:50:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5479 transitions. [2022-01-11 01:50:29,563 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5479 transitions. Word has length 176 [2022-01-11 01:50:29,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:29,563 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5479 transitions. [2022-01-11 01:50:29,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5479 transitions. [2022-01-11 01:50:29,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:29,564 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:29,564 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:29,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 01:50:29,565 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:29,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:29,565 INFO L85 PathProgramCache]: Analyzing trace with hash 392101654, now seen corresponding path program 1 times [2022-01-11 01:50:29,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:29,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970255534] [2022-01-11 01:50:29,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:29,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:29,615 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:50:29,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:29,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970255534] [2022-01-11 01:50:29,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970255534] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:29,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:29,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:29,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552159720] [2022-01-11 01:50:29,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:29,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:29,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:29,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:29,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:29,617 INFO L87 Difference]: Start difference. First operand 3764 states and 5479 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:29,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:29,831 INFO L93 Difference]: Finished difference Result 7497 states and 10912 transitions. [2022-01-11 01:50:29,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:29,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:29,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:29,835 INFO L225 Difference]: With dead ends: 7497 [2022-01-11 01:50:29,835 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:29,839 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:50:29,839 INFO L933 BasicCegarLoop]: 2937 mSDtfsCounter, 2912 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2912 SdHoareTripleChecker+Valid, 2937 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:50:29,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2912 Valid, 2937 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:29,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:30,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.4538931703428115) internal successors, (5471), 3763 states have internal predecessors, (5471), 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:50:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5471 transitions. [2022-01-11 01:50:30,095 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5471 transitions. Word has length 176 [2022-01-11 01:50:30,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:30,095 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5471 transitions. [2022-01-11 01:50:30,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5471 transitions. [2022-01-11 01:50:30,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:30,096 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:30,097 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:30,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 01:50:30,097 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:30,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:30,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1841802550, now seen corresponding path program 1 times [2022-01-11 01:50:30,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:30,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334536968] [2022-01-11 01:50:30,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:30,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:30,142 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:50:30,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:30,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334536968] [2022-01-11 01:50:30,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334536968] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:30,143 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:30,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:30,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847290938] [2022-01-11 01:50:30,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:30,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:30,144 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:30,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:30,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:30,144 INFO L87 Difference]: Start difference. First operand 3764 states and 5471 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:30,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:30,385 INFO L93 Difference]: Finished difference Result 7496 states and 10895 transitions. [2022-01-11 01:50:30,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:30,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:30,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:30,390 INFO L225 Difference]: With dead ends: 7496 [2022-01-11 01:50:30,390 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:30,395 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:50:30,395 INFO L933 BasicCegarLoop]: 2932 mSDtfsCounter, 2906 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2906 SdHoareTripleChecker+Valid, 2932 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:50:30,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2906 Valid, 2932 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:30,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:30,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.451767207015679) internal successors, (5463), 3763 states have internal predecessors, (5463), 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:50:30,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5463 transitions. [2022-01-11 01:50:30,566 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5463 transitions. Word has length 176 [2022-01-11 01:50:30,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:30,566 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5463 transitions. [2022-01-11 01:50:30,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5463 transitions. [2022-01-11 01:50:30,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:30,568 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:30,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:30,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 01:50:30,568 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:30,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:30,569 INFO L85 PathProgramCache]: Analyzing trace with hash 780188438, now seen corresponding path program 1 times [2022-01-11 01:50:30,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:30,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670032904] [2022-01-11 01:50:30,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:30,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:30,612 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:50:30,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:30,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670032904] [2022-01-11 01:50:30,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670032904] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:30,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:30,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:30,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135099751] [2022-01-11 01:50:30,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:30,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:30,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:30,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:30,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:30,614 INFO L87 Difference]: Start difference. First operand 3764 states and 5463 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:30,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:30,804 INFO L93 Difference]: Finished difference Result 7495 states and 10878 transitions. [2022-01-11 01:50:30,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:30,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:30,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:30,809 INFO L225 Difference]: With dead ends: 7495 [2022-01-11 01:50:30,809 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:30,813 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:50:30,813 INFO L933 BasicCegarLoop]: 2927 mSDtfsCounter, 2900 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2900 SdHoareTripleChecker+Valid, 2927 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:50:30,813 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2900 Valid, 2927 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:30,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:31,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:31,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.4496412436885464) internal successors, (5455), 3763 states have internal predecessors, (5455), 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:50:31,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5455 transitions. [2022-01-11 01:50:31,039 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5455 transitions. Word has length 176 [2022-01-11 01:50:31,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:31,040 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5455 transitions. [2022-01-11 01:50:31,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:31,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5455 transitions. [2022-01-11 01:50:31,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:31,041 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:31,041 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:31,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 01:50:31,041 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:31,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:31,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1300132150, now seen corresponding path program 1 times [2022-01-11 01:50:31,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:31,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067986060] [2022-01-11 01:50:31,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:31,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:31,087 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:50:31,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:31,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067986060] [2022-01-11 01:50:31,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067986060] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:31,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:31,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:31,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108136840] [2022-01-11 01:50:31,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:31,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:31,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:31,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:31,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:31,088 INFO L87 Difference]: Start difference. First operand 3764 states and 5455 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:31,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:31,290 INFO L93 Difference]: Finished difference Result 7494 states and 10861 transitions. [2022-01-11 01:50:31,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:31,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:31,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:31,294 INFO L225 Difference]: With dead ends: 7494 [2022-01-11 01:50:31,294 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:31,297 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:50:31,298 INFO L933 BasicCegarLoop]: 2922 mSDtfsCounter, 2894 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2894 SdHoareTripleChecker+Valid, 2922 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:50:31,298 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2894 Valid, 2922 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:31,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.4475152803614137) internal successors, (5447), 3763 states have internal predecessors, (5447), 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:50:31,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5447 transitions. [2022-01-11 01:50:31,481 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5447 transitions. Word has length 176 [2022-01-11 01:50:31,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:31,482 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5447 transitions. [2022-01-11 01:50:31,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:31,482 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5447 transitions. [2022-01-11 01:50:31,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:31,483 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:31,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:31,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 01:50:31,483 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:31,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:31,484 INFO L85 PathProgramCache]: Analyzing trace with hash -622758122, now seen corresponding path program 1 times [2022-01-11 01:50:31,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:31,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964279774] [2022-01-11 01:50:31,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:31,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:31,528 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:50:31,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:31,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964279774] [2022-01-11 01:50:31,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964279774] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:31,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:31,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:31,528 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768736139] [2022-01-11 01:50:31,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:31,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:31,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:31,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:31,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:31,529 INFO L87 Difference]: Start difference. First operand 3764 states and 5447 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:31,841 INFO L93 Difference]: Finished difference Result 7493 states and 10844 transitions. [2022-01-11 01:50:31,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:31,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:31,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:31,845 INFO L225 Difference]: With dead ends: 7493 [2022-01-11 01:50:31,845 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:31,847 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:50:31,847 INFO L933 BasicCegarLoop]: 2885 mSDtfsCounter, 2730 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2730 SdHoareTripleChecker+Valid, 3023 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:31,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2730 Valid, 3023 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:31,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:32,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.437416954557534) internal successors, (5409), 3763 states have internal predecessors, (5409), 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:50:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5409 transitions. [2022-01-11 01:50:32,024 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5409 transitions. Word has length 176 [2022-01-11 01:50:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:32,024 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5409 transitions. [2022-01-11 01:50:32,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5409 transitions. [2022-01-11 01:50:32,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:32,026 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:32,026 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:32,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 01:50:32,026 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:32,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:32,026 INFO L85 PathProgramCache]: Analyzing trace with hash -846782283, now seen corresponding path program 1 times [2022-01-11 01:50:32,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:32,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419733188] [2022-01-11 01:50:32,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:32,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:32,071 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:50:32,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:32,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419733188] [2022-01-11 01:50:32,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419733188] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:32,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:32,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:32,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902659862] [2022-01-11 01:50:32,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:32,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:32,073 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:32,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:32,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:32,073 INFO L87 Difference]: Start difference. First operand 3764 states and 5409 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:32,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:32,314 INFO L93 Difference]: Finished difference Result 7492 states and 10767 transitions. [2022-01-11 01:50:32,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:32,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:32,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:32,319 INFO L225 Difference]: With dead ends: 7492 [2022-01-11 01:50:32,319 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:32,322 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:50:32,322 INFO L933 BasicCegarLoop]: 2864 mSDtfsCounter, 2709 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2709 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:32,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2709 Valid, 3001 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:32,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.427318628753654) internal successors, (5371), 3763 states have internal predecessors, (5371), 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:50:32,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5371 transitions. [2022-01-11 01:50:32,516 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5371 transitions. Word has length 176 [2022-01-11 01:50:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:32,516 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5371 transitions. [2022-01-11 01:50:32,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:32,516 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5371 transitions. [2022-01-11 01:50:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:32,517 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:32,517 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:32,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 01:50:32,518 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:32,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:32,518 INFO L85 PathProgramCache]: Analyzing trace with hash 119362900, now seen corresponding path program 1 times [2022-01-11 01:50:32,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:32,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64580375] [2022-01-11 01:50:32,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:32,519 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:32,561 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:50:32,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:32,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64580375] [2022-01-11 01:50:32,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64580375] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:32,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:32,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:32,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334962323] [2022-01-11 01:50:32,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:32,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:32,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:32,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:32,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:32,563 INFO L87 Difference]: Start difference. First operand 3764 states and 5371 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:32,916 INFO L93 Difference]: Finished difference Result 7491 states and 10690 transitions. [2022-01-11 01:50:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:32,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:32,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:32,921 INFO L225 Difference]: With dead ends: 7491 [2022-01-11 01:50:32,921 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:32,925 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:50:32,925 INFO L933 BasicCegarLoop]: 2843 mSDtfsCounter, 2688 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2688 SdHoareTripleChecker+Valid, 2979 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:32,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2688 Valid, 2979 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:50:32,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:33,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.417220302949774) internal successors, (5333), 3763 states have internal predecessors, (5333), 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:50:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5333 transitions. [2022-01-11 01:50:33,222 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5333 transitions. Word has length 176 [2022-01-11 01:50:33,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:33,222 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5333 transitions. [2022-01-11 01:50:33,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5333 transitions. [2022-01-11 01:50:33,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:33,223 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:33,223 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:33,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 01:50:33,223 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:33,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:33,224 INFO L85 PathProgramCache]: Analyzing trace with hash -42332813, now seen corresponding path program 1 times [2022-01-11 01:50:33,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:33,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216134362] [2022-01-11 01:50:33,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:33,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:33,266 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:50:33,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:33,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216134362] [2022-01-11 01:50:33,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216134362] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:33,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:33,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:33,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596840036] [2022-01-11 01:50:33,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:33,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:33,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:33,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:33,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:33,270 INFO L87 Difference]: Start difference. First operand 3764 states and 5333 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:33,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:33,519 INFO L93 Difference]: Finished difference Result 7490 states and 10613 transitions. [2022-01-11 01:50:33,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:33,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:33,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:33,525 INFO L225 Difference]: With dead ends: 7490 [2022-01-11 01:50:33,525 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:33,528 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:50:33,529 INFO L933 BasicCegarLoop]: 2822 mSDtfsCounter, 2667 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2667 SdHoareTripleChecker+Valid, 2957 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:33,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2667 Valid, 2957 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:33,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.4071219771458943) internal successors, (5295), 3763 states have internal predecessors, (5295), 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:50:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5295 transitions. [2022-01-11 01:50:33,716 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5295 transitions. Word has length 176 [2022-01-11 01:50:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:33,716 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5295 transitions. [2022-01-11 01:50:33,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5295 transitions. [2022-01-11 01:50:33,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:33,717 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:33,717 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:33,718 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 01:50:33,718 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:33,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:33,718 INFO L85 PathProgramCache]: Analyzing trace with hash 897261714, now seen corresponding path program 1 times [2022-01-11 01:50:33,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:33,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719443333] [2022-01-11 01:50:33,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:33,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:33,788 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:50:33,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:33,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719443333] [2022-01-11 01:50:33,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719443333] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:33,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:33,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:33,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971638035] [2022-01-11 01:50:33,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:33,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:33,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:33,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:33,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:33,791 INFO L87 Difference]: Start difference. First operand 3764 states and 5295 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:34,057 INFO L93 Difference]: Finished difference Result 7489 states and 10536 transitions. [2022-01-11 01:50:34,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:34,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:34,061 INFO L225 Difference]: With dead ends: 7489 [2022-01-11 01:50:34,061 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:34,064 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:50:34,065 INFO L933 BasicCegarLoop]: 2801 mSDtfsCounter, 2646 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2646 SdHoareTripleChecker+Valid, 2935 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:34,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2646 Valid, 2935 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:34,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:34,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.3970236513420144) internal successors, (5257), 3763 states have internal predecessors, (5257), 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:50:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5257 transitions. [2022-01-11 01:50:34,244 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5257 transitions. Word has length 176 [2022-01-11 01:50:34,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:34,244 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5257 transitions. [2022-01-11 01:50:34,244 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:34,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5257 transitions. [2022-01-11 01:50:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:34,245 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:34,245 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:34,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 01:50:34,245 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:34,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash -836327631, now seen corresponding path program 1 times [2022-01-11 01:50:34,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:34,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147942807] [2022-01-11 01:50:34,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:34,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:34,288 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:50:34,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:34,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147942807] [2022-01-11 01:50:34,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147942807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:34,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:34,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:34,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69409649] [2022-01-11 01:50:34,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:34,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:34,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:34,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:34,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:34,290 INFO L87 Difference]: Start difference. First operand 3764 states and 5257 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:34,561 INFO L93 Difference]: Finished difference Result 7488 states and 10459 transitions. [2022-01-11 01:50:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:34,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:34,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:34,565 INFO L225 Difference]: With dead ends: 7488 [2022-01-11 01:50:34,565 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:34,568 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:50:34,569 INFO L933 BasicCegarLoop]: 2780 mSDtfsCounter, 2625 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2625 SdHoareTripleChecker+Valid, 2913 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:34,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2625 Valid, 2913 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:34,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.3869253255381344) internal successors, (5219), 3763 states have internal predecessors, (5219), 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:50:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5219 transitions. [2022-01-11 01:50:34,802 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5219 transitions. Word has length 176 [2022-01-11 01:50:34,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:34,802 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5219 transitions. [2022-01-11 01:50:34,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:34,803 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5219 transitions. [2022-01-11 01:50:34,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:34,803 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:34,803 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:34,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-11 01:50:34,804 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:34,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:34,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1124706096, now seen corresponding path program 1 times [2022-01-11 01:50:34,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:34,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086067321] [2022-01-11 01:50:34,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:34,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:34,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:34,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086067321] [2022-01-11 01:50:34,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086067321] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:34,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:34,855 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:34,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32903854] [2022-01-11 01:50:34,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:34,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:34,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:34,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:34,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:34,856 INFO L87 Difference]: Start difference. First operand 3764 states and 5219 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:35,201 INFO L93 Difference]: Finished difference Result 7487 states and 10382 transitions. [2022-01-11 01:50:35,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:35,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:35,207 INFO L225 Difference]: With dead ends: 7487 [2022-01-11 01:50:35,207 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:35,211 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:50:35,212 INFO L933 BasicCegarLoop]: 2759 mSDtfsCounter, 2604 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2604 SdHoareTripleChecker+Valid, 2891 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:35,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2604 Valid, 2891 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:35,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.3768269997342546) internal successors, (5181), 3763 states have internal predecessors, (5181), 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:50:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5181 transitions. [2022-01-11 01:50:35,486 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5181 transitions. Word has length 176 [2022-01-11 01:50:35,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:35,486 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5181 transitions. [2022-01-11 01:50:35,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:35,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5181 transitions. [2022-01-11 01:50:35,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:35,487 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:35,487 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:35,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-11 01:50:35,487 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:35,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:35,487 INFO L85 PathProgramCache]: Analyzing trace with hash -911708689, now seen corresponding path program 1 times [2022-01-11 01:50:35,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:35,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026788437] [2022-01-11 01:50:35,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:35,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:35,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:35,535 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:50:35,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:35,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026788437] [2022-01-11 01:50:35,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026788437] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:35,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:35,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:35,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895365413] [2022-01-11 01:50:35,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:35,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:35,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:35,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:35,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:35,537 INFO L87 Difference]: Start difference. First operand 3764 states and 5181 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:35,917 INFO L93 Difference]: Finished difference Result 7486 states and 10305 transitions. [2022-01-11 01:50:35,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:35,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:35,922 INFO L225 Difference]: With dead ends: 7486 [2022-01-11 01:50:35,922 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:35,925 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:50:35,925 INFO L933 BasicCegarLoop]: 2738 mSDtfsCounter, 2583 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2583 SdHoareTripleChecker+Valid, 2869 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:35,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2583 Valid, 2869 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:35,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.3667286739303748) internal successors, (5143), 3763 states have internal predecessors, (5143), 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:50:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5143 transitions. [2022-01-11 01:50:36,145 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5143 transitions. Word has length 176 [2022-01-11 01:50:36,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:36,146 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5143 transitions. [2022-01-11 01:50:36,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5143 transitions. [2022-01-11 01:50:36,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:36,146 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:36,146 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:36,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-11 01:50:36,147 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:36,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:36,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1103789582, now seen corresponding path program 1 times [2022-01-11 01:50:36,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:36,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999687048] [2022-01-11 01:50:36,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:36,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:36,190 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:50:36,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:36,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999687048] [2022-01-11 01:50:36,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999687048] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:36,191 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:36,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:36,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261083141] [2022-01-11 01:50:36,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:36,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:36,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:36,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:36,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:36,192 INFO L87 Difference]: Start difference. First operand 3764 states and 5143 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:36,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:36,533 INFO L93 Difference]: Finished difference Result 7485 states and 10228 transitions. [2022-01-11 01:50:36,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:36,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:36,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:36,539 INFO L225 Difference]: With dead ends: 7485 [2022-01-11 01:50:36,539 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:36,544 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:50:36,544 INFO L933 BasicCegarLoop]: 2717 mSDtfsCounter, 2562 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2562 SdHoareTripleChecker+Valid, 2847 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:36,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2562 Valid, 2847 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:36,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:36,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.3566303481264947) internal successors, (5105), 3763 states have internal predecessors, (5105), 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:50:36,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5105 transitions. [2022-01-11 01:50:36,776 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5105 transitions. Word has length 176 [2022-01-11 01:50:36,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:36,776 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5105 transitions. [2022-01-11 01:50:36,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5105 transitions. [2022-01-11 01:50:36,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:36,777 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:36,777 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:36,777 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-11 01:50:36,777 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:36,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:36,777 INFO L85 PathProgramCache]: Analyzing trace with hash -681909843, now seen corresponding path program 1 times [2022-01-11 01:50:36,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:36,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017223096] [2022-01-11 01:50:36,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:36,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:36,818 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:50:36,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:36,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017223096] [2022-01-11 01:50:36,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017223096] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:36,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:36,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:36,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586617322] [2022-01-11 01:50:36,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:36,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:36,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:36,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:36,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:36,820 INFO L87 Difference]: Start difference. First operand 3764 states and 5105 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:37,257 INFO L93 Difference]: Finished difference Result 7484 states and 10151 transitions. [2022-01-11 01:50:37,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:37,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:37,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:37,262 INFO L225 Difference]: With dead ends: 7484 [2022-01-11 01:50:37,263 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:37,268 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:50:37,277 INFO L933 BasicCegarLoop]: 2696 mSDtfsCounter, 2541 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2541 SdHoareTripleChecker+Valid, 2825 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:37,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2541 Valid, 2825 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:37,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:37,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.346532022322615) internal successors, (5067), 3763 states have internal predecessors, (5067), 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:50:37,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5067 transitions. [2022-01-11 01:50:37,507 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5067 transitions. Word has length 176 [2022-01-11 01:50:37,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:37,507 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5067 transitions. [2022-01-11 01:50:37,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:37,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5067 transitions. [2022-01-11 01:50:37,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:37,508 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:37,508 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:37,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-11 01:50:37,509 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:37,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:37,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1787621300, now seen corresponding path program 1 times [2022-01-11 01:50:37,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:37,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943668025] [2022-01-11 01:50:37,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:37,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:37,550 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:50:37,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:37,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943668025] [2022-01-11 01:50:37,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943668025] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:37,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:37,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:37,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112509445] [2022-01-11 01:50:37,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:37,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:37,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:37,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:37,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:37,551 INFO L87 Difference]: Start difference. First operand 3764 states and 5067 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:37,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:37,855 INFO L93 Difference]: Finished difference Result 7483 states and 10074 transitions. [2022-01-11 01:50:37,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:37,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:37,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:37,860 INFO L225 Difference]: With dead ends: 7483 [2022-01-11 01:50:37,860 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:37,865 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:50:37,866 INFO L933 BasicCegarLoop]: 2675 mSDtfsCounter, 2520 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2520 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:37,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2520 Valid, 2803 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:38,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.3364336965187351) internal successors, (5029), 3763 states have internal predecessors, (5029), 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:50:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 5029 transitions. [2022-01-11 01:50:38,121 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 5029 transitions. Word has length 176 [2022-01-11 01:50:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:38,121 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 5029 transitions. [2022-01-11 01:50:38,121 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 5029 transitions. [2022-01-11 01:50:38,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:38,122 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:38,122 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:38,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-11 01:50:38,122 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:38,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:38,122 INFO L85 PathProgramCache]: Analyzing trace with hash 467239531, now seen corresponding path program 1 times [2022-01-11 01:50:38,122 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:38,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795064644] [2022-01-11 01:50:38,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:38,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:38,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:38,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795064644] [2022-01-11 01:50:38,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795064644] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:38,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:38,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:38,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089590267] [2022-01-11 01:50:38,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:38,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:38,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:38,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:38,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:38,166 INFO L87 Difference]: Start difference. First operand 3764 states and 5029 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:38,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:38,456 INFO L93 Difference]: Finished difference Result 7482 states and 9997 transitions. [2022-01-11 01:50:38,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:38,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:38,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:38,461 INFO L225 Difference]: With dead ends: 7482 [2022-01-11 01:50:38,461 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:38,464 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:50:38,464 INFO L933 BasicCegarLoop]: 2654 mSDtfsCounter, 2499 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2499 SdHoareTripleChecker+Valid, 2781 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:38,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2499 Valid, 2781 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:38,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:38,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.326335370714855) internal successors, (4991), 3763 states have internal predecessors, (4991), 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:50:38,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 4991 transitions. [2022-01-11 01:50:38,678 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 4991 transitions. Word has length 176 [2022-01-11 01:50:38,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:38,678 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 4991 transitions. [2022-01-11 01:50:38,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:38,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 4991 transitions. [2022-01-11 01:50:38,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:38,679 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:38,679 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:38,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-11 01:50:38,679 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:38,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:38,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1767141494, now seen corresponding path program 1 times [2022-01-11 01:50:38,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:38,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018168505] [2022-01-11 01:50:38,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:38,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:38,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:38,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018168505] [2022-01-11 01:50:38,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018168505] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:38,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:38,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:38,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262546036] [2022-01-11 01:50:38,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:38,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:38,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:38,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:38,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:38,718 INFO L87 Difference]: Start difference. First operand 3764 states and 4991 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:39,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:39,047 INFO L93 Difference]: Finished difference Result 7481 states and 9920 transitions. [2022-01-11 01:50:39,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:39,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:39,053 INFO L225 Difference]: With dead ends: 7481 [2022-01-11 01:50:39,053 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:39,057 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:50:39,057 INFO L933 BasicCegarLoop]: 2633 mSDtfsCounter, 2478 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2478 SdHoareTripleChecker+Valid, 2759 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:39,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2478 Valid, 2759 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:39,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:39,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.3162370449109753) internal successors, (4953), 3763 states have internal predecessors, (4953), 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:50:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 4953 transitions. [2022-01-11 01:50:39,321 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 4953 transitions. Word has length 176 [2022-01-11 01:50:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:39,322 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 4953 transitions. [2022-01-11 01:50:39,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 4953 transitions. [2022-01-11 01:50:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:39,322 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:39,322 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:39,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-11 01:50:39,323 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:39,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:39,323 INFO L85 PathProgramCache]: Analyzing trace with hash -654323671, now seen corresponding path program 1 times [2022-01-11 01:50:39,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:39,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415954613] [2022-01-11 01:50:39,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:39,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:39,363 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:50:39,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:39,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415954613] [2022-01-11 01:50:39,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415954613] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:39,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:39,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:39,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665472168] [2022-01-11 01:50:39,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:39,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:39,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:39,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:39,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:39,365 INFO L87 Difference]: Start difference. First operand 3764 states and 4953 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:39,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:39,696 INFO L93 Difference]: Finished difference Result 7480 states and 9843 transitions. [2022-01-11 01:50:39,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:39,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:39,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:39,701 INFO L225 Difference]: With dead ends: 7480 [2022-01-11 01:50:39,701 INFO L226 Difference]: Without dead ends: 3764 [2022-01-11 01:50:39,703 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:50:39,704 INFO L933 BasicCegarLoop]: 2612 mSDtfsCounter, 2457 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2457 SdHoareTripleChecker+Valid, 2737 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:39,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2457 Valid, 2737 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:39,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2022-01-11 01:50:39,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3764. [2022-01-11 01:50:39,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3764 states, 3763 states have (on average 1.3061387191070954) internal successors, (4915), 3763 states have internal predecessors, (4915), 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:50:39,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3764 states to 3764 states and 4915 transitions. [2022-01-11 01:50:39,930 INFO L78 Accepts]: Start accepts. Automaton has 3764 states and 4915 transitions. Word has length 176 [2022-01-11 01:50:39,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:39,931 INFO L470 AbstractCegarLoop]: Abstraction has 3764 states and 4915 transitions. [2022-01-11 01:50:39,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:39,931 INFO L276 IsEmpty]: Start isEmpty. Operand 3764 states and 4915 transitions. [2022-01-11 01:50:39,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:39,931 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:39,931 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:39,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-11 01:50:39,932 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:39,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:39,932 INFO L85 PathProgramCache]: Analyzing trace with hash 292518856, now seen corresponding path program 1 times [2022-01-11 01:50:39,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:39,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091290917] [2022-01-11 01:50:39,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:39,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:39,998 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:50:39,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:39,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091290917] [2022-01-11 01:50:39,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091290917] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:39,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:39,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:50:39,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289126070] [2022-01-11 01:50:39,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:39,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:50:40,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:40,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:50:40,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:50:40,000 INFO L87 Difference]: Start difference. First operand 3764 states and 4915 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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:50:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:40,709 INFO L93 Difference]: Finished difference Result 8499 states and 11183 transitions. [2022-01-11 01:50:40,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:50:40,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:40,715 INFO L225 Difference]: With dead ends: 8499 [2022-01-11 01:50:40,715 INFO L226 Difference]: Without dead ends: 4790 [2022-01-11 01:50:40,719 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:50:40,719 INFO L933 BasicCegarLoop]: 2807 mSDtfsCounter, 7573 mSDsluCounter, 2081 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7573 SdHoareTripleChecker+Valid, 4888 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:40,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7573 Valid, 4888 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:50:40,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4790 states. [2022-01-11 01:50:41,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4790 to 3770. [2022-01-11 01:50:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3770 states, 3769 states have (on average 1.2976916954099231) internal successors, (4891), 3769 states have internal predecessors, (4891), 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:50:41,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 3770 states and 4891 transitions. [2022-01-11 01:50:41,030 INFO L78 Accepts]: Start accepts. Automaton has 3770 states and 4891 transitions. Word has length 176 [2022-01-11 01:50:41,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:41,030 INFO L470 AbstractCegarLoop]: Abstraction has 3770 states and 4891 transitions. [2022-01-11 01:50:41,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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:50:41,031 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 4891 transitions. [2022-01-11 01:50:41,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:41,032 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:41,032 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:41,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-11 01:50:41,032 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:41,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:41,032 INFO L85 PathProgramCache]: Analyzing trace with hash 723435657, now seen corresponding path program 1 times [2022-01-11 01:50:41,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:41,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251029340] [2022-01-11 01:50:41,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:41,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:41,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:41,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:41,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251029340] [2022-01-11 01:50:41,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251029340] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:41,094 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:41,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:50:41,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599948913] [2022-01-11 01:50:41,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:41,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:50:41,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:41,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:50:41,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:50:41,095 INFO L87 Difference]: Start difference. First operand 3770 states and 4891 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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:50:41,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:41,687 INFO L93 Difference]: Finished difference Result 8867 states and 11568 transitions. [2022-01-11 01:50:41,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:50:41,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:41,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:41,694 INFO L225 Difference]: With dead ends: 8867 [2022-01-11 01:50:41,694 INFO L226 Difference]: Without dead ends: 5166 [2022-01-11 01:50:41,697 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:50:41,698 INFO L933 BasicCegarLoop]: 2755 mSDtfsCounter, 7199 mSDsluCounter, 2863 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7199 SdHoareTripleChecker+Valid, 5618 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:41,698 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7199 Valid, 5618 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:50:41,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2022-01-11 01:50:42,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 3776. [2022-01-11 01:50:42,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3776 states, 3775 states have (on average 1.2892715231788079) internal successors, (4867), 3775 states have internal predecessors, (4867), 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:50:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 4867 transitions. [2022-01-11 01:50:42,018 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 4867 transitions. Word has length 176 [2022-01-11 01:50:42,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:42,019 INFO L470 AbstractCegarLoop]: Abstraction has 3776 states and 4867 transitions. [2022-01-11 01:50:42,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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:50:42,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 4867 transitions. [2022-01-11 01:50:42,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:42,020 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:42,020 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:42,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-11 01:50:42,020 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:42,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:42,021 INFO L85 PathProgramCache]: Analyzing trace with hash -100245814, now seen corresponding path program 1 times [2022-01-11 01:50:42,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:42,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224841496] [2022-01-11 01:50:42,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:42,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:42,077 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:50:42,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:42,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224841496] [2022-01-11 01:50:42,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224841496] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:42,078 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:42,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:50:42,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7881432] [2022-01-11 01:50:42,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:42,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:50:42,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:42,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:50:42,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:50:42,079 INFO L87 Difference]: Start difference. First operand 3776 states and 4867 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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:50:42,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:42,686 INFO L93 Difference]: Finished difference Result 9060 states and 11726 transitions. [2022-01-11 01:50:42,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:50:42,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:42,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:42,692 INFO L225 Difference]: With dead ends: 9060 [2022-01-11 01:50:42,692 INFO L226 Difference]: Without dead ends: 5360 [2022-01-11 01:50:42,695 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:50:42,696 INFO L933 BasicCegarLoop]: 2721 mSDtfsCounter, 6997 mSDsluCounter, 3216 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6997 SdHoareTripleChecker+Valid, 5937 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:42,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6997 Valid, 5937 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:50:42,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5360 states. [2022-01-11 01:50:43,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5360 to 3782. [2022-01-11 01:50:43,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3782 states, 3781 states have (on average 1.2808780745834436) internal successors, (4843), 3781 states have internal predecessors, (4843), 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:50:43,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 4843 transitions. [2022-01-11 01:50:43,068 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 4843 transitions. Word has length 176 [2022-01-11 01:50:43,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:43,068 INFO L470 AbstractCegarLoop]: Abstraction has 3782 states and 4843 transitions. [2022-01-11 01:50:43,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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:50:43,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 4843 transitions. [2022-01-11 01:50:43,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:43,069 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:43,069 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:43,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-11 01:50:43,069 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:43,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:43,070 INFO L85 PathProgramCache]: Analyzing trace with hash -41025077, now seen corresponding path program 1 times [2022-01-11 01:50:43,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:43,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875629400] [2022-01-11 01:50:43,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:43,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:43,125 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:50:43,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:43,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875629400] [2022-01-11 01:50:43,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875629400] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:43,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:43,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:50:43,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354306288] [2022-01-11 01:50:43,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:43,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:50:43,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:43,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:50:43,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:50:43,127 INFO L87 Difference]: Start difference. First operand 3782 states and 4843 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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:50:43,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:43,888 INFO L93 Difference]: Finished difference Result 10128 states and 13019 transitions. [2022-01-11 01:50:43,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:50:43,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:43,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:43,896 INFO L225 Difference]: With dead ends: 10128 [2022-01-11 01:50:43,896 INFO L226 Difference]: Without dead ends: 6464 [2022-01-11 01:50:43,900 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:50:43,900 INFO L933 BasicCegarLoop]: 2518 mSDtfsCounter, 5974 mSDsluCounter, 5563 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5974 SdHoareTripleChecker+Valid, 8081 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:43,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5974 Valid, 8081 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:50:43,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6464 states. [2022-01-11 01:50:44,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6464 to 3788. [2022-01-11 01:50:44,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3788 states, 3787 states have (on average 1.2725112226036441) internal successors, (4819), 3787 states have internal predecessors, (4819), 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:50:44,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3788 states to 3788 states and 4819 transitions. [2022-01-11 01:50:44,298 INFO L78 Accepts]: Start accepts. Automaton has 3788 states and 4819 transitions. Word has length 176 [2022-01-11 01:50:44,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:44,298 INFO L470 AbstractCegarLoop]: Abstraction has 3788 states and 4819 transitions. [2022-01-11 01:50:44,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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:50:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3788 states and 4819 transitions. [2022-01-11 01:50:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:44,299 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:44,299 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:44,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-11 01:50:44,299 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:44,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:44,299 INFO L85 PathProgramCache]: Analyzing trace with hash -287338164, now seen corresponding path program 1 times [2022-01-11 01:50:44,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:44,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344100722] [2022-01-11 01:50:44,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:44,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:44,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:44,369 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:50:44,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:44,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344100722] [2022-01-11 01:50:44,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344100722] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:44,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:44,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:50:44,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474499767] [2022-01-11 01:50:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:44,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:50:44,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:44,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:50:44,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:50:44,371 INFO L87 Difference]: Start difference. First operand 3788 states and 4819 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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:50:45,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:45,243 INFO L93 Difference]: Finished difference Result 10846 states and 13858 transitions. [2022-01-11 01:50:45,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:50:45,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:45,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:45,251 INFO L225 Difference]: With dead ends: 10846 [2022-01-11 01:50:45,251 INFO L226 Difference]: Without dead ends: 7204 [2022-01-11 01:50:45,254 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:50:45,254 INFO L933 BasicCegarLoop]: 2509 mSDtfsCounter, 5217 mSDsluCounter, 7114 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5217 SdHoareTripleChecker+Valid, 9623 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:45,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5217 Valid, 9623 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:50:45,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7204 states. [2022-01-11 01:50:45,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7204 to 3794. [2022-01-11 01:50:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3794 states, 3793 states have (on average 1.264170841022937) internal successors, (4795), 3793 states have internal predecessors, (4795), 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:50:45,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 4795 transitions. [2022-01-11 01:50:45,654 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 4795 transitions. Word has length 176 [2022-01-11 01:50:45,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:45,655 INFO L470 AbstractCegarLoop]: Abstraction has 3794 states and 4795 transitions. [2022-01-11 01:50:45,655 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 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:50:45,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 4795 transitions. [2022-01-11 01:50:45,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:45,655 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:45,656 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:45,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-11 01:50:45,656 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:45,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:45,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1988078643, now seen corresponding path program 1 times [2022-01-11 01:50:45,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:45,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826370430] [2022-01-11 01:50:45,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:45,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:45,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:45,712 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:50:45,713 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:45,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826370430] [2022-01-11 01:50:45,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826370430] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:45,713 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:45,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:45,713 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048540076] [2022-01-11 01:50:45,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:45,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:45,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:45,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:45,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:45,714 INFO L87 Difference]: Start difference. First operand 3794 states and 4795 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:46,198 INFO L93 Difference]: Finished difference Result 7562 states and 9550 transitions. [2022-01-11 01:50:46,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:46,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:46,203 INFO L225 Difference]: With dead ends: 7562 [2022-01-11 01:50:46,203 INFO L226 Difference]: Without dead ends: 3794 [2022-01-11 01:50:46,205 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:50:46,206 INFO L933 BasicCegarLoop]: 2543 mSDtfsCounter, 2410 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2410 SdHoareTripleChecker+Valid, 2543 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:50:46,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2410 Valid, 2543 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:46,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2022-01-11 01:50:46,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3794. [2022-01-11 01:50:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3794 states, 3793 states have (on average 1.2620616925916162) internal successors, (4787), 3793 states have internal predecessors, (4787), 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:50:46,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 4787 transitions. [2022-01-11 01:50:46,618 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 4787 transitions. Word has length 176 [2022-01-11 01:50:46,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:46,618 INFO L470 AbstractCegarLoop]: Abstraction has 3794 states and 4787 transitions. [2022-01-11 01:50:46,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:46,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 4787 transitions. [2022-01-11 01:50:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-01-11 01:50:46,619 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:46,619 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:46,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-11 01:50:46,619 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:46,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:46,619 INFO L85 PathProgramCache]: Analyzing trace with hash -355274644, now seen corresponding path program 1 times [2022-01-11 01:50:46,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:46,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101096095] [2022-01-11 01:50:46,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:46,620 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:46,676 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:50:46,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:46,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101096095] [2022-01-11 01:50:46,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101096095] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:46,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:46,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:46,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664969170] [2022-01-11 01:50:46,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:46,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:46,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:46,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:46,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:46,678 INFO L87 Difference]: Start difference. First operand 3794 states and 4787 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:47,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:47,682 INFO L93 Difference]: Finished difference Result 11110 states and 14032 transitions. [2022-01-11 01:50:47,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:47,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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 176 [2022-01-11 01:50:47,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:47,689 INFO L225 Difference]: With dead ends: 11110 [2022-01-11 01:50:47,689 INFO L226 Difference]: Without dead ends: 7366 [2022-01-11 01:50:47,690 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:50:47,691 INFO L933 BasicCegarLoop]: 2528 mSDtfsCounter, 2332 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2332 SdHoareTripleChecker+Valid, 4827 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:47,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2332 Valid, 4827 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:50:47,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7366 states. [2022-01-11 01:50:48,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7366 to 7172. [2022-01-11 01:50:48,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7172 states, 7171 states have (on average 1.2599358527402036) internal successors, (9035), 7171 states have internal predecessors, (9035), 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:50:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7172 states to 7172 states and 9035 transitions. [2022-01-11 01:50:48,447 INFO L78 Accepts]: Start accepts. Automaton has 7172 states and 9035 transitions. Word has length 176 [2022-01-11 01:50:48,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:48,447 INFO L470 AbstractCegarLoop]: Abstraction has 7172 states and 9035 transitions. [2022-01-11 01:50:48,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 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:50:48,447 INFO L276 IsEmpty]: Start isEmpty. Operand 7172 states and 9035 transitions. [2022-01-11 01:50:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-01-11 01:50:48,451 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:48,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:48,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-11 01:50:48,451 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:48,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:48,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1635858965, now seen corresponding path program 1 times [2022-01-11 01:50:48,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:48,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029168749] [2022-01-11 01:50:48,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:48,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:48,526 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:50:48,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:48,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029168749] [2022-01-11 01:50:48,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029168749] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:48,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:48,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:48,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227028675] [2022-01-11 01:50:48,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:48,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:48,527 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:48,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:48,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:48,527 INFO L87 Difference]: Start difference. First operand 7172 states and 9035 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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:50:50,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:50,185 INFO L93 Difference]: Finished difference Result 21186 states and 26718 transitions. [2022-01-11 01:50:50,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:50,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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 286 [2022-01-11 01:50:50,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:50,206 INFO L225 Difference]: With dead ends: 21186 [2022-01-11 01:50:50,206 INFO L226 Difference]: Without dead ends: 14070 [2022-01-11 01:50:50,211 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:50:50,212 INFO L933 BasicCegarLoop]: 2525 mSDtfsCounter, 2371 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2371 SdHoareTripleChecker+Valid, 4824 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:50,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2371 Valid, 4824 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:50:50,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14070 states. [2022-01-11 01:50:51,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14070 to 13688. [2022-01-11 01:50:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13688 states, 13687 states have (on average 1.258055088770366) internal successors, (17219), 13687 states have internal predecessors, (17219), 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:50:51,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13688 states to 13688 states and 17219 transitions. [2022-01-11 01:50:51,693 INFO L78 Accepts]: Start accepts. Automaton has 13688 states and 17219 transitions. Word has length 286 [2022-01-11 01:50:51,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:51,693 INFO L470 AbstractCegarLoop]: Abstraction has 13688 states and 17219 transitions. [2022-01-11 01:50:51,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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:50:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 13688 states and 17219 transitions. [2022-01-11 01:50:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-01-11 01:50:51,701 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:51,701 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:51,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-11 01:50:51,701 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:51,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:51,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1210593580, now seen corresponding path program 1 times [2022-01-11 01:50:51,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:51,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507990754] [2022-01-11 01:50:51,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:51,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:51,783 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:50:51,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:51,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507990754] [2022-01-11 01:50:51,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507990754] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:51,783 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:51,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:50:51,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109699106] [2022-01-11 01:50:51,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:51,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:50:51,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:51,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:50:51,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:50:51,785 INFO L87 Difference]: Start difference. First operand 13688 states and 17219 transitions. Second operand has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 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:50:54,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:54,894 INFO L93 Difference]: Finished difference Result 39315 states and 49732 transitions. [2022-01-11 01:50:54,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:50:54,895 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 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 286 [2022-01-11 01:50:54,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:54,929 INFO L225 Difference]: With dead ends: 39315 [2022-01-11 01:50:54,929 INFO L226 Difference]: Without dead ends: 25764 [2022-01-11 01:50:54,941 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 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:50:54,941 INFO L933 BasicCegarLoop]: 2500 mSDtfsCounter, 5328 mSDsluCounter, 6690 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5328 SdHoareTripleChecker+Valid, 9190 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:54,942 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5328 Valid, 9190 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:50:54,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25764 states. [2022-01-11 01:50:56,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25764 to 13712. [2022-01-11 01:50:56,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13712 states, 13711 states have (on average 1.249653562832762) internal successors, (17134), 13711 states have internal predecessors, (17134), 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:50:56,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13712 states to 13712 states and 17134 transitions. [2022-01-11 01:50:56,686 INFO L78 Accepts]: Start accepts. Automaton has 13712 states and 17134 transitions. Word has length 286 [2022-01-11 01:50:56,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:56,686 INFO L470 AbstractCegarLoop]: Abstraction has 13712 states and 17134 transitions. [2022-01-11 01:50:56,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.2) internal successors, (286), 5 states have internal predecessors, (286), 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:50:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 13712 states and 17134 transitions. [2022-01-11 01:50:56,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-01-11 01:50:56,691 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:56,692 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:56,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-11 01:50:56,692 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:56,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:56,692 INFO L85 PathProgramCache]: Analyzing trace with hash 514887317, now seen corresponding path program 1 times [2022-01-11 01:50:56,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:56,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954396880] [2022-01-11 01:50:56,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:56,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:56,762 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:50:56,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:56,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954396880] [2022-01-11 01:50:56,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954396880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:56,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:56,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:56,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263682929] [2022-01-11 01:50:56,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:56,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:56,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:56,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:56,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:56,764 INFO L87 Difference]: Start difference. First operand 13712 states and 17134 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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:50:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:59,977 INFO L93 Difference]: Finished difference Result 40585 states and 50498 transitions. [2022-01-11 01:50:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:59,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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 286 [2022-01-11 01:50:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:00,014 INFO L225 Difference]: With dead ends: 40585 [2022-01-11 01:51:00,014 INFO L226 Difference]: Without dead ends: 27047 [2022-01-11 01:51:00,026 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:00,027 INFO L933 BasicCegarLoop]: 2879 mSDtfsCounter, 2334 mSDsluCounter, 2491 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2334 SdHoareTripleChecker+Valid, 5370 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:00,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2334 Valid, 5370 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:00,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27047 states. [2022-01-11 01:51:03,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27047 to 26681. [2022-01-11 01:51:03,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26681 states, 26680 states have (on average 1.2402548725637181) internal successors, (33090), 26680 states have internal predecessors, (33090), 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:03,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26681 states to 26681 states and 33090 transitions. [2022-01-11 01:51:03,174 INFO L78 Accepts]: Start accepts. Automaton has 26681 states and 33090 transitions. Word has length 286 [2022-01-11 01:51:03,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:03,174 INFO L470 AbstractCegarLoop]: Abstraction has 26681 states and 33090 transitions. [2022-01-11 01:51:03,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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:03,174 INFO L276 IsEmpty]: Start isEmpty. Operand 26681 states and 33090 transitions. [2022-01-11 01:51:03,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-01-11 01:51:03,188 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:03,188 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-11 01:51:03,189 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:03,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:03,189 INFO L85 PathProgramCache]: Analyzing trace with hash -488591178, now seen corresponding path program 1 times [2022-01-11 01:51:03,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:03,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7700348] [2022-01-11 01:51:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:03,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:03,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:03,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:03,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7700348] [2022-01-11 01:51:03,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7700348] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:03,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:03,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:03,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085075391] [2022-01-11 01:51:03,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:03,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:03,238 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:03,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:03,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:03,239 INFO L87 Difference]: Start difference. First operand 26681 states and 33090 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 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)