/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_BITWISE.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 14:10:20,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 14:10:20,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 14:10:21,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 14:10:21,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 14:10:21,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 14:10:21,041 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 14:10:21,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 14:10:21,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 14:10:21,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 14:10:21,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 14:10:21,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 14:10:21,062 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 14:10:21,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 14:10:21,065 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 14:10:21,068 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 14:10:21,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 14:10:21,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 14:10:21,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 14:10:21,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 14:10:21,075 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 14:10:21,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 14:10:21,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 14:10:21,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 14:10:21,087 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 14:10:21,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 14:10:21,088 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 14:10:21,089 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 14:10:21,090 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 14:10:21,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 14:10:21,091 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 14:10:21,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 14:10:21,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 14:10:21,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 14:10:21,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 14:10:21,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 14:10:21,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 14:10:21,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 14:10:21,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 14:10:21,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 14:10:21,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 14:10:21,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_BITWISE.epf [2022-01-10 14:10:21,131 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 14:10:21,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 14:10:21,131 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 14:10:21,131 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 14:10:21,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 14:10:21,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 14:10:21,133 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 14:10:21,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 14:10:21,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 14:10:21,133 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 14:10:21,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 14:10:21,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 14:10:21,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 14:10:21,134 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 14:10:21,135 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 14:10:21,135 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 14:10:21,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 14:10:21,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 14:10:21,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 14:10:21,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 14:10:21,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 14:10:21,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:10:21,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 14:10:21,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 14:10:21,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 14:10:21,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 14:10:21,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 14:10:21,138 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 14:10:21,138 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 14:10:21,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 14:10:21,138 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 14:10:21,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 14:10:21,139 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 14:10:21,139 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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-10 14:10:21,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 14:10:21,423 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 14:10:21,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 14:10:21,426 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 14:10:21,427 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 14:10:21,428 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-1.c [2022-01-10 14:10:21,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd88d9ce/6bba14859d98416ea53dae0a2a874665/FLAGd705481b3 [2022-01-10 14:10:21,984 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 14:10:21,984 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-1.c [2022-01-10 14:10:22,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd88d9ce/6bba14859d98416ea53dae0a2a874665/FLAGd705481b3 [2022-01-10 14:10:22,494 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bd88d9ce/6bba14859d98416ea53dae0a2a874665 [2022-01-10 14:10:22,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 14:10:22,501 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 14:10:22,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 14:10:22,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 14:10:22,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 14:10:22,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:10:22" (1/1) ... [2022-01-10 14:10:22,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6324b35d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:22, skipping insertion in model container [2022-01-10 14:10:22,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:10:22" (1/1) ... [2022-01-10 14:10:22,543 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 14:10:22,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 14:10:22,861 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_1.cil-2+token_ring.08.cil-1.c[913,926] [2022-01-10 14:10:22,913 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_1.cil-2+token_ring.08.cil-1.c[5977,5990] [2022-01-10 14:10:23,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:10:23,041 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 14:10:23,053 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_1.cil-2+token_ring.08.cil-1.c[913,926] [2022-01-10 14:10:23,075 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_1.cil-2+token_ring.08.cil-1.c[5977,5990] [2022-01-10 14:10:23,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:10:23,156 INFO L208 MainTranslator]: Completed translation [2022-01-10 14:10:23,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:23 WrapperNode [2022-01-10 14:10:23,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 14:10:23,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 14:10:23,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 14:10:23,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 14:10:23,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:23" (1/1) ... [2022-01-10 14:10:23,192 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:23" (1/1) ... [2022-01-10 14:10:23,261 INFO L137 Inliner]: procedures = 65, calls = 72, calls flagged for inlining = 67, calls inlined = 176, statements flattened = 2611 [2022-01-10 14:10:23,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 14:10:23,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 14:10:23,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 14:10:23,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 14:10:23,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:23" (1/1) ... [2022-01-10 14:10:23,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:23" (1/1) ... [2022-01-10 14:10:23,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:23" (1/1) ... [2022-01-10 14:10:23,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:23" (1/1) ... [2022-01-10 14:10:23,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:23" (1/1) ... [2022-01-10 14:10:23,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:23" (1/1) ... [2022-01-10 14:10:23,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:23" (1/1) ... [2022-01-10 14:10:23,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 14:10:23,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 14:10:23,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 14:10:23,369 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 14:10:23,370 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:23" (1/1) ... [2022-01-10 14:10:23,376 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:10:23,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:10:23,397 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-10 14:10:23,417 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-10 14:10:23,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 14:10:23,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 14:10:23,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 14:10:23,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 14:10:23,665 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 14:10:23,666 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 14:10:25,322 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 14:10:25,338 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 14:10:25,338 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-01-10 14:10:25,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:10:25 BoogieIcfgContainer [2022-01-10 14:10:25,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 14:10:25,341 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 14:10:25,341 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 14:10:25,343 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 14:10:25,345 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:10:25" (1/1) ... [2022-01-10 14:10:25,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:10:25 BasicIcfg [2022-01-10 14:10:25,685 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 14:10:25,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 14:10:25,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 14:10:25,689 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 14:10:25,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:10:22" (1/4) ... [2022-01-10 14:10:25,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338d2dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:10:25, skipping insertion in model container [2022-01-10 14:10:25,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:23" (2/4) ... [2022-01-10 14:10:25,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338d2dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:10:25, skipping insertion in model container [2022-01-10 14:10:25,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:10:25" (3/4) ... [2022-01-10 14:10:25,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@338d2dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:10:25, skipping insertion in model container [2022-01-10 14:10:25,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:10:25" (4/4) ... [2022-01-10 14:10:25,692 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.08.cil-1.cTransformedIcfg [2022-01-10 14:10:25,699 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 14:10:25,700 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-10 14:10:25,752 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 14:10:25,757 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-10 14:10:25,757 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-10 14:10:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand has 1079 states, 1075 states have (on average 1.5190697674418605) internal successors, (1633), 1078 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:25,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 14:10:25,795 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:25,795 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:25,796 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:25,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:25,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1170301951, now seen corresponding path program 1 times [2022-01-10 14:10:25,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:25,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159020012] [2022-01-10 14:10:25,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:25,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:25,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:26,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-10 14:10:26,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:26,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159020012] [2022-01-10 14:10:26,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159020012] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:26,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:26,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:26,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253805654] [2022-01-10 14:10:26,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:26,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:26,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:26,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:26,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:26,158 INFO L87 Difference]: Start difference. First operand has 1079 states, 1075 states have (on average 1.5190697674418605) internal successors, (1633), 1078 states have internal predecessors, (1633), 0 states have call successors, (0), 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 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:26,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:26,320 INFO L93 Difference]: Finished difference Result 2039 states and 3071 transitions. [2022-01-10 14:10:26,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:26,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-01-10 14:10:26,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:26,342 INFO L225 Difference]: With dead ends: 2039 [2022-01-10 14:10:26,342 INFO L226 Difference]: Without dead ends: 1069 [2022-01-10 14:10:26,349 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-10 14:10:26,352 INFO L933 BasicCegarLoop]: 1595 mSDtfsCounter, 105 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 3084 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-10 14:10:26,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 3084 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:26,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2022-01-10 14:10:26,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1069. [2022-01-10 14:10:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 1066 states have (on average 1.4896810506566605) internal successors, (1588), 1068 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1588 transitions. [2022-01-10 14:10:26,461 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1588 transitions. Word has length 36 [2022-01-10 14:10:26,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:26,461 INFO L470 AbstractCegarLoop]: Abstraction has 1069 states and 1588 transitions. [2022-01-10 14:10:26,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:26,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1588 transitions. [2022-01-10 14:10:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 14:10:26,464 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:26,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:26,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 14:10:26,465 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:26,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:26,466 INFO L85 PathProgramCache]: Analyzing trace with hash 819502014, now seen corresponding path program 1 times [2022-01-10 14:10:26,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:26,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968179938] [2022-01-10 14:10:26,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:26,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:26,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-10 14:10:26,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:26,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968179938] [2022-01-10 14:10:26,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968179938] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:26,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:26,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:26,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442472365] [2022-01-10 14:10:26,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:26,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:26,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:26,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:26,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:26,624 INFO L87 Difference]: Start difference. First operand 1069 states and 1588 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:26,683 INFO L93 Difference]: Finished difference Result 1203 states and 1773 transitions. [2022-01-10 14:10:26,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:26,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2022-01-10 14:10:26,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:26,689 INFO L225 Difference]: With dead ends: 1203 [2022-01-10 14:10:26,690 INFO L226 Difference]: Without dead ends: 1134 [2022-01-10 14:10:26,691 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-10 14:10:26,692 INFO L933 BasicCegarLoop]: 1598 mSDtfsCounter, 1559 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:26,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1559 Valid, 1686 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:26,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2022-01-10 14:10:26,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1113. [2022-01-10 14:10:26,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1110 states have (on average 1.4837837837837837) internal successors, (1647), 1112 states have internal predecessors, (1647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1647 transitions. [2022-01-10 14:10:26,733 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1647 transitions. Word has length 36 [2022-01-10 14:10:26,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:26,734 INFO L470 AbstractCegarLoop]: Abstraction has 1113 states and 1647 transitions. [2022-01-10 14:10:26,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1647 transitions. [2022-01-10 14:10:26,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 14:10:26,736 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:26,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:26,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 14:10:26,736 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:26,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:26,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1393340914, now seen corresponding path program 1 times [2022-01-10 14:10:26,737 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:26,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405972084] [2022-01-10 14:10:26,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:26,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:26,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-10 14:10:26,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:26,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405972084] [2022-01-10 14:10:26,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405972084] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:26,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:26,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:26,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124136434] [2022-01-10 14:10:26,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:26,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:26,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:26,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:26,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:26,820 INFO L87 Difference]: Start difference. First operand 1113 states and 1647 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:26,869 INFO L93 Difference]: Finished difference Result 1282 states and 1882 transitions. [2022-01-10 14:10:26,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:26,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-01-10 14:10:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:26,874 INFO L225 Difference]: With dead ends: 1282 [2022-01-10 14:10:26,874 INFO L226 Difference]: Without dead ends: 1171 [2022-01-10 14:10:26,877 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-10 14:10:26,881 INFO L933 BasicCegarLoop]: 1586 mSDtfsCounter, 59 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:26,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 3134 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:26,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2022-01-10 14:10:26,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1166. [2022-01-10 14:10:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1163 states have (on average 1.4789337919174548) internal successors, (1720), 1165 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1720 transitions. [2022-01-10 14:10:26,916 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1720 transitions. Word has length 37 [2022-01-10 14:10:26,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:26,916 INFO L470 AbstractCegarLoop]: Abstraction has 1166 states and 1720 transitions. [2022-01-10 14:10:26,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:26,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1720 transitions. [2022-01-10 14:10:26,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 14:10:26,923 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:26,923 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:26,923 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 14:10:26,923 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:26,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:26,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1239044081, now seen corresponding path program 1 times [2022-01-10 14:10:26,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:26,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220425266] [2022-01-10 14:10:26,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:26,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:26,981 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-10 14:10:26,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:26,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220425266] [2022-01-10 14:10:26,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220425266] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:26,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:26,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:26,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411811900] [2022-01-10 14:10:26,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:26,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:26,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:26,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:26,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:26,984 INFO L87 Difference]: Start difference. First operand 1166 states and 1720 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:27,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:27,072 INFO L93 Difference]: Finished difference Result 1483 states and 2156 transitions. [2022-01-10 14:10:27,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:27,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-01-10 14:10:27,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:27,079 INFO L225 Difference]: With dead ends: 1483 [2022-01-10 14:10:27,079 INFO L226 Difference]: Without dead ends: 1319 [2022-01-10 14:10:27,079 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-10 14:10:27,084 INFO L933 BasicCegarLoop]: 1609 mSDtfsCounter, 1558 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1558 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:27,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1558 Valid, 1697 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:27,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-01-10 14:10:27,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1297. [2022-01-10 14:10:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 1294 states have (on average 1.465224111282844) internal successors, (1896), 1296 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:27,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1896 transitions. [2022-01-10 14:10:27,127 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1896 transitions. Word has length 37 [2022-01-10 14:10:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:27,128 INFO L470 AbstractCegarLoop]: Abstraction has 1297 states and 1896 transitions. [2022-01-10 14:10:27,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1896 transitions. [2022-01-10 14:10:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 14:10:27,129 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:27,129 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] [2022-01-10 14:10:27,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 14:10:27,130 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:27,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:27,131 INFO L85 PathProgramCache]: Analyzing trace with hash 955633049, now seen corresponding path program 1 times [2022-01-10 14:10:27,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:27,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208170699] [2022-01-10 14:10:27,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:27,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:27,196 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-10 14:10:27,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:27,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208170699] [2022-01-10 14:10:27,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208170699] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:27,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:27,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:27,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373179092] [2022-01-10 14:10:27,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:27,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:27,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:27,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:27,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:27,198 INFO L87 Difference]: Start difference. First operand 1297 states and 1896 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-10 14:10:27,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:27,274 INFO L93 Difference]: Finished difference Result 1536 states and 2221 transitions. [2022-01-10 14:10:27,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:27,275 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-10 14:10:27,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:27,280 INFO L225 Difference]: With dead ends: 1536 [2022-01-10 14:10:27,281 INFO L226 Difference]: Without dead ends: 1350 [2022-01-10 14:10:27,281 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-10 14:10:27,282 INFO L933 BasicCegarLoop]: 1638 mSDtfsCounter, 47 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:27,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 3213 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2022-01-10 14:10:27,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1350. [2022-01-10 14:10:27,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1347 states have (on average 1.4521158129175946) internal successors, (1956), 1349 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:27,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1956 transitions. [2022-01-10 14:10:27,330 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1956 transitions. Word has length 51 [2022-01-10 14:10:27,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:27,333 INFO L470 AbstractCegarLoop]: Abstraction has 1350 states and 1956 transitions. [2022-01-10 14:10:27,333 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-10 14:10:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1956 transitions. [2022-01-10 14:10:27,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 14:10:27,340 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:27,340 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:27,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 14:10:27,340 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:27,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:27,341 INFO L85 PathProgramCache]: Analyzing trace with hash 930765324, now seen corresponding path program 1 times [2022-01-10 14:10:27,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:27,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799747774] [2022-01-10 14:10:27,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:27,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:27,405 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-10 14:10:27,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:27,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799747774] [2022-01-10 14:10:27,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799747774] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:27,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:27,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:27,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255157927] [2022-01-10 14:10:27,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:27,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:27,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:27,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:27,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:27,407 INFO L87 Difference]: Start difference. First operand 1350 states and 1956 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:27,462 INFO L93 Difference]: Finished difference Result 1748 states and 2478 transitions. [2022-01-10 14:10:27,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:27,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-01-10 14:10:27,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:27,468 INFO L225 Difference]: With dead ends: 1748 [2022-01-10 14:10:27,468 INFO L226 Difference]: Without dead ends: 1444 [2022-01-10 14:10:27,469 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-10 14:10:27,471 INFO L933 BasicCegarLoop]: 1586 mSDtfsCounter, 1532 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 1674 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-10 14:10:27,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1532 Valid, 1674 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:27,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2022-01-10 14:10:27,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1444. [2022-01-10 14:10:27,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1441 states have (on average 1.4358084663428174) internal successors, (2069), 1443 states have internal predecessors, (2069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2069 transitions. [2022-01-10 14:10:27,541 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2069 transitions. Word has length 55 [2022-01-10 14:10:27,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:27,541 INFO L470 AbstractCegarLoop]: Abstraction has 1444 states and 2069 transitions. [2022-01-10 14:10:27,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2069 transitions. [2022-01-10 14:10:27,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 14:10:27,543 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:27,544 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, 1, 1, 1] [2022-01-10 14:10:27,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 14:10:27,544 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:27,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:27,544 INFO L85 PathProgramCache]: Analyzing trace with hash -978127424, now seen corresponding path program 1 times [2022-01-10 14:10:27,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:27,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767186654] [2022-01-10 14:10:27,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:27,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:27,647 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-10 14:10:27,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:27,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767186654] [2022-01-10 14:10:27,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767186654] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:27,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:27,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:10:27,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579890997] [2022-01-10 14:10:27,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:27,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:10:27,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:27,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:10:27,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:10:27,650 INFO L87 Difference]: Start difference. First operand 1444 states and 2069 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-10 14:10:27,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:27,779 INFO L93 Difference]: Finished difference Result 2341 states and 3242 transitions. [2022-01-10 14:10:27,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:10:27,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-10 14:10:27,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:27,787 INFO L225 Difference]: With dead ends: 2341 [2022-01-10 14:10:27,788 INFO L226 Difference]: Without dead ends: 1991 [2022-01-10 14:10:27,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-10 14:10:27,791 INFO L933 BasicCegarLoop]: 1659 mSDtfsCounter, 302 mSDsluCounter, 4895 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 6554 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:27,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 6554 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2022-01-10 14:10:27,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1465. [2022-01-10 14:10:27,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 1462 states have (on average 1.4274965800273598) internal successors, (2087), 1464 states have internal predecessors, (2087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 2087 transitions. [2022-01-10 14:10:27,856 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 2087 transitions. Word has length 56 [2022-01-10 14:10:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:27,857 INFO L470 AbstractCegarLoop]: Abstraction has 1465 states and 2087 transitions. [2022-01-10 14:10:27,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-10 14:10:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 2087 transitions. [2022-01-10 14:10:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 14:10:27,858 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:27,858 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, 1, 1, 1] [2022-01-10 14:10:27,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 14:10:27,858 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:27,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:27,859 INFO L85 PathProgramCache]: Analyzing trace with hash -627327487, now seen corresponding path program 1 times [2022-01-10 14:10:27,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:27,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853030041] [2022-01-10 14:10:27,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:27,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:27,949 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-10 14:10:27,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:27,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853030041] [2022-01-10 14:10:27,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853030041] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:27,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:27,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:10:27,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445854980] [2022-01-10 14:10:27,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:27,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:10:27,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:27,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:10:27,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:10:27,951 INFO L87 Difference]: Start difference. First operand 1465 states and 2087 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-10 14:10:28,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:28,113 INFO L93 Difference]: Finished difference Result 2247 states and 3090 transitions. [2022-01-10 14:10:28,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:10:28,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-10 14:10:28,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:28,122 INFO L225 Difference]: With dead ends: 2247 [2022-01-10 14:10:28,122 INFO L226 Difference]: Without dead ends: 1876 [2022-01-10 14:10:28,124 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-10 14:10:28,124 INFO L933 BasicCegarLoop]: 1636 mSDtfsCounter, 276 mSDsluCounter, 4864 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 6500 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:28,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 6500 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:28,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2022-01-10 14:10:28,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1483. [2022-01-10 14:10:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1480 states have (on average 1.420945945945946) internal successors, (2103), 1482 states have internal predecessors, (2103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:28,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 2103 transitions. [2022-01-10 14:10:28,218 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 2103 transitions. Word has length 56 [2022-01-10 14:10:28,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:28,218 INFO L470 AbstractCegarLoop]: Abstraction has 1483 states and 2103 transitions. [2022-01-10 14:10:28,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 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-10 14:10:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 2103 transitions. [2022-01-10 14:10:28,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 14:10:28,219 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:28,219 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, 1, 1, 1] [2022-01-10 14:10:28,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 14:10:28,220 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:28,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:28,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1590460257, now seen corresponding path program 1 times [2022-01-10 14:10:28,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:28,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671618179] [2022-01-10 14:10:28,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:28,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:28,294 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-10 14:10:28,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:28,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671618179] [2022-01-10 14:10:28,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671618179] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:28,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:28,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 14:10:28,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539352482] [2022-01-10 14:10:28,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:28,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 14:10:28,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:28,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 14:10:28,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 14:10:28,296 INFO L87 Difference]: Start difference. First operand 1483 states and 2103 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 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-10 14:10:28,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:28,417 INFO L93 Difference]: Finished difference Result 1533 states and 2163 transitions. [2022-01-10 14:10:28,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 14:10:28,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 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-10 14:10:28,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:28,423 INFO L225 Difference]: With dead ends: 1533 [2022-01-10 14:10:28,423 INFO L226 Difference]: Without dead ends: 1531 [2022-01-10 14:10:28,424 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-10 14:10:28,424 INFO L933 BasicCegarLoop]: 1587 mSDtfsCounter, 3142 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3142 SdHoareTripleChecker+Valid, 1656 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:28,425 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3142 Valid, 1656 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1531 states. [2022-01-10 14:10:28,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1531 to 1481. [2022-01-10 14:10:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1479 states have (on average 1.4198782961460445) internal successors, (2100), 1480 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:28,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2100 transitions. [2022-01-10 14:10:28,539 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2100 transitions. Word has length 56 [2022-01-10 14:10:28,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:28,539 INFO L470 AbstractCegarLoop]: Abstraction has 1481 states and 2100 transitions. [2022-01-10 14:10:28,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 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-10 14:10:28,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2100 transitions. [2022-01-10 14:10:28,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 14:10:28,540 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:28,540 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, 1, 1, 1, 1] [2022-01-10 14:10:28,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 14:10:28,541 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:28,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:28,541 INFO L85 PathProgramCache]: Analyzing trace with hash 2059630924, now seen corresponding path program 1 times [2022-01-10 14:10:28,541 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:28,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333142287] [2022-01-10 14:10:28,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:28,542 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:28,741 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-10 14:10:28,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:28,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333142287] [2022-01-10 14:10:28,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333142287] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 14:10:28,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466935264] [2022-01-10 14:10:28,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:28,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:10:28,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:10:28,747 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-10 14:10:28,769 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-10 14:10:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:28,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 14:10:28,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 14:10:29,211 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-10 14:10:29,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 14:10:29,546 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-10 14:10:29,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466935264] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 14:10:29,546 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 14:10:29,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-10 14:10:29,547 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367999648] [2022-01-10 14:10:29,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 14:10:29,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 14:10:29,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:29,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 14:10:29,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:10:29,548 INFO L87 Difference]: Start difference. First operand 1481 states and 2100 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-10 14:10:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:29,866 INFO L93 Difference]: Finished difference Result 2367 states and 3228 transitions. [2022-01-10 14:10:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 14:10:29,866 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 57 [2022-01-10 14:10:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:29,875 INFO L225 Difference]: With dead ends: 2367 [2022-01-10 14:10:29,875 INFO L226 Difference]: Without dead ends: 2365 [2022-01-10 14:10:29,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 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-10 14:10:29,876 INFO L933 BasicCegarLoop]: 1662 mSDtfsCounter, 3467 mSDsluCounter, 3515 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3467 SdHoareTripleChecker+Valid, 5177 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:29,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3467 Valid, 5177 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:29,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2022-01-10 14:10:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 1753. [2022-01-10 14:10:30,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1753 states, 1751 states have (on average 1.400913763563678) internal successors, (2453), 1752 states have internal predecessors, (2453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:30,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2453 transitions. [2022-01-10 14:10:30,031 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2453 transitions. Word has length 57 [2022-01-10 14:10:30,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:30,032 INFO L470 AbstractCegarLoop]: Abstraction has 1753 states and 2453 transitions. [2022-01-10 14:10:30,032 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-10 14:10:30,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2453 transitions. [2022-01-10 14:10:30,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 14:10:30,034 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:30,034 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:30,066 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-10 14:10:30,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-10 14:10:30,248 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:30,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:30,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1496737525, now seen corresponding path program 2 times [2022-01-10 14:10:30,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:30,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434663758] [2022-01-10 14:10:30,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:30,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:30,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:30,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434663758] [2022-01-10 14:10:30,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434663758] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:30,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:30,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:30,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581201902] [2022-01-10 14:10:30,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:30,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:30,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:30,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:30,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:30,327 INFO L87 Difference]: Start difference. First operand 1753 states and 2453 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:30,453 INFO L93 Difference]: Finished difference Result 2260 states and 3113 transitions. [2022-01-10 14:10:30,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:30,454 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2022-01-10 14:10:30,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:30,460 INFO L225 Difference]: With dead ends: 2260 [2022-01-10 14:10:30,460 INFO L226 Difference]: Without dead ends: 1664 [2022-01-10 14:10:30,461 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-10 14:10:30,462 INFO L933 BasicCegarLoop]: 1621 mSDtfsCounter, 1537 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:30,462 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1537 Valid, 1690 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:30,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2022-01-10 14:10:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1638. [2022-01-10 14:10:30,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1636 states have (on average 1.406479217603912) internal successors, (2301), 1637 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2301 transitions. [2022-01-10 14:10:30,575 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2301 transitions. Word has length 72 [2022-01-10 14:10:30,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:30,576 INFO L470 AbstractCegarLoop]: Abstraction has 1638 states and 2301 transitions. [2022-01-10 14:10:30,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2301 transitions. [2022-01-10 14:10:30,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 14:10:30,581 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:30,582 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:30,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 14:10:30,582 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:30,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:30,583 INFO L85 PathProgramCache]: Analyzing trace with hash -98455604, now seen corresponding path program 1 times [2022-01-10 14:10:30,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:30,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845072631] [2022-01-10 14:10:30,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:30,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:10:30,635 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:30,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845072631] [2022-01-10 14:10:30,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845072631] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:30,635 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:30,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:30,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397350470] [2022-01-10 14:10:30,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:30,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:30,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:30,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:30,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:30,637 INFO L87 Difference]: Start difference. First operand 1638 states and 2301 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-10 14:10:30,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:30,781 INFO L93 Difference]: Finished difference Result 2292 states and 3128 transitions. [2022-01-10 14:10:30,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:30,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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 84 [2022-01-10 14:10:30,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:30,788 INFO L225 Difference]: With dead ends: 2292 [2022-01-10 14:10:30,788 INFO L226 Difference]: Without dead ends: 1656 [2022-01-10 14:10:30,789 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-10 14:10:30,790 INFO L933 BasicCegarLoop]: 1594 mSDtfsCounter, 1522 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 1678 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-10 14:10:30,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1522 Valid, 1678 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:30,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2022-01-10 14:10:30,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1638. [2022-01-10 14:10:30,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1636 states have (on average 1.3942542787286063) internal successors, (2281), 1637 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2281 transitions. [2022-01-10 14:10:30,911 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2281 transitions. Word has length 84 [2022-01-10 14:10:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:30,911 INFO L470 AbstractCegarLoop]: Abstraction has 1638 states and 2281 transitions. [2022-01-10 14:10:30,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 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-10 14:10:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2281 transitions. [2022-01-10 14:10:30,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-10 14:10:30,913 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:30,914 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:30,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 14:10:30,914 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:30,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:30,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2080712526, now seen corresponding path program 1 times [2022-01-10 14:10:30,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:30,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045094830] [2022-01-10 14:10:30,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:30,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:10:30,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:30,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045094830] [2022-01-10 14:10:30,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045094830] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:30,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:30,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:30,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350372281] [2022-01-10 14:10:30,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:30,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:30,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:30,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:30,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:30,966 INFO L87 Difference]: Start difference. First operand 1638 states and 2281 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:31,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:31,074 INFO L93 Difference]: Finished difference Result 1902 states and 2599 transitions. [2022-01-10 14:10:31,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:31,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 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 85 [2022-01-10 14:10:31,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:31,079 INFO L225 Difference]: With dead ends: 1902 [2022-01-10 14:10:31,080 INFO L226 Difference]: Without dead ends: 996 [2022-01-10 14:10:31,081 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-10 14:10:31,082 INFO L933 BasicCegarLoop]: 1620 mSDtfsCounter, 56 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3172 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:31,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 3172 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:31,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2022-01-10 14:10:31,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 996. [2022-01-10 14:10:31,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 995 states have (on average 1.4924623115577889) internal successors, (1485), 995 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:31,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1485 transitions. [2022-01-10 14:10:31,134 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1485 transitions. Word has length 85 [2022-01-10 14:10:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:31,135 INFO L470 AbstractCegarLoop]: Abstraction has 996 states and 1485 transitions. [2022-01-10 14:10:31,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:31,135 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1485 transitions. [2022-01-10 14:10:31,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:31,136 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:31,136 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] [2022-01-10 14:10:31,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 14:10:31,137 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:31,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2098800577, now seen corresponding path program 1 times [2022-01-10 14:10:31,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:31,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333301664] [2022-01-10 14:10:31,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:31,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:31,188 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-10 14:10:31,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:31,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333301664] [2022-01-10 14:10:31,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333301664] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:31,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:31,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:31,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999210508] [2022-01-10 14:10:31,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:31,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:31,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:31,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:31,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:31,191 INFO L87 Difference]: Start difference. First operand 996 states and 1485 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:31,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:31,248 INFO L93 Difference]: Finished difference Result 1980 states and 2951 transitions. [2022-01-10 14:10:31,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:31,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:31,253 INFO L225 Difference]: With dead ends: 1980 [2022-01-10 14:10:31,253 INFO L226 Difference]: Without dead ends: 996 [2022-01-10 14:10:31,255 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-10 14:10:31,256 INFO L933 BasicCegarLoop]: 1483 mSDtfsCounter, 1473 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1484 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-10 14:10:31,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1473 Valid, 1484 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:31,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2022-01-10 14:10:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 996. [2022-01-10 14:10:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 995 states have (on average 1.491457286432161) internal successors, (1484), 995 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1484 transitions. [2022-01-10 14:10:31,299 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1484 transitions. Word has length 121 [2022-01-10 14:10:31,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:31,299 INFO L470 AbstractCegarLoop]: Abstraction has 996 states and 1484 transitions. [2022-01-10 14:10:31,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:31,299 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1484 transitions. [2022-01-10 14:10:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:31,300 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:31,300 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] [2022-01-10 14:10:31,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 14:10:31,302 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:31,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:31,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1016992290, now seen corresponding path program 1 times [2022-01-10 14:10:31,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:31,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510763459] [2022-01-10 14:10:31,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:31,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:31,345 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-10 14:10:31,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:31,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510763459] [2022-01-10 14:10:31,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510763459] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:31,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:31,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:31,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961640045] [2022-01-10 14:10:31,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:31,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:31,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:31,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:31,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:31,349 INFO L87 Difference]: Start difference. First operand 996 states and 1484 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:31,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:31,442 INFO L93 Difference]: Finished difference Result 2791 states and 4147 transitions. [2022-01-10 14:10:31,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:31,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:31,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:31,450 INFO L225 Difference]: With dead ends: 2791 [2022-01-10 14:10:31,451 INFO L226 Difference]: Without dead ends: 1811 [2022-01-10 14:10:31,454 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-10 14:10:31,455 INFO L933 BasicCegarLoop]: 1478 mSDtfsCounter, 1371 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 2768 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-10 14:10:31,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1371 Valid, 2768 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:31,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2022-01-10 14:10:31,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1809. [2022-01-10 14:10:31,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4839601769911503) internal successors, (2683), 1808 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2683 transitions. [2022-01-10 14:10:31,565 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2683 transitions. Word has length 121 [2022-01-10 14:10:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:31,565 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2683 transitions. [2022-01-10 14:10:31,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2683 transitions. [2022-01-10 14:10:31,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:31,567 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:31,567 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] [2022-01-10 14:10:31,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 14:10:31,567 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:31,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash 669158210, now seen corresponding path program 1 times [2022-01-10 14:10:31,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:31,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831428841] [2022-01-10 14:10:31,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:31,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:31,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-10 14:10:31,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:31,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831428841] [2022-01-10 14:10:31,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831428841] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:31,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:31,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:31,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051211158] [2022-01-10 14:10:31,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:31,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:31,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:31,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:31,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:31,614 INFO L87 Difference]: Start difference. First operand 1809 states and 2683 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:31,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:31,701 INFO L93 Difference]: Finished difference Result 3601 states and 5340 transitions. [2022-01-10 14:10:31,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:31,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:31,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:31,708 INFO L225 Difference]: With dead ends: 3601 [2022-01-10 14:10:31,708 INFO L226 Difference]: Without dead ends: 1809 [2022-01-10 14:10:31,710 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-10 14:10:31,711 INFO L933 BasicCegarLoop]: 1472 mSDtfsCounter, 1461 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 1472 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-10 14:10:31,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1461 Valid, 1472 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-10 14:10:31,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-10 14:10:31,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4795353982300885) internal successors, (2675), 1808 states have internal predecessors, (2675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:31,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2675 transitions. [2022-01-10 14:10:31,808 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2675 transitions. Word has length 121 [2022-01-10 14:10:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:31,808 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2675 transitions. [2022-01-10 14:10:31,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:31,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2675 transitions. [2022-01-10 14:10:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:31,809 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:31,810 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] [2022-01-10 14:10:31,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 14:10:31,810 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:31,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:31,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1281724894, now seen corresponding path program 1 times [2022-01-10 14:10:31,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:31,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229296971] [2022-01-10 14:10:31,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:31,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:31,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:31,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229296971] [2022-01-10 14:10:31,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229296971] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:31,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:31,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:31,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052845850] [2022-01-10 14:10:31,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:31,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:31,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:31,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:31,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:31,851 INFO L87 Difference]: Start difference. First operand 1809 states and 2675 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:31,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:31,950 INFO L93 Difference]: Finished difference Result 3600 states and 5323 transitions. [2022-01-10 14:10:31,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:31,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:31,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:31,963 INFO L225 Difference]: With dead ends: 3600 [2022-01-10 14:10:31,964 INFO L226 Difference]: Without dead ends: 1809 [2022-01-10 14:10:31,967 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-10 14:10:31,984 INFO L933 BasicCegarLoop]: 1467 mSDtfsCounter, 1455 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 1467 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-10 14:10:31,984 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1455 Valid, 1467 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-10 14:10:32,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-10 14:10:32,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4751106194690264) internal successors, (2667), 1808 states have internal predecessors, (2667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2667 transitions. [2022-01-10 14:10:32,078 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2667 transitions. Word has length 121 [2022-01-10 14:10:32,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:32,078 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2667 transitions. [2022-01-10 14:10:32,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:32,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2667 transitions. [2022-01-10 14:10:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:32,080 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:32,080 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:10:32,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 14:10:32,081 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:32,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:32,081 INFO L85 PathProgramCache]: Analyzing trace with hash -236277950, now seen corresponding path program 1 times [2022-01-10 14:10:32,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:32,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131962207] [2022-01-10 14:10:32,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:32,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:32,126 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-10 14:10:32,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:32,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131962207] [2022-01-10 14:10:32,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131962207] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:32,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:32,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:32,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411441997] [2022-01-10 14:10:32,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:32,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:32,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:32,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:32,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:32,129 INFO L87 Difference]: Start difference. First operand 1809 states and 2667 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:32,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:32,223 INFO L93 Difference]: Finished difference Result 3599 states and 5306 transitions. [2022-01-10 14:10:32,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:32,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:32,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:32,233 INFO L225 Difference]: With dead ends: 3599 [2022-01-10 14:10:32,233 INFO L226 Difference]: Without dead ends: 1809 [2022-01-10 14:10:32,235 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-10 14:10:32,236 INFO L933 BasicCegarLoop]: 1462 mSDtfsCounter, 1449 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1449 SdHoareTripleChecker+Valid, 1462 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-10 14:10:32,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1449 Valid, 1462 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:32,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-10 14:10:32,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-10 14:10:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4706858407079646) internal successors, (2659), 1808 states have internal predecessors, (2659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2659 transitions. [2022-01-10 14:10:32,332 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2659 transitions. Word has length 121 [2022-01-10 14:10:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:32,332 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2659 transitions. [2022-01-10 14:10:32,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2659 transitions. [2022-01-10 14:10:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:32,334 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:32,334 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] [2022-01-10 14:10:32,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 14:10:32,334 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:32,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:32,335 INFO L85 PathProgramCache]: Analyzing trace with hash 905824802, now seen corresponding path program 1 times [2022-01-10 14:10:32,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:32,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079198941] [2022-01-10 14:10:32,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:32,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:32,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:32,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079198941] [2022-01-10 14:10:32,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079198941] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:32,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:32,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:32,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752194793] [2022-01-10 14:10:32,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:32,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:32,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:32,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:32,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:32,405 INFO L87 Difference]: Start difference. First operand 1809 states and 2659 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:32,505 INFO L93 Difference]: Finished difference Result 3598 states and 5289 transitions. [2022-01-10 14:10:32,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:32,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:32,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:32,509 INFO L225 Difference]: With dead ends: 3598 [2022-01-10 14:10:32,510 INFO L226 Difference]: Without dead ends: 1809 [2022-01-10 14:10:32,512 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-10 14:10:32,513 INFO L933 BasicCegarLoop]: 1457 mSDtfsCounter, 1443 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1443 SdHoareTripleChecker+Valid, 1457 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-10 14:10:32,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1443 Valid, 1457 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-10 14:10:32,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-10 14:10:32,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4662610619469028) internal successors, (2651), 1808 states have internal predecessors, (2651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:32,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2651 transitions. [2022-01-10 14:10:32,603 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2651 transitions. Word has length 121 [2022-01-10 14:10:32,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:32,603 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2651 transitions. [2022-01-10 14:10:32,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:32,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2651 transitions. [2022-01-10 14:10:32,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:32,604 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:32,604 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] [2022-01-10 14:10:32,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 14:10:32,605 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:32,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:32,605 INFO L85 PathProgramCache]: Analyzing trace with hash 665572162, now seen corresponding path program 1 times [2022-01-10 14:10:32,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:32,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488850210] [2022-01-10 14:10:32,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:32,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:32,645 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-10 14:10:32,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:32,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488850210] [2022-01-10 14:10:32,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488850210] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:32,646 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:32,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:32,646 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681731014] [2022-01-10 14:10:32,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:32,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:32,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:32,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:32,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:32,647 INFO L87 Difference]: Start difference. First operand 1809 states and 2651 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:32,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:32,759 INFO L93 Difference]: Finished difference Result 3597 states and 5272 transitions. [2022-01-10 14:10:32,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:32,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:32,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:32,763 INFO L225 Difference]: With dead ends: 3597 [2022-01-10 14:10:32,763 INFO L226 Difference]: Without dead ends: 1809 [2022-01-10 14:10:32,765 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-10 14:10:32,766 INFO L933 BasicCegarLoop]: 1452 mSDtfsCounter, 1437 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 1452 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-10 14:10:32,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1437 Valid, 1452 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:32,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-10 14:10:32,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-10 14:10:32,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4618362831858407) internal successors, (2643), 1808 states have internal predecessors, (2643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2643 transitions. [2022-01-10 14:10:32,874 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2643 transitions. Word has length 121 [2022-01-10 14:10:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:32,874 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2643 transitions. [2022-01-10 14:10:32,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:32,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2643 transitions. [2022-01-10 14:10:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:32,875 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:32,875 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] [2022-01-10 14:10:32,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 14:10:32,875 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:32,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:32,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1904748066, now seen corresponding path program 1 times [2022-01-10 14:10:32,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:32,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641968137] [2022-01-10 14:10:32,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:32,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:32,919 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-10 14:10:32,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:32,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641968137] [2022-01-10 14:10:32,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641968137] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:32,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:32,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:32,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298478319] [2022-01-10 14:10:32,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:32,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:32,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:32,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:32,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:32,922 INFO L87 Difference]: Start difference. First operand 1809 states and 2643 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:33,022 INFO L93 Difference]: Finished difference Result 3596 states and 5255 transitions. [2022-01-10 14:10:33,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:33,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:33,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:33,027 INFO L225 Difference]: With dead ends: 3596 [2022-01-10 14:10:33,027 INFO L226 Difference]: Without dead ends: 1809 [2022-01-10 14:10:33,030 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-10 14:10:33,030 INFO L933 BasicCegarLoop]: 1447 mSDtfsCounter, 1431 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 1447 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-10 14:10:33,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1431 Valid, 1447 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-10 14:10:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-10 14:10:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4574115044247788) internal successors, (2635), 1808 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2635 transitions. [2022-01-10 14:10:33,131 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2635 transitions. Word has length 121 [2022-01-10 14:10:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:33,131 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2635 transitions. [2022-01-10 14:10:33,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2635 transitions. [2022-01-10 14:10:33,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:33,132 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:33,132 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] [2022-01-10 14:10:33,132 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 14:10:33,133 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:33,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:33,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1667626818, now seen corresponding path program 1 times [2022-01-10 14:10:33,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:33,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295223546] [2022-01-10 14:10:33,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:33,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:33,189 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-10 14:10:33,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:33,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295223546] [2022-01-10 14:10:33,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295223546] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:33,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:33,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:33,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178539299] [2022-01-10 14:10:33,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:33,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:33,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:33,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:33,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:33,192 INFO L87 Difference]: Start difference. First operand 1809 states and 2635 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:33,297 INFO L93 Difference]: Finished difference Result 3595 states and 5238 transitions. [2022-01-10 14:10:33,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:33,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:33,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:33,301 INFO L225 Difference]: With dead ends: 3595 [2022-01-10 14:10:33,301 INFO L226 Difference]: Without dead ends: 1809 [2022-01-10 14:10:33,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-10 14:10:33,306 INFO L933 BasicCegarLoop]: 1442 mSDtfsCounter, 1425 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1425 SdHoareTripleChecker+Valid, 1442 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-10 14:10:33,306 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1425 Valid, 1442 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:33,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-10 14:10:33,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-10 14:10:33,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4529867256637168) internal successors, (2627), 1808 states have internal predecessors, (2627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:33,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2627 transitions. [2022-01-10 14:10:33,425 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2627 transitions. Word has length 121 [2022-01-10 14:10:33,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:33,425 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2627 transitions. [2022-01-10 14:10:33,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:33,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2627 transitions. [2022-01-10 14:10:33,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:33,426 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:33,426 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] [2022-01-10 14:10:33,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 14:10:33,426 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:33,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:33,427 INFO L85 PathProgramCache]: Analyzing trace with hash -2080800222, now seen corresponding path program 1 times [2022-01-10 14:10:33,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:33,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377848914] [2022-01-10 14:10:33,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:33,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:33,479 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-10 14:10:33,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:33,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377848914] [2022-01-10 14:10:33,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377848914] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:33,479 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:33,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:33,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063588532] [2022-01-10 14:10:33,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:33,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:33,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:33,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:33,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:33,482 INFO L87 Difference]: Start difference. First operand 1809 states and 2627 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:33,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:33,615 INFO L93 Difference]: Finished difference Result 3594 states and 5221 transitions. [2022-01-10 14:10:33,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:33,615 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:33,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:33,618 INFO L225 Difference]: With dead ends: 3594 [2022-01-10 14:10:33,618 INFO L226 Difference]: Without dead ends: 1809 [2022-01-10 14:10:33,621 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-10 14:10:33,621 INFO L933 BasicCegarLoop]: 1437 mSDtfsCounter, 1419 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1419 SdHoareTripleChecker+Valid, 1437 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-10 14:10:33,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1419 Valid, 1437 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:33,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-10 14:10:33,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-10 14:10:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.448561946902655) internal successors, (2619), 1808 states have internal predecessors, (2619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2619 transitions. [2022-01-10 14:10:33,730 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2619 transitions. Word has length 121 [2022-01-10 14:10:33,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:33,730 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2619 transitions. [2022-01-10 14:10:33,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:33,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2619 transitions. [2022-01-10 14:10:33,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:33,731 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:33,731 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] [2022-01-10 14:10:33,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 14:10:33,732 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:33,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:33,732 INFO L85 PathProgramCache]: Analyzing trace with hash -816243902, now seen corresponding path program 1 times [2022-01-10 14:10:33,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:33,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478022887] [2022-01-10 14:10:33,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:33,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:33,766 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-10 14:10:33,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:33,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478022887] [2022-01-10 14:10:33,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478022887] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:33,767 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:33,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:33,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701305694] [2022-01-10 14:10:33,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:33,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:33,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:33,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:33,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:33,768 INFO L87 Difference]: Start difference. First operand 1809 states and 2619 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:33,902 INFO L93 Difference]: Finished difference Result 3593 states and 5204 transitions. [2022-01-10 14:10:33,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:33,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:33,907 INFO L225 Difference]: With dead ends: 3593 [2022-01-10 14:10:33,907 INFO L226 Difference]: Without dead ends: 1809 [2022-01-10 14:10:33,910 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-10 14:10:33,911 INFO L933 BasicCegarLoop]: 1410 mSDtfsCounter, 1310 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:33,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1310 Valid, 1498 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-10 14:10:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-10 14:10:34,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4330752212389382) internal successors, (2591), 1808 states have internal predecessors, (2591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:34,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2591 transitions. [2022-01-10 14:10:34,052 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2591 transitions. Word has length 121 [2022-01-10 14:10:34,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:34,053 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2591 transitions. [2022-01-10 14:10:34,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2591 transitions. [2022-01-10 14:10:34,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:34,057 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:34,057 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] [2022-01-10 14:10:34,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 14:10:34,057 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:34,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:34,058 INFO L85 PathProgramCache]: Analyzing trace with hash -186944351, now seen corresponding path program 1 times [2022-01-10 14:10:34,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:34,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528946221] [2022-01-10 14:10:34,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:34,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:34,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:34,100 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-10 14:10:34,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:34,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528946221] [2022-01-10 14:10:34,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528946221] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:34,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:34,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:34,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186421678] [2022-01-10 14:10:34,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:34,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:34,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:34,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:34,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:34,102 INFO L87 Difference]: Start difference. First operand 1809 states and 2591 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:34,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:34,252 INFO L93 Difference]: Finished difference Result 3592 states and 5147 transitions. [2022-01-10 14:10:34,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:34,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:34,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:34,256 INFO L225 Difference]: With dead ends: 3592 [2022-01-10 14:10:34,256 INFO L226 Difference]: Without dead ends: 1809 [2022-01-10 14:10:34,258 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-10 14:10:34,259 INFO L933 BasicCegarLoop]: 1394 mSDtfsCounter, 1294 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:34,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1294 Valid, 1481 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:34,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-10 14:10:34,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-10 14:10:34,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4175884955752212) internal successors, (2563), 1808 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:34,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2563 transitions. [2022-01-10 14:10:34,370 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2563 transitions. Word has length 121 [2022-01-10 14:10:34,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:34,370 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2563 transitions. [2022-01-10 14:10:34,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:34,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2563 transitions. [2022-01-10 14:10:34,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:34,371 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:34,372 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] [2022-01-10 14:10:34,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 14:10:34,372 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:34,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:34,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1141966976, now seen corresponding path program 1 times [2022-01-10 14:10:34,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:34,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10001449] [2022-01-10 14:10:34,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:34,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:34,408 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-10 14:10:34,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:34,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10001449] [2022-01-10 14:10:34,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10001449] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:34,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:34,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:34,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542515075] [2022-01-10 14:10:34,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:34,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:34,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:34,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:34,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:34,411 INFO L87 Difference]: Start difference. First operand 1809 states and 2563 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:34,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:34,590 INFO L93 Difference]: Finished difference Result 3591 states and 5090 transitions. [2022-01-10 14:10:34,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:34,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:34,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:34,594 INFO L225 Difference]: With dead ends: 3591 [2022-01-10 14:10:34,594 INFO L226 Difference]: Without dead ends: 1809 [2022-01-10 14:10:34,597 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-10 14:10:34,597 INFO L933 BasicCegarLoop]: 1378 mSDtfsCounter, 1278 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:34,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1278 Valid, 1464 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-10 14:10:34,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-10 14:10:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.4021017699115044) internal successors, (2535), 1808 states have internal predecessors, (2535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:34,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2535 transitions. [2022-01-10 14:10:34,742 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2535 transitions. Word has length 121 [2022-01-10 14:10:34,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:34,743 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2535 transitions. [2022-01-10 14:10:34,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:34,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2535 transitions. [2022-01-10 14:10:34,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:34,744 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:34,744 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] [2022-01-10 14:10:34,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 14:10:34,744 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:34,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:34,745 INFO L85 PathProgramCache]: Analyzing trace with hash -750055585, now seen corresponding path program 1 times [2022-01-10 14:10:34,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:34,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120030934] [2022-01-10 14:10:34,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:34,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:34,789 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-10 14:10:34,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:34,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120030934] [2022-01-10 14:10:34,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120030934] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:34,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:34,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:34,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013605411] [2022-01-10 14:10:34,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:34,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:34,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:34,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:34,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:34,791 INFO L87 Difference]: Start difference. First operand 1809 states and 2535 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:34,936 INFO L93 Difference]: Finished difference Result 3590 states and 5033 transitions. [2022-01-10 14:10:34,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:34,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:34,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:34,940 INFO L225 Difference]: With dead ends: 3590 [2022-01-10 14:10:34,940 INFO L226 Difference]: Without dead ends: 1809 [2022-01-10 14:10:34,943 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-10 14:10:34,943 INFO L933 BasicCegarLoop]: 1362 mSDtfsCounter, 1262 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:34,943 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1262 Valid, 1447 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:34,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-10 14:10:35,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-10 14:10:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.3866150442477876) internal successors, (2507), 1808 states have internal predecessors, (2507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:35,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2507 transitions. [2022-01-10 14:10:35,069 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2507 transitions. Word has length 121 [2022-01-10 14:10:35,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:35,069 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2507 transitions. [2022-01-10 14:10:35,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:35,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2507 transitions. [2022-01-10 14:10:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:35,070 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:35,070 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:10:35,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 14:10:35,071 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:35,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:35,071 INFO L85 PathProgramCache]: Analyzing trace with hash -640565058, now seen corresponding path program 1 times [2022-01-10 14:10:35,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:35,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632525175] [2022-01-10 14:10:35,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:35,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:35,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-10 14:10:35,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:35,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632525175] [2022-01-10 14:10:35,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632525175] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:35,109 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:35,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:35,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960939986] [2022-01-10 14:10:35,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:35,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:35,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:35,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:35,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:35,110 INFO L87 Difference]: Start difference. First operand 1809 states and 2507 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:35,259 INFO L93 Difference]: Finished difference Result 3589 states and 4976 transitions. [2022-01-10 14:10:35,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:35,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:35,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:35,263 INFO L225 Difference]: With dead ends: 3589 [2022-01-10 14:10:35,263 INFO L226 Difference]: Without dead ends: 1809 [2022-01-10 14:10:35,267 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-10 14:10:35,267 INFO L933 BasicCegarLoop]: 1346 mSDtfsCounter, 1246 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:35,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1246 Valid, 1430 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:35,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-10 14:10:35,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-10 14:10:35,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.3711283185840708) internal successors, (2479), 1808 states have internal predecessors, (2479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2479 transitions. [2022-01-10 14:10:35,375 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2479 transitions. Word has length 121 [2022-01-10 14:10:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:35,375 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2479 transitions. [2022-01-10 14:10:35,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2479 transitions. [2022-01-10 14:10:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:35,376 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:35,376 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] [2022-01-10 14:10:35,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 14:10:35,377 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:35,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:35,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1020569827, now seen corresponding path program 1 times [2022-01-10 14:10:35,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:35,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84049474] [2022-01-10 14:10:35,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:35,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:35,414 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-10 14:10:35,414 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:35,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84049474] [2022-01-10 14:10:35,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84049474] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:35,415 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:35,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:35,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639400628] [2022-01-10 14:10:35,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:35,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:35,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:35,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:35,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:35,416 INFO L87 Difference]: Start difference. First operand 1809 states and 2479 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:35,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:35,589 INFO L93 Difference]: Finished difference Result 3588 states and 4919 transitions. [2022-01-10 14:10:35,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:35,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:35,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:35,592 INFO L225 Difference]: With dead ends: 3588 [2022-01-10 14:10:35,593 INFO L226 Difference]: Without dead ends: 1809 [2022-01-10 14:10:35,595 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-10 14:10:35,596 INFO L933 BasicCegarLoop]: 1330 mSDtfsCounter, 1230 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:35,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1230 Valid, 1413 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:35,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-10 14:10:35,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-10 14:10:35,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.355641592920354) internal successors, (2451), 1808 states have internal predecessors, (2451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:35,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2451 transitions. [2022-01-10 14:10:35,714 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2451 transitions. Word has length 121 [2022-01-10 14:10:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:35,714 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2451 transitions. [2022-01-10 14:10:35,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2451 transitions. [2022-01-10 14:10:35,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:35,715 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:35,715 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] [2022-01-10 14:10:35,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 14:10:35,715 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:35,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:35,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1208158468, now seen corresponding path program 1 times [2022-01-10 14:10:35,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:35,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208553332] [2022-01-10 14:10:35,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:35,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:35,750 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-10 14:10:35,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:35,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208553332] [2022-01-10 14:10:35,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208553332] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:35,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:35,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:35,751 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938247039] [2022-01-10 14:10:35,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:35,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:35,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:35,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:35,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:35,752 INFO L87 Difference]: Start difference. First operand 1809 states and 2451 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:35,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:35,907 INFO L93 Difference]: Finished difference Result 3587 states and 4862 transitions. [2022-01-10 14:10:35,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:35,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:35,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:35,911 INFO L225 Difference]: With dead ends: 3587 [2022-01-10 14:10:35,911 INFO L226 Difference]: Without dead ends: 1809 [2022-01-10 14:10:35,914 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-10 14:10:35,914 INFO L933 BasicCegarLoop]: 1314 mSDtfsCounter, 1214 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:35,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1214 Valid, 1396 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:35,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-10 14:10:36,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-10 14:10:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.3401548672566372) internal successors, (2423), 1808 states have internal predecessors, (2423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2423 transitions. [2022-01-10 14:10:36,025 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2423 transitions. Word has length 121 [2022-01-10 14:10:36,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:36,025 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2423 transitions. [2022-01-10 14:10:36,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2423 transitions. [2022-01-10 14:10:36,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:36,026 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:36,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] [2022-01-10 14:10:36,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 14:10:36,026 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:36,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:36,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1771555803, now seen corresponding path program 1 times [2022-01-10 14:10:36,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:36,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83219826] [2022-01-10 14:10:36,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:36,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:36,076 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-10 14:10:36,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:36,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83219826] [2022-01-10 14:10:36,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83219826] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:36,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:36,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:36,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873338984] [2022-01-10 14:10:36,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:36,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:36,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:36,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:36,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:36,078 INFO L87 Difference]: Start difference. First operand 1809 states and 2423 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:36,230 INFO L93 Difference]: Finished difference Result 3586 states and 4805 transitions. [2022-01-10 14:10:36,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:36,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:36,234 INFO L225 Difference]: With dead ends: 3586 [2022-01-10 14:10:36,234 INFO L226 Difference]: Without dead ends: 1809 [2022-01-10 14:10:36,236 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-10 14:10:36,237 INFO L933 BasicCegarLoop]: 1298 mSDtfsCounter, 1198 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:36,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1198 Valid, 1379 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:36,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-10 14:10:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-10 14:10:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.3246681415929205) internal successors, (2395), 1808 states have internal predecessors, (2395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2395 transitions. [2022-01-10 14:10:36,337 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2395 transitions. Word has length 121 [2022-01-10 14:10:36,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:36,338 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2395 transitions. [2022-01-10 14:10:36,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2395 transitions. [2022-01-10 14:10:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:36,338 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:36,339 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] [2022-01-10 14:10:36,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-10 14:10:36,339 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:36,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:36,339 INFO L85 PathProgramCache]: Analyzing trace with hash 313268794, now seen corresponding path program 1 times [2022-01-10 14:10:36,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:36,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956772680] [2022-01-10 14:10:36,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:36,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:36,374 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-10 14:10:36,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:36,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956772680] [2022-01-10 14:10:36,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956772680] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:36,374 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:36,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:36,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40349403] [2022-01-10 14:10:36,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:36,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:36,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:36,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:36,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:36,376 INFO L87 Difference]: Start difference. First operand 1809 states and 2395 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:36,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:36,549 INFO L93 Difference]: Finished difference Result 3585 states and 4748 transitions. [2022-01-10 14:10:36,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:36,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:36,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:36,552 INFO L225 Difference]: With dead ends: 3585 [2022-01-10 14:10:36,552 INFO L226 Difference]: Without dead ends: 1809 [2022-01-10 14:10:36,555 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-10 14:10:36,556 INFO L933 BasicCegarLoop]: 1282 mSDtfsCounter, 1182 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:36,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1182 Valid, 1362 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2022-01-10 14:10:36,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2022-01-10 14:10:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1808 states have (on average 1.3091814159292035) internal successors, (2367), 1808 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2367 transitions. [2022-01-10 14:10:36,730 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2367 transitions. Word has length 121 [2022-01-10 14:10:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:36,730 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2367 transitions. [2022-01-10 14:10:36,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2367 transitions. [2022-01-10 14:10:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:36,731 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:36,731 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] [2022-01-10 14:10:36,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-10 14:10:36,731 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:36,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:36,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1760292249, now seen corresponding path program 1 times [2022-01-10 14:10:36,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:36,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750455486] [2022-01-10 14:10:36,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:36,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:36,802 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-10 14:10:36,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:36,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750455486] [2022-01-10 14:10:36,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750455486] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:36,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:36,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:10:36,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242664537] [2022-01-10 14:10:36,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:36,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:10:36,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:36,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:10:36,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:10:36,804 INFO L87 Difference]: Start difference. First operand 1809 states and 2367 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:37,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:37,131 INFO L93 Difference]: Finished difference Result 4244 states and 5604 transitions. [2022-01-10 14:10:37,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:10:37,131 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:37,136 INFO L225 Difference]: With dead ends: 4244 [2022-01-10 14:10:37,136 INFO L226 Difference]: Without dead ends: 2475 [2022-01-10 14:10:37,139 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-10 14:10:37,139 INFO L933 BasicCegarLoop]: 1402 mSDtfsCounter, 3660 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3660 SdHoareTripleChecker+Valid, 2760 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:37,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3660 Valid, 2760 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:10:37,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2022-01-10 14:10:37,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 1815. [2022-01-10 14:10:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1814 states have (on average 1.297133406835722) internal successors, (2353), 1814 states have internal predecessors, (2353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2353 transitions. [2022-01-10 14:10:37,304 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2353 transitions. Word has length 121 [2022-01-10 14:10:37,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:37,304 INFO L470 AbstractCegarLoop]: Abstraction has 1815 states and 2353 transitions. [2022-01-10 14:10:37,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:37,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2353 transitions. [2022-01-10 14:10:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:37,308 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:37,308 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] [2022-01-10 14:10:37,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 14:10:37,309 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:37,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:37,309 INFO L85 PathProgramCache]: Analyzing trace with hash 275236698, now seen corresponding path program 1 times [2022-01-10 14:10:37,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:37,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782447627] [2022-01-10 14:10:37,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:37,310 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:37,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:37,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:37,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782447627] [2022-01-10 14:10:37,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782447627] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:37,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:37,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:10:37,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105066097] [2022-01-10 14:10:37,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:37,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:10:37,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:37,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:10:37,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:10:37,368 INFO L87 Difference]: Start difference. First operand 1815 states and 2353 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:37,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:37,709 INFO L93 Difference]: Finished difference Result 4472 states and 5839 transitions. [2022-01-10 14:10:37,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:10:37,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:37,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:37,715 INFO L225 Difference]: With dead ends: 4472 [2022-01-10 14:10:37,715 INFO L226 Difference]: Without dead ends: 2711 [2022-01-10 14:10:37,717 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-10 14:10:37,718 INFO L933 BasicCegarLoop]: 1355 mSDtfsCounter, 3386 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3386 SdHoareTripleChecker+Valid, 3230 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:37,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3386 Valid, 3230 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:10:37,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2711 states. [2022-01-10 14:10:37,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2711 to 1821. [2022-01-10 14:10:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1820 states have (on average 1.2851648351648353) internal successors, (2339), 1820 states have internal predecessors, (2339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2339 transitions. [2022-01-10 14:10:37,891 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2339 transitions. Word has length 121 [2022-01-10 14:10:37,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:37,892 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2339 transitions. [2022-01-10 14:10:37,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2339 transitions. [2022-01-10 14:10:37,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:37,892 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:37,892 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] [2022-01-10 14:10:37,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 14:10:37,893 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:37,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:37,893 INFO L85 PathProgramCache]: Analyzing trace with hash -208438629, now seen corresponding path program 1 times [2022-01-10 14:10:37,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:37,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111715092] [2022-01-10 14:10:37,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:37,894 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:37,946 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-10 14:10:37,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:37,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111715092] [2022-01-10 14:10:37,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111715092] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:37,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:37,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:10:37,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546197798] [2022-01-10 14:10:37,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:37,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:10:37,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:37,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:10:37,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:10:37,947 INFO L87 Difference]: Start difference. First operand 1821 states and 2339 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:38,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:38,334 INFO L93 Difference]: Finished difference Result 4595 states and 5937 transitions. [2022-01-10 14:10:38,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:10:38,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:38,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:38,339 INFO L225 Difference]: With dead ends: 4595 [2022-01-10 14:10:38,339 INFO L226 Difference]: Without dead ends: 2835 [2022-01-10 14:10:38,341 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-10 14:10:38,342 INFO L933 BasicCegarLoop]: 1229 mSDtfsCounter, 3287 mSDsluCounter, 2107 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3287 SdHoareTripleChecker+Valid, 3336 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:38,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3287 Valid, 3336 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:10:38,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2022-01-10 14:10:38,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 1827. [2022-01-10 14:10:38,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1826 states have (on average 1.2732749178532312) internal successors, (2325), 1826 states have internal predecessors, (2325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2325 transitions. [2022-01-10 14:10:38,527 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2325 transitions. Word has length 121 [2022-01-10 14:10:38,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:38,528 INFO L470 AbstractCegarLoop]: Abstraction has 1827 states and 2325 transitions. [2022-01-10 14:10:38,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:38,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2325 transitions. [2022-01-10 14:10:38,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 14:10:38,528 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:38,528 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] [2022-01-10 14:10:38,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-10 14:10:38,529 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:38,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:38,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1095955100, now seen corresponding path program 1 times [2022-01-10 14:10:38,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:38,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402535928] [2022-01-10 14:10:38,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:38,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:38,574 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-10 14:10:38,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:38,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402535928] [2022-01-10 14:10:38,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402535928] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:38,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:38,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:38,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146037383] [2022-01-10 14:10:38,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:38,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:38,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:38,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:38,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:38,576 INFO L87 Difference]: Start difference. First operand 1827 states and 2325 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:38,955 INFO L93 Difference]: Finished difference Result 5294 states and 6749 transitions. [2022-01-10 14:10:38,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:38,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 14:10:38,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:38,961 INFO L225 Difference]: With dead ends: 5294 [2022-01-10 14:10:38,961 INFO L226 Difference]: Without dead ends: 3502 [2022-01-10 14:10:38,964 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-10 14:10:38,964 INFO L933 BasicCegarLoop]: 1250 mSDtfsCounter, 1114 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 2349 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:38,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1114 Valid, 2349 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:38,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2022-01-10 14:10:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 3378. [2022-01-10 14:10:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3378 states, 3377 states have (on average 1.270358306188925) internal successors, (4290), 3377 states have internal predecessors, (4290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 3378 states and 4290 transitions. [2022-01-10 14:10:39,304 INFO L78 Accepts]: Start accepts. Automaton has 3378 states and 4290 transitions. Word has length 121 [2022-01-10 14:10:39,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:39,304 INFO L470 AbstractCegarLoop]: Abstraction has 3378 states and 4290 transitions. [2022-01-10 14:10:39,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:39,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3378 states and 4290 transitions. [2022-01-10 14:10:39,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-10 14:10:39,307 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:39,307 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] [2022-01-10 14:10:39,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-10 14:10:39,307 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:39,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:39,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1968335744, now seen corresponding path program 1 times [2022-01-10 14:10:39,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:39,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380296229] [2022-01-10 14:10:39,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:39,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:39,363 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-10 14:10:39,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:39,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380296229] [2022-01-10 14:10:39,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380296229] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:39,363 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:39,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:39,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970021826] [2022-01-10 14:10:39,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:39,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:39,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:39,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:39,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:39,366 INFO L87 Difference]: Start difference. First operand 3378 states and 4290 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:40,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:40,057 INFO L93 Difference]: Finished difference Result 9899 states and 12596 transitions. [2022-01-10 14:10:40,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:40,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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 196 [2022-01-10 14:10:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:40,074 INFO L225 Difference]: With dead ends: 9899 [2022-01-10 14:10:40,074 INFO L226 Difference]: Without dead ends: 6562 [2022-01-10 14:10:40,083 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-10 14:10:40,084 INFO L933 BasicCegarLoop]: 1247 mSDtfsCounter, 1138 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:40,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1138 Valid, 2346 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:40,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6562 states. [2022-01-10 14:10:40,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6562 to 6320. [2022-01-10 14:10:40,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6320 states, 6319 states have (on average 1.2682386453552776) internal successors, (8014), 6319 states have internal predecessors, (8014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:40,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6320 states to 6320 states and 8014 transitions. [2022-01-10 14:10:40,655 INFO L78 Accepts]: Start accepts. Automaton has 6320 states and 8014 transitions. Word has length 196 [2022-01-10 14:10:40,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:40,656 INFO L470 AbstractCegarLoop]: Abstraction has 6320 states and 8014 transitions. [2022-01-10 14:10:40,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:40,656 INFO L276 IsEmpty]: Start isEmpty. Operand 6320 states and 8014 transitions. [2022-01-10 14:10:40,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-10 14:10:40,659 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:40,659 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] [2022-01-10 14:10:40,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-10 14:10:40,659 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:40,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:40,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1865028831, now seen corresponding path program 1 times [2022-01-10 14:10:40,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:40,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597733002] [2022-01-10 14:10:40,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:40,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:40,738 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-10 14:10:40,738 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:40,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597733002] [2022-01-10 14:10:40,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597733002] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:40,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:40,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:40,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946681417] [2022-01-10 14:10:40,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:40,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:40,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:40,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:40,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:40,741 INFO L87 Difference]: Start difference. First operand 6320 states and 8014 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:41,785 INFO L93 Difference]: Finished difference Result 18589 states and 23450 transitions. [2022-01-10 14:10:41,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:41,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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 196 [2022-01-10 14:10:41,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:41,800 INFO L225 Difference]: With dead ends: 18589 [2022-01-10 14:10:41,801 INFO L226 Difference]: Without dead ends: 12383 [2022-01-10 14:10:41,811 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-10 14:10:41,811 INFO L933 BasicCegarLoop]: 1472 mSDtfsCounter, 1132 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 2701 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:41,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1132 Valid, 2701 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:41,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12383 states. [2022-01-10 14:10:42,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12383 to 12157. [2022-01-10 14:10:42,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12157 states, 12156 states have (on average 1.255182625863771) internal successors, (15258), 12156 states have internal predecessors, (15258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12157 states to 12157 states and 15258 transitions. [2022-01-10 14:10:42,867 INFO L78 Accepts]: Start accepts. Automaton has 12157 states and 15258 transitions. Word has length 196 [2022-01-10 14:10:42,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:42,867 INFO L470 AbstractCegarLoop]: Abstraction has 12157 states and 15258 transitions. [2022-01-10 14:10:42,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 12157 states and 15258 transitions. [2022-01-10 14:10:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-10 14:10:42,875 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:42,875 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] [2022-01-10 14:10:42,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-10 14:10:42,875 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:42,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:42,876 INFO L85 PathProgramCache]: Analyzing trace with hash 627020222, now seen corresponding path program 1 times [2022-01-10 14:10:42,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:42,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700505062] [2022-01-10 14:10:42,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:42,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:42,909 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-10 14:10:42,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:42,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700505062] [2022-01-10 14:10:42,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700505062] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:42,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:42,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:42,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363287520] [2022-01-10 14:10:42,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:42,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:42,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:42,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:42,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:42,911 INFO L87 Difference]: Start difference. First operand 12157 states and 15258 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:43,828 INFO L93 Difference]: Finished difference Result 24162 states and 30336 transitions. [2022-01-10 14:10:43,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:43,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 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 196 [2022-01-10 14:10:43,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:43,843 INFO L225 Difference]: With dead ends: 24162 [2022-01-10 14:10:43,843 INFO L226 Difference]: Without dead ends: 12050 [2022-01-10 14:10:43,854 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-10 14:10:43,855 INFO L933 BasicCegarLoop]: 1259 mSDtfsCounter, 1254 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 1260 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-10 14:10:43,855 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1254 Valid, 1260 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:43,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12050 states. [2022-01-10 14:10:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12050 to 12050. [2022-01-10 14:10:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12050 states, 12049 states have (on average 1.2557888621462363) internal successors, (15131), 12049 states have internal predecessors, (15131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:45,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12050 states to 12050 states and 15131 transitions. [2022-01-10 14:10:45,023 INFO L78 Accepts]: Start accepts. Automaton has 12050 states and 15131 transitions. Word has length 196 [2022-01-10 14:10:45,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:45,023 INFO L470 AbstractCegarLoop]: Abstraction has 12050 states and 15131 transitions. [2022-01-10 14:10:45,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:45,023 INFO L276 IsEmpty]: Start isEmpty. Operand 12050 states and 15131 transitions. [2022-01-10 14:10:45,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-01-10 14:10:45,030 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:45,031 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] [2022-01-10 14:10:45,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-10 14:10:45,031 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:45,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:45,031 INFO L85 PathProgramCache]: Analyzing trace with hash 521257662, now seen corresponding path program 1 times [2022-01-10 14:10:45,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:45,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712360129] [2022-01-10 14:10:45,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:45,032 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:45,096 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-10 14:10:45,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:45,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712360129] [2022-01-10 14:10:45,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712360129] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:45,097 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:45,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:45,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209203004] [2022-01-10 14:10:45,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:45,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:45,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:45,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:45,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:45,098 INFO L87 Difference]: Start difference. First operand 12050 states and 15131 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:47,193 INFO L93 Difference]: Finished difference Result 34716 states and 43489 transitions. [2022-01-10 14:10:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:47,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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 197 [2022-01-10 14:10:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:47,216 INFO L225 Difference]: With dead ends: 34716 [2022-01-10 14:10:47,216 INFO L226 Difference]: Without dead ends: 22780 [2022-01-10 14:10:47,227 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-10 14:10:47,228 INFO L933 BasicCegarLoop]: 1863 mSDtfsCounter, 953 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 3101 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:47,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [953 Valid, 3101 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22780 states. [2022-01-10 14:10:48,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22780 to 22778. [2022-01-10 14:10:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22778 states, 22777 states have (on average 1.249110945251789) internal successors, (28451), 22777 states have internal predecessors, (28451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22778 states to 22778 states and 28451 transitions. [2022-01-10 14:10:49,025 INFO L78 Accepts]: Start accepts. Automaton has 22778 states and 28451 transitions. Word has length 197 [2022-01-10 14:10:49,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:49,025 INFO L470 AbstractCegarLoop]: Abstraction has 22778 states and 28451 transitions. [2022-01-10 14:10:49,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 22778 states and 28451 transitions. [2022-01-10 14:10:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-01-10 14:10:49,037 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:49,037 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] [2022-01-10 14:10:49,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-10 14:10:49,037 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:49,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:49,038 INFO L85 PathProgramCache]: Analyzing trace with hash 284639837, now seen corresponding path program 1 times [2022-01-10 14:10:49,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:49,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014853378] [2022-01-10 14:10:49,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:49,038 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:49,076 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-10 14:10:49,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:49,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014853378] [2022-01-10 14:10:49,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014853378] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:49,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:49,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:49,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999414131] [2022-01-10 14:10:49,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:49,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:49,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:49,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:49,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:49,078 INFO L87 Difference]: Start difference. First operand 22778 states and 28451 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:51,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:51,093 INFO L93 Difference]: Finished difference Result 45336 states and 56644 transitions. [2022-01-10 14:10:51,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:51,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 197 [2022-01-10 14:10:51,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:51,128 INFO L225 Difference]: With dead ends: 45336 [2022-01-10 14:10:51,128 INFO L226 Difference]: Without dead ends: 22672 [2022-01-10 14:10:51,148 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-10 14:10:51,149 INFO L933 BasicCegarLoop]: 1258 mSDtfsCounter, 1252 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 1259 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-10 14:10:51,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1252 Valid, 1259 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:51,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22672 states. [2022-01-10 14:10:52,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22672 to 22672. [2022-01-10 14:10:53,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22672 states, 22671 states have (on average 1.2494376075162101) internal successors, (28326), 22671 states have internal predecessors, (28326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22672 states to 22672 states and 28326 transitions. [2022-01-10 14:10:53,034 INFO L78 Accepts]: Start accepts. Automaton has 22672 states and 28326 transitions. Word has length 197 [2022-01-10 14:10:53,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:53,035 INFO L470 AbstractCegarLoop]: Abstraction has 22672 states and 28326 transitions. [2022-01-10 14:10:53,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 22672 states and 28326 transitions. [2022-01-10 14:10:53,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-01-10 14:10:53,042 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:53,042 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] [2022-01-10 14:10:53,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-10 14:10:53,042 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:10:53,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:53,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1103978130, now seen corresponding path program 1 times [2022-01-10 14:10:53,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:53,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392888700] [2022-01-10 14:10:53,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:53,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:53,102 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-10 14:10:53,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:53,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392888700] [2022-01-10 14:10:53,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392888700] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:53,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:53,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:53,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831382301] [2022-01-10 14:10:53,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:53,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:53,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:53,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:53,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:53,104 INFO L87 Difference]: Start difference. First operand 22672 states and 28326 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:56,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:56,532 INFO L93 Difference]: Finished difference Result 65533 states and 81778 transitions. [2022-01-10 14:10:56,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:56,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 198 [2022-01-10 14:10:56,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:56,609 INFO L225 Difference]: With dead ends: 65533 [2022-01-10 14:10:56,609 INFO L226 Difference]: Without dead ends: 42975 [2022-01-10 14:10:56,666 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-10 14:10:56,667 INFO L933 BasicCegarLoop]: 1832 mSDtfsCounter, 958 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 3068 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:56,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [958 Valid, 3068 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:56,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42975 states. [2022-01-10 14:11:00,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42975 to 42973. [2022-01-10 14:11:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42973 states, 42972 states have (on average 1.2456483291445593) internal successors, (53528), 42972 states have internal predecessors, (53528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42973 states to 42973 states and 53528 transitions. [2022-01-10 14:11:00,571 INFO L78 Accepts]: Start accepts. Automaton has 42973 states and 53528 transitions. Word has length 198 [2022-01-10 14:11:00,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:00,571 INFO L470 AbstractCegarLoop]: Abstraction has 42973 states and 53528 transitions. [2022-01-10 14:11:00,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:00,572 INFO L276 IsEmpty]: Start isEmpty. Operand 42973 states and 53528 transitions. [2022-01-10 14:11:00,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-01-10 14:11:00,585 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:00,585 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] [2022-01-10 14:11:00,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-10 14:11:00,585 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:00,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:00,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1340595955, now seen corresponding path program 1 times [2022-01-10 14:11:00,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:00,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938480313] [2022-01-10 14:11:00,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:00,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:00,621 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-10 14:11:00,621 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:00,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938480313] [2022-01-10 14:11:00,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938480313] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:00,622 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:00,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:00,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862248834] [2022-01-10 14:11:00,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:00,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:00,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:00,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:00,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:00,623 INFO L87 Difference]: Start difference. First operand 42973 states and 53528 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:04,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:04,789 INFO L93 Difference]: Finished difference Result 85727 states and 106801 transitions. [2022-01-10 14:11:04,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:04,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 198 [2022-01-10 14:11:04,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:04,867 INFO L225 Difference]: With dead ends: 85727 [2022-01-10 14:11:04,867 INFO L226 Difference]: Without dead ends: 42868 [2022-01-10 14:11:04,905 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-10 14:11:04,906 INFO L933 BasicCegarLoop]: 1257 mSDtfsCounter, 1250 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 1258 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-10 14:11:04,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1250 Valid, 1258 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:04,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42868 states. [2022-01-10 14:11:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42868 to 42868. [2022-01-10 14:11:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42868 states, 42867 states have (on average 1.2458301257377469) internal successors, (53405), 42867 states have internal predecessors, (53405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42868 states to 42868 states and 53405 transitions. [2022-01-10 14:11:08,948 INFO L78 Accepts]: Start accepts. Automaton has 42868 states and 53405 transitions. Word has length 198 [2022-01-10 14:11:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:08,948 INFO L470 AbstractCegarLoop]: Abstraction has 42868 states and 53405 transitions. [2022-01-10 14:11:08,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 42868 states and 53405 transitions. [2022-01-10 14:11:08,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-01-10 14:11:08,962 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:08,962 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] [2022-01-10 14:11:08,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-10 14:11:08,963 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 14:11:08,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:08,964 INFO L85 PathProgramCache]: Analyzing trace with hash -970337043, now seen corresponding path program 1 times [2022-01-10 14:11:08,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:08,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047403279] [2022-01-10 14:11:08,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:08,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:09,068 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-10 14:11:09,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:09,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047403279] [2022-01-10 14:11:09,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047403279] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:09,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:09,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:09,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156867060] [2022-01-10 14:11:09,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:09,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:09,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:09,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:09,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:09,071 INFO L87 Difference]: Start difference. First operand 42868 states and 53405 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:17,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:17,507 INFO L93 Difference]: Finished difference Result 125952 states and 156871 transitions. [2022-01-10 14:11:17,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:17,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2022-01-10 14:11:17,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:17,645 INFO L225 Difference]: With dead ends: 125952 [2022-01-10 14:11:17,645 INFO L226 Difference]: Without dead ends: 83198 [2022-01-10 14:11:17,685 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-10 14:11:17,686 INFO L933 BasicCegarLoop]: 1578 mSDtfsCounter, 1133 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:17,686 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1133 Valid, 2801 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:11:17,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83198 states.