/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 01:47:06,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 01:47:06,055 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 01:47:06,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 01:47:06,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 01:47:06,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 01:47:06,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 01:47:06,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 01:47:06,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 01:47:06,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 01:47:06,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 01:47:06,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 01:47:06,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 01:47:06,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 01:47:06,119 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 01:47:06,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 01:47:06,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 01:47:06,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 01:47:06,122 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 01:47:06,123 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 01:47:06,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 01:47:06,126 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 01:47:06,127 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 01:47:06,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 01:47:06,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 01:47:06,129 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 01:47:06,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 01:47:06,130 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 01:47:06,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 01:47:06,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 01:47:06,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 01:47:06,131 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 01:47:06,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 01:47:06,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 01:47:06,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 01:47:06,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 01:47:06,133 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 01:47:06,133 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 01:47:06,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 01:47:06,134 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 01:47:06,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 01:47:06,135 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 01:47:06,151 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 01:47:06,151 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 01:47:06,151 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 01:47:06,151 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 01:47:06,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 01:47:06,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 01:47:06,153 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 01:47:06,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 01:47:06,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 01:47:06,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 01:47:06,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 01:47:06,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 01:47:06,153 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 01:47:06,153 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 01:47:06,154 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 01:47:06,154 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 01:47:06,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 01:47:06,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 01:47:06,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 01:47:06,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 01:47:06,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 01:47:06,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:47:06,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 01:47:06,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 01:47:06,155 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 01:47:06,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 01:47:06,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 01:47:06,155 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 01:47:06,156 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 01:47:06,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 01:47:06,156 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 01:47:06,156 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 01:47:06,156 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 01:47:06,157 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 01:47:06,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 01:47:06,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 01:47:06,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 01:47:06,365 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 01:47:06,365 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 01:47:06,366 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-2.c [2022-01-11 01:47:06,433 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8b8324ba/754884497a86437983fc418295084fe4/FLAG98d85da3b [2022-01-11 01:47:06,822 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 01:47:06,823 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.08.cil-2.c [2022-01-11 01:47:06,845 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8b8324ba/754884497a86437983fc418295084fe4/FLAG98d85da3b [2022-01-11 01:47:06,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8b8324ba/754884497a86437983fc418295084fe4 [2022-01-11 01:47:06,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 01:47:06,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 01:47:06,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 01:47:06,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 01:47:06,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 01:47:06,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:47:06" (1/1) ... [2022-01-11 01:47:06,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@751bb6d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:06, skipping insertion in model container [2022-01-11 01:47:06,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:47:06" (1/1) ... [2022-01-11 01:47:06,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 01:47:06,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 01:47:07,072 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-2.c[913,926] [2022-01-11 01:47:07,132 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-2.c[5977,5990] [2022-01-11 01:47:07,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:47:07,200 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 01:47:07,207 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-2.c[913,926] [2022-01-11 01:47:07,229 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-2.c[5977,5990] [2022-01-11 01:47:07,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:47:07,292 INFO L208 MainTranslator]: Completed translation [2022-01-11 01:47:07,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:07 WrapperNode [2022-01-11 01:47:07,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 01:47:07,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 01:47:07,293 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 01:47:07,293 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 01:47:07,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:07" (1/1) ... [2022-01-11 01:47:07,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:07" (1/1) ... [2022-01-11 01:47:07,397 INFO L137 Inliner]: procedures = 65, calls = 73, calls flagged for inlining = 68, calls inlined = 177, statements flattened = 2623 [2022-01-11 01:47:07,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 01:47:07,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 01:47:07,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 01:47:07,398 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 01:47:07,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:07" (1/1) ... [2022-01-11 01:47:07,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:07" (1/1) ... [2022-01-11 01:47:07,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:07" (1/1) ... [2022-01-11 01:47:07,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:07" (1/1) ... [2022-01-11 01:47:07,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:07" (1/1) ... [2022-01-11 01:47:07,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:07" (1/1) ... [2022-01-11 01:47:07,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:07" (1/1) ... [2022-01-11 01:47:07,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 01:47:07,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 01:47:07,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 01:47:07,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 01:47:07,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:07" (1/1) ... [2022-01-11 01:47:07,487 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:47:07,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:47:07,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 01:47:07,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 01:47:07,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 01:47:07,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 01:47:07,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 01:47:07,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 01:47:07,642 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 01:47:07,643 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 01:47:08,981 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 01:47:08,996 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 01:47:08,996 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-01-11 01:47:08,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:47:08 BoogieIcfgContainer [2022-01-11 01:47:09,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 01:47:09,000 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 01:47:09,000 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 01:47:09,001 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 01:47:09,003 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:47:08" (1/1) ... [2022-01-11 01:47:09,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:47:09 BasicIcfg [2022-01-11 01:47:09,267 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 01:47:09,268 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 01:47:09,268 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 01:47:09,270 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 01:47:09,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 01:47:06" (1/4) ... [2022-01-11 01:47:09,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764a98b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:47:09, skipping insertion in model container [2022-01-11 01:47:09,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:47:07" (2/4) ... [2022-01-11 01:47:09,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764a98b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:47:09, skipping insertion in model container [2022-01-11 01:47:09,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:47:08" (3/4) ... [2022-01-11 01:47:09,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764a98b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:47:09, skipping insertion in model container [2022-01-11 01:47:09,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:47:09" (4/4) ... [2022-01-11 01:47:09,272 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.08.cil-2.cTransformedIcfg [2022-01-11 01:47:09,275 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 01:47:09,275 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-11 01:47:09,319 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 01:47:09,338 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 01:47:09,338 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-11 01:47:09,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 1087 states, 1082 states have (on average 1.521256931608133) internal successors, (1646), 1086 states have internal predecessors, (1646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:09,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-11 01:47:09,361 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:09,361 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-11 01:47:09,362 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:09,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:09,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1193236542, now seen corresponding path program 1 times [2022-01-11 01:47:09,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:09,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052370825] [2022-01-11 01:47:09,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:09,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:09,596 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:09,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052370825] [2022-01-11 01:47:09,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052370825] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:09,597 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:09,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:09,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014238038] [2022-01-11 01:47:09,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:09,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:09,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:09,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:09,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:09,645 INFO L87 Difference]: Start difference. First operand has 1087 states, 1082 states have (on average 1.521256931608133) internal successors, (1646), 1086 states have internal predecessors, (1646), 0 states have call successors, (0), 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-11 01:47:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:09,790 INFO L93 Difference]: Finished difference Result 2120 states and 3197 transitions. [2022-01-11 01:47:09,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:09,792 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-11 01:47:09,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:09,807 INFO L225 Difference]: With dead ends: 2120 [2022-01-11 01:47:09,808 INFO L226 Difference]: Without dead ends: 1141 [2022-01-11 01:47:09,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:09,816 INFO L933 BasicCegarLoop]: 1618 mSDtfsCounter, 1579 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1579 SdHoareTripleChecker+Valid, 1712 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-11 01:47:09,816 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1579 Valid, 1712 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:09,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2022-01-11 01:47:09,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1120. [2022-01-11 01:47:09,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1116 states have (on average 1.4874551971326164) internal successors, (1660), 1119 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 1660 transitions. [2022-01-11 01:47:09,871 INFO L78 Accepts]: Start accepts. Automaton has 1120 states and 1660 transitions. Word has length 36 [2022-01-11 01:47:09,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:09,871 INFO L470 AbstractCegarLoop]: Abstraction has 1120 states and 1660 transitions. [2022-01-11 01:47:09,871 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-11 01:47:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1120 states and 1660 transitions. [2022-01-11 01:47:09,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-11 01:47:09,872 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:09,872 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-11 01:47:09,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 01:47:09,873 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:09,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:09,873 INFO L85 PathProgramCache]: Analyzing trace with hash 94209428, now seen corresponding path program 1 times [2022-01-11 01:47:09,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:09,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909711816] [2022-01-11 01:47:09,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:09,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:09,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:09,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909711816] [2022-01-11 01:47:09,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909711816] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:09,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:09,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:09,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013644678] [2022-01-11 01:47:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:09,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:09,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:09,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:09,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:09,923 INFO L87 Difference]: Start difference. First operand 1120 states and 1660 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-11 01:47:09,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:09,959 INFO L93 Difference]: Finished difference Result 1289 states and 1895 transitions. [2022-01-11 01:47:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:09,960 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-11 01:47:09,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:09,963 INFO L225 Difference]: With dead ends: 1289 [2022-01-11 01:47:09,963 INFO L226 Difference]: Without dead ends: 1178 [2022-01-11 01:47:09,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:09,964 INFO L933 BasicCegarLoop]: 1598 mSDtfsCounter, 60 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 3157 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-11 01:47:09,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 3157 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:09,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2022-01-11 01:47:09,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1173. [2022-01-11 01:47:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1169 states have (on average 1.4824636441402907) internal successors, (1733), 1172 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:09,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1733 transitions. [2022-01-11 01:47:09,985 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1733 transitions. Word has length 37 [2022-01-11 01:47:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:09,985 INFO L470 AbstractCegarLoop]: Abstraction has 1173 states and 1733 transitions. [2022-01-11 01:47:09,986 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-11 01:47:09,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1733 transitions. [2022-01-11 01:47:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-11 01:47:09,987 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:09,987 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-11 01:47:09,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 01:47:09,987 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:09,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:09,987 INFO L85 PathProgramCache]: Analyzing trace with hash -60087405, now seen corresponding path program 1 times [2022-01-11 01:47:09,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:09,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367680142] [2022-01-11 01:47:09,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:09,988 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:10,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:10,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:10,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367680142] [2022-01-11 01:47:10,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367680142] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:10,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:10,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:10,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235185984] [2022-01-11 01:47:10,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:10,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:10,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:10,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:10,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:10,028 INFO L87 Difference]: Start difference. First operand 1173 states and 1733 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-11 01:47:10,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:10,086 INFO L93 Difference]: Finished difference Result 1490 states and 2169 transitions. [2022-01-11 01:47:10,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:10,086 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-11 01:47:10,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:10,090 INFO L225 Difference]: With dead ends: 1490 [2022-01-11 01:47:10,090 INFO L226 Difference]: Without dead ends: 1326 [2022-01-11 01:47:10,090 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:10,091 INFO L933 BasicCegarLoop]: 1621 mSDtfsCounter, 1570 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1570 SdHoareTripleChecker+Valid, 1709 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-11 01:47:10,091 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1570 Valid, 1709 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:10,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2022-01-11 01:47:10,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1304. [2022-01-11 01:47:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 1300 states have (on average 1.4684615384615385) internal successors, (1909), 1303 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:10,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1909 transitions. [2022-01-11 01:47:10,114 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1909 transitions. Word has length 37 [2022-01-11 01:47:10,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:10,115 INFO L470 AbstractCegarLoop]: Abstraction has 1304 states and 1909 transitions. [2022-01-11 01:47:10,115 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-11 01:47:10,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1909 transitions. [2022-01-11 01:47:10,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 01:47:10,116 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:10,116 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-11 01:47:10,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 01:47:10,117 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:10,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:10,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1894945925, now seen corresponding path program 1 times [2022-01-11 01:47:10,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:10,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821229157] [2022-01-11 01:47:10,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:10,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:10,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:10,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821229157] [2022-01-11 01:47:10,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821229157] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:10,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:10,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:10,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908164851] [2022-01-11 01:47:10,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:10,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:10,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:10,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:10,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:10,165 INFO L87 Difference]: Start difference. First operand 1304 states and 1909 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:10,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:10,201 INFO L93 Difference]: Finished difference Result 1755 states and 2516 transitions. [2022-01-11 01:47:10,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:10,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-11 01:47:10,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:10,206 INFO L225 Difference]: With dead ends: 1755 [2022-01-11 01:47:10,206 INFO L226 Difference]: Without dead ends: 1460 [2022-01-11 01:47:10,207 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:10,207 INFO L933 BasicCegarLoop]: 1651 mSDtfsCounter, 48 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3237 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:10,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 3237 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:10,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2022-01-11 01:47:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1460. [2022-01-11 01:47:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1460 states, 1456 states have (on average 1.4402472527472527) internal successors, (2097), 1459 states have internal predecessors, (2097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2097 transitions. [2022-01-11 01:47:10,241 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2097 transitions. Word has length 51 [2022-01-11 01:47:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:10,241 INFO L470 AbstractCegarLoop]: Abstraction has 1460 states and 2097 transitions. [2022-01-11 01:47:10,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2097 transitions. [2022-01-11 01:47:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-11 01:47:10,243 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:10,243 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:47:10,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 01:47:10,243 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:10,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:10,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1526476654, now seen corresponding path program 1 times [2022-01-11 01:47:10,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:10,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543568779] [2022-01-11 01:47:10,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:10,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:10,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:10,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:10,282 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:10,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543568779] [2022-01-11 01:47:10,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543568779] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:10,282 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:10,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:10,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576798744] [2022-01-11 01:47:10,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:10,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:10,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:10,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:10,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:10,283 INFO L87 Difference]: Start difference. First operand 1460 states and 2097 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-11 01:47:10,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:10,321 INFO L93 Difference]: Finished difference Result 1933 states and 2713 transitions. [2022-01-11 01:47:10,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:10,322 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-11 01:47:10,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:10,326 INFO L225 Difference]: With dead ends: 1933 [2022-01-11 01:47:10,326 INFO L226 Difference]: Without dead ends: 1568 [2022-01-11 01:47:10,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:10,327 INFO L933 BasicCegarLoop]: 1598 mSDtfsCounter, 1544 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1544 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:10,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1544 Valid, 1686 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:10,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2022-01-11 01:47:10,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2022-01-11 01:47:10,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1564 states have (on average 1.4226342710997442) internal successors, (2225), 1567 states have internal predecessors, (2225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2225 transitions. [2022-01-11 01:47:10,356 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2225 transitions. Word has length 55 [2022-01-11 01:47:10,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:10,356 INFO L470 AbstractCegarLoop]: Abstraction has 1568 states and 2225 transitions. [2022-01-11 01:47:10,356 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-11 01:47:10,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2225 transitions. [2022-01-11 01:47:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:47:10,357 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:10,358 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-11 01:47:10,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 01:47:10,358 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:10,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:10,358 INFO L85 PathProgramCache]: Analyzing trace with hash 309054656, now seen corresponding path program 1 times [2022-01-11 01:47:10,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:10,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955064420] [2022-01-11 01:47:10,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:10,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:10,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:10,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:10,432 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:10,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955064420] [2022-01-11 01:47:10,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955064420] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:10,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:10,432 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:10,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23522036] [2022-01-11 01:47:10,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:10,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:10,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:10,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:10,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:10,433 INFO L87 Difference]: Start difference. First operand 1568 states and 2225 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-11 01:47:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:10,556 INFO L93 Difference]: Finished difference Result 2651 states and 3629 transitions. [2022-01-11 01:47:10,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:10,556 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-11 01:47:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:10,561 INFO L225 Difference]: With dead ends: 2651 [2022-01-11 01:47:10,562 INFO L226 Difference]: Without dead ends: 2228 [2022-01-11 01:47:10,562 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-11 01:47:10,563 INFO L933 BasicCegarLoop]: 1671 mSDtfsCounter, 302 mSDsluCounter, 4931 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 6602 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-11 01:47:10,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 6602 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2022-01-11 01:47:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 1592. [2022-01-11 01:47:10,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1588 states have (on average 1.413727959697733) internal successors, (2245), 1591 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:10,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2245 transitions. [2022-01-11 01:47:10,607 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2245 transitions. Word has length 56 [2022-01-11 01:47:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:10,608 INFO L470 AbstractCegarLoop]: Abstraction has 1592 states and 2245 transitions. [2022-01-11 01:47:10,608 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-11 01:47:10,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2245 transitions. [2022-01-11 01:47:10,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:47:10,609 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:10,609 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-11 01:47:10,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 01:47:10,609 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:10,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:10,610 INFO L85 PathProgramCache]: Analyzing trace with hash 659854593, now seen corresponding path program 1 times [2022-01-11 01:47:10,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:10,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585161276] [2022-01-11 01:47:10,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:10,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:10,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:10,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585161276] [2022-01-11 01:47:10,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585161276] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:10,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:10,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:10,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104582553] [2022-01-11 01:47:10,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:10,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:10,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:10,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:10,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:10,697 INFO L87 Difference]: Start difference. First operand 1592 states and 2245 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-11 01:47:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:10,789 INFO L93 Difference]: Finished difference Result 2381 states and 3255 transitions. [2022-01-11 01:47:10,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:10,789 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-11 01:47:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:10,794 INFO L225 Difference]: With dead ends: 2381 [2022-01-11 01:47:10,794 INFO L226 Difference]: Without dead ends: 1883 [2022-01-11 01:47:10,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:47:10,796 INFO L933 BasicCegarLoop]: 1648 mSDtfsCounter, 276 mSDsluCounter, 4900 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 6548 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-11 01:47:10,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 6548 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2022-01-11 01:47:10,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1490. [2022-01-11 01:47:10,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1486 states have (on average 1.4226110363391655) internal successors, (2114), 1489 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:10,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 2114 transitions. [2022-01-11 01:47:10,871 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 2114 transitions. Word has length 56 [2022-01-11 01:47:10,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:10,871 INFO L470 AbstractCegarLoop]: Abstraction has 1490 states and 2114 transitions. [2022-01-11 01:47:10,871 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-11 01:47:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2114 transitions. [2022-01-11 01:47:10,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 01:47:10,872 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:10,873 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-11 01:47:10,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 01:47:10,873 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:10,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:10,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1417324959, now seen corresponding path program 1 times [2022-01-11 01:47:10,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:10,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690473205] [2022-01-11 01:47:10,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:10,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:10,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:10,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:10,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690473205] [2022-01-11 01:47:10,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690473205] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:10,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:10,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 01:47:10,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286439127] [2022-01-11 01:47:10,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:10,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 01:47:10,936 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:10,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 01:47:10,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 01:47:10,937 INFO L87 Difference]: Start difference. First operand 1490 states and 2114 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-11 01:47:11,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:11,034 INFO L93 Difference]: Finished difference Result 1540 states and 2174 transitions. [2022-01-11 01:47:11,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 01:47:11,035 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-11 01:47:11,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:11,039 INFO L225 Difference]: With dead ends: 1540 [2022-01-11 01:47:11,039 INFO L226 Difference]: Without dead ends: 1538 [2022-01-11 01:47:11,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:11,040 INFO L933 BasicCegarLoop]: 1598 mSDtfsCounter, 3164 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3164 SdHoareTripleChecker+Valid, 1667 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-11 01:47:11,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3164 Valid, 1667 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:11,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-01-11 01:47:11,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1488. [2022-01-11 01:47:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1485 states have (on average 1.4215488215488215) internal successors, (2111), 1487 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:11,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 2111 transitions. [2022-01-11 01:47:11,115 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 2111 transitions. Word has length 56 [2022-01-11 01:47:11,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:11,115 INFO L470 AbstractCegarLoop]: Abstraction has 1488 states and 2111 transitions. [2022-01-11 01:47:11,116 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-11 01:47:11,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2111 transitions. [2022-01-11 01:47:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-11 01:47:11,116 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:11,116 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-11 01:47:11,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 01:47:11,117 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:11,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:11,117 INFO L85 PathProgramCache]: Analyzing trace with hash -987397522, now seen corresponding path program 1 times [2022-01-11 01:47:11,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:11,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571666409] [2022-01-11 01:47:11,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:11,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:11,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:11,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571666409] [2022-01-11 01:47:11,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571666409] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 01:47:11,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703468173] [2022-01-11 01:47:11,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:11,256 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:47:11,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:47:11,257 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 01:47:11,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 01:47:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:11,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-11 01:47:11,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 01:47:11,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:11,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 01:47:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:11,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703468173] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 01:47:11,915 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 01:47:11,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-11 01:47:11,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001012997] [2022-01-11 01:47:11,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 01:47:11,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 01:47:11,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:11,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 01:47:11,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 01:47:11,917 INFO L87 Difference]: Start difference. First operand 1488 states and 2111 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:12,109 INFO L93 Difference]: Finished difference Result 2374 states and 3239 transitions. [2022-01-11 01:47:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 01:47:12,112 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-11 01:47:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:12,119 INFO L225 Difference]: With dead ends: 2374 [2022-01-11 01:47:12,120 INFO L226 Difference]: Without dead ends: 2372 [2022-01-11 01:47:12,120 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-11 01:47:12,122 INFO L933 BasicCegarLoop]: 1673 mSDtfsCounter, 4963 mSDsluCounter, 5235 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4963 SdHoareTripleChecker+Valid, 6908 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:12,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4963 Valid, 6908 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:12,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2022-01-11 01:47:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 1760. [2022-01-11 01:47:12,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1757 states have (on average 1.402390438247012) internal successors, (2464), 1759 states have internal predecessors, (2464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2464 transitions. [2022-01-11 01:47:12,227 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2464 transitions. Word has length 57 [2022-01-11 01:47:12,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:12,228 INFO L470 AbstractCegarLoop]: Abstraction has 1760 states and 2464 transitions. [2022-01-11 01:47:12,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2464 transitions. [2022-01-11 01:47:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-11 01:47:12,229 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:12,229 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-11 01:47:12,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-11 01:47:12,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 01:47:12,463 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:12,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:12,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1845469173, now seen corresponding path program 2 times [2022-01-11 01:47:12,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:12,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681220043] [2022-01-11 01:47:12,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:12,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:12,507 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-11 01:47:12,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:12,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681220043] [2022-01-11 01:47:12,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681220043] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:12,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:12,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:12,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581411841] [2022-01-11 01:47:12,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:12,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:12,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:12,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:12,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:12,509 INFO L87 Difference]: Start difference. First operand 1760 states and 2464 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-11 01:47:12,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:12,595 INFO L93 Difference]: Finished difference Result 2267 states and 3124 transitions. [2022-01-11 01:47:12,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:12,595 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-11 01:47:12,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:12,600 INFO L225 Difference]: With dead ends: 2267 [2022-01-11 01:47:12,600 INFO L226 Difference]: Without dead ends: 1671 [2022-01-11 01:47:12,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:12,601 INFO L933 BasicCegarLoop]: 1632 mSDtfsCounter, 1548 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 1701 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-11 01:47:12,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1548 Valid, 1701 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:12,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2022-01-11 01:47:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1645. [2022-01-11 01:47:12,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1642 states have (on average 1.4080389768574908) internal successors, (2312), 1644 states have internal predecessors, (2312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2312 transitions. [2022-01-11 01:47:12,710 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2312 transitions. Word has length 72 [2022-01-11 01:47:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:12,710 INFO L470 AbstractCegarLoop]: Abstraction has 1645 states and 2312 transitions. [2022-01-11 01:47:12,710 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-11 01:47:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2312 transitions. [2022-01-11 01:47:12,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-11 01:47:12,714 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:12,714 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-11 01:47:12,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 01:47:12,715 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:12,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:12,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1394381388, now seen corresponding path program 1 times [2022-01-11 01:47:12,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:12,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734716158] [2022-01-11 01:47:12,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:12,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:12,770 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-11 01:47:12,770 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:12,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734716158] [2022-01-11 01:47:12,771 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734716158] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:12,771 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:12,771 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:12,771 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357491849] [2022-01-11 01:47:12,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:12,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:12,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:12,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:12,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:12,772 INFO L87 Difference]: Start difference. First operand 1645 states and 2312 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-11 01:47:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:12,858 INFO L93 Difference]: Finished difference Result 2299 states and 3139 transitions. [2022-01-11 01:47:12,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:12,858 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-11 01:47:12,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:12,864 INFO L225 Difference]: With dead ends: 2299 [2022-01-11 01:47:12,864 INFO L226 Difference]: Without dead ends: 1663 [2022-01-11 01:47:12,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:12,865 INFO L933 BasicCegarLoop]: 1605 mSDtfsCounter, 1533 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:12,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1533 Valid, 1689 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:12,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2022-01-11 01:47:12,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1645. [2022-01-11 01:47:12,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1642 states have (on average 1.3958587088915957) internal successors, (2292), 1644 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:12,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2292 transitions. [2022-01-11 01:47:12,946 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2292 transitions. Word has length 84 [2022-01-11 01:47:12,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:12,946 INFO L470 AbstractCegarLoop]: Abstraction has 1645 states and 2292 transitions. [2022-01-11 01:47:12,947 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-11 01:47:12,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2292 transitions. [2022-01-11 01:47:12,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-11 01:47:12,948 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:12,948 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-11 01:47:12,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 01:47:12,948 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:12,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:12,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1247561300, now seen corresponding path program 1 times [2022-01-11 01:47:12,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:12,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142357869] [2022-01-11 01:47:12,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:12,949 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:12,987 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-11 01:47:12,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:12,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142357869] [2022-01-11 01:47:12,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142357869] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:12,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:12,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:12,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542285832] [2022-01-11 01:47:12,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:12,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:12,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:12,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:12,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:12,989 INFO L87 Difference]: Start difference. First operand 1645 states and 2292 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-11 01:47:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:13,059 INFO L93 Difference]: Finished difference Result 1909 states and 2610 transitions. [2022-01-11 01:47:13,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:13,060 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-11 01:47:13,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:13,063 INFO L225 Difference]: With dead ends: 1909 [2022-01-11 01:47:13,063 INFO L226 Difference]: Without dead ends: 1003 [2022-01-11 01:47:13,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:13,065 INFO L933 BasicCegarLoop]: 1631 mSDtfsCounter, 56 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3194 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-11 01:47:13,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 3194 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-01-11 01:47:13,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2022-01-11 01:47:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1001 states have (on average 1.4945054945054945) internal successors, (1496), 1002 states have internal predecessors, (1496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1496 transitions. [2022-01-11 01:47:13,094 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1496 transitions. Word has length 85 [2022-01-11 01:47:13,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:13,094 INFO L470 AbstractCegarLoop]: Abstraction has 1003 states and 1496 transitions. [2022-01-11 01:47:13,094 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-11 01:47:13,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1496 transitions. [2022-01-11 01:47:13,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:13,095 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:13,095 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-11 01:47:13,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 01:47:13,095 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:13,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:13,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1539609402, now seen corresponding path program 1 times [2022-01-11 01:47:13,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:13,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177338075] [2022-01-11 01:47:13,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:13,096 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:13,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:13,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177338075] [2022-01-11 01:47:13,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177338075] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:13,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:13,129 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:13,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512933780] [2022-01-11 01:47:13,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:13,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:13,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:13,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:13,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:13,130 INFO L87 Difference]: Start difference. First operand 1003 states and 1496 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-11 01:47:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:13,181 INFO L93 Difference]: Finished difference Result 1997 states and 2979 transitions. [2022-01-11 01:47:13,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:13,181 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-11 01:47:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:13,184 INFO L225 Difference]: With dead ends: 1997 [2022-01-11 01:47:13,184 INFO L226 Difference]: Without dead ends: 1003 [2022-01-11 01:47:13,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:13,186 INFO L933 BasicCegarLoop]: 1494 mSDtfsCounter, 1487 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:13,186 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1487 Valid, 1495 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-01-11 01:47:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2022-01-11 01:47:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1001 states have (on average 1.4935064935064934) internal successors, (1495), 1002 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1495 transitions. [2022-01-11 01:47:13,216 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1495 transitions. Word has length 121 [2022-01-11 01:47:13,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:13,216 INFO L470 AbstractCegarLoop]: Abstraction has 1003 states and 1495 transitions. [2022-01-11 01:47:13,216 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-11 01:47:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1495 transitions. [2022-01-11 01:47:13,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:13,218 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:13,218 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-11 01:47:13,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 01:47:13,219 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:13,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:13,219 INFO L85 PathProgramCache]: Analyzing trace with hash -255698235, now seen corresponding path program 1 times [2022-01-11 01:47:13,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:13,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445102255] [2022-01-11 01:47:13,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:13,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:13,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:13,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445102255] [2022-01-11 01:47:13,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445102255] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:13,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:13,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:13,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413074291] [2022-01-11 01:47:13,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:13,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:13,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:13,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:13,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:13,260 INFO L87 Difference]: Start difference. First operand 1003 states and 1495 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-11 01:47:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:13,325 INFO L93 Difference]: Finished difference Result 2812 states and 4180 transitions. [2022-01-11 01:47:13,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:13,326 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-11 01:47:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:13,330 INFO L225 Difference]: With dead ends: 2812 [2022-01-11 01:47:13,330 INFO L226 Difference]: Without dead ends: 1825 [2022-01-11 01:47:13,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:13,332 INFO L933 BasicCegarLoop]: 1489 mSDtfsCounter, 1382 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 2790 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:13,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1382 Valid, 2790 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2022-01-11 01:47:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1821. [2022-01-11 01:47:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1819 states have (on average 1.48653106102254) internal successors, (2704), 1820 states have internal predecessors, (2704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2704 transitions. [2022-01-11 01:47:13,393 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2704 transitions. Word has length 121 [2022-01-11 01:47:13,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:13,394 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2704 transitions. [2022-01-11 01:47:13,394 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-11 01:47:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2704 transitions. [2022-01-11 01:47:13,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:13,394 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:13,395 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-11 01:47:13,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 01:47:13,395 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:13,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash -603532315, now seen corresponding path program 1 times [2022-01-11 01:47:13,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:13,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262021894] [2022-01-11 01:47:13,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:13,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:13,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:13,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262021894] [2022-01-11 01:47:13,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262021894] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:13,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:13,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:13,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050559425] [2022-01-11 01:47:13,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:13,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:13,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:13,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:13,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:13,428 INFO L87 Difference]: Start difference. First operand 1821 states and 2704 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-11 01:47:13,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:13,496 INFO L93 Difference]: Finished difference Result 3625 states and 5382 transitions. [2022-01-11 01:47:13,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:13,497 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-11 01:47:13,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:13,501 INFO L225 Difference]: With dead ends: 3625 [2022-01-11 01:47:13,501 INFO L226 Difference]: Without dead ends: 1821 [2022-01-11 01:47:13,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:13,506 INFO L933 BasicCegarLoop]: 1483 mSDtfsCounter, 1472 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:13,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1472 Valid, 1483 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:13,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-11 01:47:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2022-01-11 01:47:13,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1819 states have (on average 1.4821330401319406) internal successors, (2696), 1820 states have internal predecessors, (2696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2696 transitions. [2022-01-11 01:47:13,589 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2696 transitions. Word has length 121 [2022-01-11 01:47:13,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:13,589 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2696 transitions. [2022-01-11 01:47:13,589 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-11 01:47:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2696 transitions. [2022-01-11 01:47:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:13,590 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:13,590 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-11 01:47:13,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 01:47:13,590 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:13,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:13,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1740551877, now seen corresponding path program 1 times [2022-01-11 01:47:13,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:13,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166444032] [2022-01-11 01:47:13,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:13,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:13,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:13,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166444032] [2022-01-11 01:47:13,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166444032] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:13,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:13,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:13,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548348027] [2022-01-11 01:47:13,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:13,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:13,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:13,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:13,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:13,644 INFO L87 Difference]: Start difference. First operand 1821 states and 2696 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-11 01:47:13,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:13,725 INFO L93 Difference]: Finished difference Result 3624 states and 5365 transitions. [2022-01-11 01:47:13,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:13,725 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-11 01:47:13,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:13,731 INFO L225 Difference]: With dead ends: 3624 [2022-01-11 01:47:13,731 INFO L226 Difference]: Without dead ends: 1821 [2022-01-11 01:47:13,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:13,734 INFO L933 BasicCegarLoop]: 1478 mSDtfsCounter, 1466 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:13,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1466 Valid, 1478 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-11 01:47:13,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2022-01-11 01:47:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1819 states have (on average 1.4777350192413414) internal successors, (2688), 1820 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2688 transitions. [2022-01-11 01:47:13,813 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2688 transitions. Word has length 121 [2022-01-11 01:47:13,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:13,814 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2688 transitions. [2022-01-11 01:47:13,814 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-11 01:47:13,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2688 transitions. [2022-01-11 01:47:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:13,814 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:13,815 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-11 01:47:13,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 01:47:13,815 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:13,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:13,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1508968475, now seen corresponding path program 1 times [2022-01-11 01:47:13,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:13,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040712465] [2022-01-11 01:47:13,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:13,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:13,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:13,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040712465] [2022-01-11 01:47:13,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040712465] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:13,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:13,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:13,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188844187] [2022-01-11 01:47:13,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:13,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:13,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:13,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:13,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:13,843 INFO L87 Difference]: Start difference. First operand 1821 states and 2688 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-11 01:47:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:13,908 INFO L93 Difference]: Finished difference Result 3622 states and 5346 transitions. [2022-01-11 01:47:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:13,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-11 01:47:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:13,913 INFO L225 Difference]: With dead ends: 3622 [2022-01-11 01:47:13,913 INFO L226 Difference]: Without dead ends: 1821 [2022-01-11 01:47:13,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:13,915 INFO L933 BasicCegarLoop]: 1473 mSDtfsCounter, 1459 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:13,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1459 Valid, 1473 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:13,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-11 01:47:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2022-01-11 01:47:13,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1819 states have (on average 1.473336998350742) internal successors, (2680), 1820 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:13,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2680 transitions. [2022-01-11 01:47:13,978 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2680 transitions. Word has length 121 [2022-01-11 01:47:13,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:13,978 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2680 transitions. [2022-01-11 01:47:13,978 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-11 01:47:13,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2680 transitions. [2022-01-11 01:47:13,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:13,979 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:13,979 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-11 01:47:13,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 01:47:13,979 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:13,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1749221115, now seen corresponding path program 1 times [2022-01-11 01:47:13,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:13,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238783640] [2022-01-11 01:47:13,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:13,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:14,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:14,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238783640] [2022-01-11 01:47:14,006 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238783640] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:14,006 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:14,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:14,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357879792] [2022-01-11 01:47:14,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:14,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:14,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:14,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:14,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:14,008 INFO L87 Difference]: Start difference. First operand 1821 states and 2680 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-11 01:47:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:14,074 INFO L93 Difference]: Finished difference Result 3621 states and 5329 transitions. [2022-01-11 01:47:14,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:14,075 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-11 01:47:14,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:14,079 INFO L225 Difference]: With dead ends: 3621 [2022-01-11 01:47:14,079 INFO L226 Difference]: Without dead ends: 1821 [2022-01-11 01:47:14,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:14,081 INFO L933 BasicCegarLoop]: 1468 mSDtfsCounter, 1453 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:14,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1453 Valid, 1468 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:14,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-11 01:47:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2022-01-11 01:47:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1819 states have (on average 1.468938977460143) internal successors, (2672), 1820 states have internal predecessors, (2672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2672 transitions. [2022-01-11 01:47:14,170 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2672 transitions. Word has length 121 [2022-01-11 01:47:14,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:14,170 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2672 transitions. [2022-01-11 01:47:14,170 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-11 01:47:14,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2672 transitions. [2022-01-11 01:47:14,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:14,171 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:14,171 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-11 01:47:14,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 01:47:14,171 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:14,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:14,172 INFO L85 PathProgramCache]: Analyzing trace with hash -510045211, now seen corresponding path program 1 times [2022-01-11 01:47:14,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:14,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947971508] [2022-01-11 01:47:14,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:14,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:14,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:14,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:14,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947971508] [2022-01-11 01:47:14,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947971508] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:14,200 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:14,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:14,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473945250] [2022-01-11 01:47:14,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:14,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:14,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:14,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:14,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:14,201 INFO L87 Difference]: Start difference. First operand 1821 states and 2672 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-11 01:47:14,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:14,271 INFO L93 Difference]: Finished difference Result 3620 states and 5312 transitions. [2022-01-11 01:47:14,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:14,271 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-11 01:47:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:14,275 INFO L225 Difference]: With dead ends: 3620 [2022-01-11 01:47:14,275 INFO L226 Difference]: Without dead ends: 1821 [2022-01-11 01:47:14,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:14,277 INFO L933 BasicCegarLoop]: 1463 mSDtfsCounter, 1447 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:14,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1447 Valid, 1463 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:14,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-11 01:47:14,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2022-01-11 01:47:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1819 states have (on average 1.4645409565695438) internal successors, (2664), 1820 states have internal predecessors, (2664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2664 transitions. [2022-01-11 01:47:14,344 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2664 transitions. Word has length 121 [2022-01-11 01:47:14,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:14,344 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2664 transitions. [2022-01-11 01:47:14,344 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-11 01:47:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2664 transitions. [2022-01-11 01:47:14,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:14,344 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:14,345 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-11 01:47:14,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 01:47:14,345 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:14,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:14,345 INFO L85 PathProgramCache]: Analyzing trace with hash -747166459, now seen corresponding path program 1 times [2022-01-11 01:47:14,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:14,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109826541] [2022-01-11 01:47:14,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:14,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:14,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:14,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109826541] [2022-01-11 01:47:14,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109826541] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:14,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:14,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:14,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767080152] [2022-01-11 01:47:14,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:14,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:14,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:14,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:14,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:14,373 INFO L87 Difference]: Start difference. First operand 1821 states and 2664 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-11 01:47:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:14,444 INFO L93 Difference]: Finished difference Result 3619 states and 5295 transitions. [2022-01-11 01:47:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:14,445 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-11 01:47:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:14,447 INFO L225 Difference]: With dead ends: 3619 [2022-01-11 01:47:14,447 INFO L226 Difference]: Without dead ends: 1821 [2022-01-11 01:47:14,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:14,449 INFO L933 BasicCegarLoop]: 1458 mSDtfsCounter, 1441 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1441 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:14,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1441 Valid, 1458 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:14,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-11 01:47:14,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2022-01-11 01:47:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1819 states have (on average 1.4601429356789444) internal successors, (2656), 1820 states have internal predecessors, (2656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2656 transitions. [2022-01-11 01:47:14,514 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2656 transitions. Word has length 121 [2022-01-11 01:47:14,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:14,514 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2656 transitions. [2022-01-11 01:47:14,514 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-11 01:47:14,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2656 transitions. [2022-01-11 01:47:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:14,515 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:14,515 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-11 01:47:14,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 01:47:14,515 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:14,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:14,516 INFO L85 PathProgramCache]: Analyzing trace with hash -200626203, now seen corresponding path program 1 times [2022-01-11 01:47:14,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:14,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894342113] [2022-01-11 01:47:14,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:14,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:14,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:14,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894342113] [2022-01-11 01:47:14,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894342113] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:14,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:14,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:14,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065336551] [2022-01-11 01:47:14,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:14,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:14,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:14,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:14,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:14,553 INFO L87 Difference]: Start difference. First operand 1821 states and 2656 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-11 01:47:14,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:14,657 INFO L93 Difference]: Finished difference Result 3618 states and 5278 transitions. [2022-01-11 01:47:14,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:14,657 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-11 01:47:14,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:14,660 INFO L225 Difference]: With dead ends: 3618 [2022-01-11 01:47:14,660 INFO L226 Difference]: Without dead ends: 1821 [2022-01-11 01:47:14,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:14,662 INFO L933 BasicCegarLoop]: 1453 mSDtfsCounter, 1435 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1435 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:14,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1435 Valid, 1453 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:14,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-11 01:47:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2022-01-11 01:47:14,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1819 states have (on average 1.4557449147883452) internal successors, (2648), 1820 states have internal predecessors, (2648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2648 transitions. [2022-01-11 01:47:14,732 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2648 transitions. Word has length 121 [2022-01-11 01:47:14,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:14,732 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2648 transitions. [2022-01-11 01:47:14,732 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-11 01:47:14,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2648 transitions. [2022-01-11 01:47:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:14,733 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:14,733 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-11 01:47:14,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 01:47:14,733 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:14,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:14,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1063930117, now seen corresponding path program 1 times [2022-01-11 01:47:14,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:14,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98436147] [2022-01-11 01:47:14,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:14,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:14,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:14,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98436147] [2022-01-11 01:47:14,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98436147] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:14,764 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:14,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:14,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604231105] [2022-01-11 01:47:14,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:14,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:14,765 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:14,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:14,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:14,765 INFO L87 Difference]: Start difference. First operand 1821 states and 2648 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-11 01:47:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:14,866 INFO L93 Difference]: Finished difference Result 3617 states and 5261 transitions. [2022-01-11 01:47:14,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:14,867 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-11 01:47:14,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:14,870 INFO L225 Difference]: With dead ends: 3617 [2022-01-11 01:47:14,870 INFO L226 Difference]: Without dead ends: 1821 [2022-01-11 01:47:14,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:14,873 INFO L933 BasicCegarLoop]: 1426 mSDtfsCounter, 1326 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 1514 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-11 01:47:14,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1326 Valid, 1514 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-11 01:47:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2022-01-11 01:47:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1819 states have (on average 1.440351841671248) internal successors, (2620), 1820 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:14,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2620 transitions. [2022-01-11 01:47:14,943 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2620 transitions. Word has length 121 [2022-01-11 01:47:14,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:14,943 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2620 transitions. [2022-01-11 01:47:14,943 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-11 01:47:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2620 transitions. [2022-01-11 01:47:14,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:14,944 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:14,944 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-11 01:47:14,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 01:47:14,945 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:14,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:14,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1693229668, now seen corresponding path program 1 times [2022-01-11 01:47:14,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:14,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513625881] [2022-01-11 01:47:14,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:14,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:14,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:14,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513625881] [2022-01-11 01:47:14,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513625881] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:14,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:14,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:14,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410889339] [2022-01-11 01:47:14,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:14,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:14,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:14,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:14,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:14,987 INFO L87 Difference]: Start difference. First operand 1821 states and 2620 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-11 01:47:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:15,127 INFO L93 Difference]: Finished difference Result 3616 states and 5204 transitions. [2022-01-11 01:47:15,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:15,127 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-11 01:47:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:15,130 INFO L225 Difference]: With dead ends: 3616 [2022-01-11 01:47:15,130 INFO L226 Difference]: Without dead ends: 1821 [2022-01-11 01:47:15,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:15,134 INFO L933 BasicCegarLoop]: 1410 mSDtfsCounter, 1310 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 1497 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-11 01:47:15,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1310 Valid, 1497 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:15,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-11 01:47:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2022-01-11 01:47:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1819 states have (on average 1.4249587685541507) internal successors, (2592), 1820 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2592 transitions. [2022-01-11 01:47:15,217 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2592 transitions. Word has length 121 [2022-01-11 01:47:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:15,217 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2592 transitions. [2022-01-11 01:47:15,217 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-11 01:47:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2592 transitions. [2022-01-11 01:47:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:15,218 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:15,218 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-11 01:47:15,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 01:47:15,218 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:15,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:15,219 INFO L85 PathProgramCache]: Analyzing trace with hash 738207043, now seen corresponding path program 1 times [2022-01-11 01:47:15,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:15,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29710253] [2022-01-11 01:47:15,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:15,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:15,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:15,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:15,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29710253] [2022-01-11 01:47:15,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29710253] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:15,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:15,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:15,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227574796] [2022-01-11 01:47:15,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:15,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:15,254 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:15,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:15,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:15,255 INFO L87 Difference]: Start difference. First operand 1821 states and 2592 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-11 01:47:15,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:15,365 INFO L93 Difference]: Finished difference Result 3615 states and 5147 transitions. [2022-01-11 01:47:15,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:15,365 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-11 01:47:15,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:15,368 INFO L225 Difference]: With dead ends: 3615 [2022-01-11 01:47:15,368 INFO L226 Difference]: Without dead ends: 1821 [2022-01-11 01:47:15,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:15,372 INFO L933 BasicCegarLoop]: 1394 mSDtfsCounter, 1294 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 1480 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-11 01:47:15,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1294 Valid, 1480 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:15,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-11 01:47:15,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2022-01-11 01:47:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1819 states have (on average 1.4095656954370532) internal successors, (2564), 1820 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2564 transitions. [2022-01-11 01:47:15,450 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2564 transitions. Word has length 121 [2022-01-11 01:47:15,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:15,450 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2564 transitions. [2022-01-11 01:47:15,450 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-11 01:47:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2564 transitions. [2022-01-11 01:47:15,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:15,451 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:15,451 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-11 01:47:15,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 01:47:15,451 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:15,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:15,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1130118434, now seen corresponding path program 1 times [2022-01-11 01:47:15,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:15,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013452955] [2022-01-11 01:47:15,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:15,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:15,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:15,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013452955] [2022-01-11 01:47:15,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013452955] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:15,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:15,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:15,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816159532] [2022-01-11 01:47:15,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:15,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:15,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:15,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:15,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:15,485 INFO L87 Difference]: Start difference. First operand 1821 states and 2564 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-11 01:47:15,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:15,630 INFO L93 Difference]: Finished difference Result 3614 states and 5090 transitions. [2022-01-11 01:47:15,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:15,630 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-11 01:47:15,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:15,633 INFO L225 Difference]: With dead ends: 3614 [2022-01-11 01:47:15,633 INFO L226 Difference]: Without dead ends: 1821 [2022-01-11 01:47:15,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:15,636 INFO L933 BasicCegarLoop]: 1378 mSDtfsCounter, 1278 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 1463 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-11 01:47:15,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1278 Valid, 1463 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:15,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-11 01:47:15,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2022-01-11 01:47:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1819 states have (on average 1.394172622319956) internal successors, (2536), 1820 states have internal predecessors, (2536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2536 transitions. [2022-01-11 01:47:15,748 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2536 transitions. Word has length 121 [2022-01-11 01:47:15,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:15,748 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2536 transitions. [2022-01-11 01:47:15,748 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-11 01:47:15,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2536 transitions. [2022-01-11 01:47:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:15,749 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:15,749 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-11 01:47:15,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 01:47:15,750 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:15,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:15,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1239608961, now seen corresponding path program 1 times [2022-01-11 01:47:15,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:15,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895172069] [2022-01-11 01:47:15,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:15,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:15,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:15,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:15,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895172069] [2022-01-11 01:47:15,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895172069] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:15,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:15,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:15,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759654693] [2022-01-11 01:47:15,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:15,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:15,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:15,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:15,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:15,786 INFO L87 Difference]: Start difference. First operand 1821 states and 2536 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-11 01:47:15,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:15,908 INFO L93 Difference]: Finished difference Result 3613 states and 5033 transitions. [2022-01-11 01:47:15,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:15,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-11 01:47:15,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:15,911 INFO L225 Difference]: With dead ends: 3613 [2022-01-11 01:47:15,911 INFO L226 Difference]: Without dead ends: 1821 [2022-01-11 01:47:15,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:15,914 INFO L933 BasicCegarLoop]: 1362 mSDtfsCounter, 1262 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 1446 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-11 01:47:15,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1262 Valid, 1446 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:15,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-11 01:47:15,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2022-01-11 01:47:15,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1819 states have (on average 1.3787795492028587) internal successors, (2508), 1820 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2508 transitions. [2022-01-11 01:47:15,998 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2508 transitions. Word has length 121 [2022-01-11 01:47:15,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:15,998 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2508 transitions. [2022-01-11 01:47:15,998 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-11 01:47:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2508 transitions. [2022-01-11 01:47:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:15,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:15,999 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-11 01:47:15,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 01:47:16,000 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:16,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:16,000 INFO L85 PathProgramCache]: Analyzing trace with hash 859604192, now seen corresponding path program 1 times [2022-01-11 01:47:16,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:16,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5866598] [2022-01-11 01:47:16,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:16,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:16,025 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:16,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5866598] [2022-01-11 01:47:16,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5866598] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:16,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:16,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:16,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417278117] [2022-01-11 01:47:16,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:16,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:16,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:16,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:16,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:16,026 INFO L87 Difference]: Start difference. First operand 1821 states and 2508 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-11 01:47:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:16,132 INFO L93 Difference]: Finished difference Result 3612 states and 4976 transitions. [2022-01-11 01:47:16,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:16,133 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-11 01:47:16,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:16,136 INFO L225 Difference]: With dead ends: 3612 [2022-01-11 01:47:16,136 INFO L226 Difference]: Without dead ends: 1821 [2022-01-11 01:47:16,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:16,138 INFO L933 BasicCegarLoop]: 1346 mSDtfsCounter, 1246 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1429 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-11 01:47:16,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1246 Valid, 1429 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:16,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-11 01:47:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2022-01-11 01:47:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1819 states have (on average 1.3633864760857615) internal successors, (2480), 1820 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2480 transitions. [2022-01-11 01:47:16,250 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2480 transitions. Word has length 121 [2022-01-11 01:47:16,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:16,250 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2480 transitions. [2022-01-11 01:47:16,250 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-11 01:47:16,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2480 transitions. [2022-01-11 01:47:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:16,251 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:16,251 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-11 01:47:16,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 01:47:16,251 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:16,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:16,252 INFO L85 PathProgramCache]: Analyzing trace with hash 672015551, now seen corresponding path program 1 times [2022-01-11 01:47:16,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:16,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714286787] [2022-01-11 01:47:16,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:16,252 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:16,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:16,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714286787] [2022-01-11 01:47:16,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714286787] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:16,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:16,276 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:16,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735214544] [2022-01-11 01:47:16,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:16,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:16,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:16,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:16,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:16,277 INFO L87 Difference]: Start difference. First operand 1821 states and 2480 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-11 01:47:16,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:16,379 INFO L93 Difference]: Finished difference Result 3611 states and 4919 transitions. [2022-01-11 01:47:16,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:16,380 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-11 01:47:16,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:16,383 INFO L225 Difference]: With dead ends: 3611 [2022-01-11 01:47:16,383 INFO L226 Difference]: Without dead ends: 1821 [2022-01-11 01:47:16,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:16,385 INFO L933 BasicCegarLoop]: 1330 mSDtfsCounter, 1230 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 1412 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-11 01:47:16,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1230 Valid, 1412 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:16,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-11 01:47:16,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2022-01-11 01:47:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1819 states have (on average 1.3479934029686642) internal successors, (2452), 1820 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2452 transitions. [2022-01-11 01:47:16,461 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2452 transitions. Word has length 121 [2022-01-11 01:47:16,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:16,461 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2452 transitions. [2022-01-11 01:47:16,461 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-11 01:47:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2452 transitions. [2022-01-11 01:47:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:16,461 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:16,462 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-11 01:47:16,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 01:47:16,462 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:16,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:16,462 INFO L85 PathProgramCache]: Analyzing trace with hash -643237474, now seen corresponding path program 1 times [2022-01-11 01:47:16,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:16,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778740298] [2022-01-11 01:47:16,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:16,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:16,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:16,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778740298] [2022-01-11 01:47:16,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778740298] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:16,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:16,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:16,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091793754] [2022-01-11 01:47:16,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:16,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:16,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:16,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:16,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:16,489 INFO L87 Difference]: Start difference. First operand 1821 states and 2452 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-11 01:47:16,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:16,591 INFO L93 Difference]: Finished difference Result 3610 states and 4862 transitions. [2022-01-11 01:47:16,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:16,592 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-11 01:47:16,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:16,594 INFO L225 Difference]: With dead ends: 3610 [2022-01-11 01:47:16,594 INFO L226 Difference]: Without dead ends: 1821 [2022-01-11 01:47:16,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:16,596 INFO L933 BasicCegarLoop]: 1314 mSDtfsCounter, 1214 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 1395 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-11 01:47:16,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1214 Valid, 1395 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:16,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-11 01:47:16,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2022-01-11 01:47:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1819 states have (on average 1.3326003298515667) internal successors, (2424), 1820 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:16,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2424 transitions. [2022-01-11 01:47:16,710 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2424 transitions. Word has length 121 [2022-01-11 01:47:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:16,710 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2424 transitions. [2022-01-11 01:47:16,710 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-11 01:47:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2424 transitions. [2022-01-11 01:47:16,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:16,711 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:16,711 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-11 01:47:16,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 01:47:16,711 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:16,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:16,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2101524483, now seen corresponding path program 1 times [2022-01-11 01:47:16,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:16,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971761897] [2022-01-11 01:47:16,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:16,712 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:16,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:16,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971761897] [2022-01-11 01:47:16,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971761897] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:16,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:16,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:16,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65753667] [2022-01-11 01:47:16,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:16,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:16,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:16,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:16,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:16,736 INFO L87 Difference]: Start difference. First operand 1821 states and 2424 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-11 01:47:16,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:16,841 INFO L93 Difference]: Finished difference Result 3609 states and 4805 transitions. [2022-01-11 01:47:16,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:16,841 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-11 01:47:16,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:16,844 INFO L225 Difference]: With dead ends: 3609 [2022-01-11 01:47:16,844 INFO L226 Difference]: Without dead ends: 1821 [2022-01-11 01:47:16,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:16,846 INFO L933 BasicCegarLoop]: 1298 mSDtfsCounter, 1198 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 1378 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-11 01:47:16,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1198 Valid, 1378 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:16,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2022-01-11 01:47:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2022-01-11 01:47:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1819 states have (on average 1.3172072567344695) internal successors, (2396), 1820 states have internal predecessors, (2396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:16,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2396 transitions. [2022-01-11 01:47:16,925 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2396 transitions. Word has length 121 [2022-01-11 01:47:16,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:16,925 INFO L470 AbstractCegarLoop]: Abstraction has 1821 states and 2396 transitions. [2022-01-11 01:47:16,925 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-11 01:47:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2396 transitions. [2022-01-11 01:47:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:16,926 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:16,926 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-11 01:47:16,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 01:47:16,926 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:16,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:16,926 INFO L85 PathProgramCache]: Analyzing trace with hash -654501028, now seen corresponding path program 1 times [2022-01-11 01:47:16,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:16,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621591220] [2022-01-11 01:47:16,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:16,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:16,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:16,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621591220] [2022-01-11 01:47:16,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621591220] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:16,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:16,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:16,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495664173] [2022-01-11 01:47:16,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:16,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:16,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:16,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:16,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:16,965 INFO L87 Difference]: Start difference. First operand 1821 states and 2396 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-11 01:47:17,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:17,171 INFO L93 Difference]: Finished difference Result 4292 states and 5707 transitions. [2022-01-11 01:47:17,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:17,172 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-11 01:47:17,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:17,176 INFO L225 Difference]: With dead ends: 4292 [2022-01-11 01:47:17,176 INFO L226 Difference]: Without dead ends: 2511 [2022-01-11 01:47:17,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:47:17,178 INFO L933 BasicCegarLoop]: 1418 mSDtfsCounter, 3717 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3717 SdHoareTripleChecker+Valid, 2839 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-11 01:47:17,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3717 Valid, 2839 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:47:17,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2022-01-11 01:47:17,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 1827. [2022-01-11 01:47:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1825 states have (on average 1.305205479452055) internal successors, (2382), 1826 states have internal predecessors, (2382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:17,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2382 transitions. [2022-01-11 01:47:17,318 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2382 transitions. Word has length 121 [2022-01-11 01:47:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:17,318 INFO L470 AbstractCegarLoop]: Abstraction has 1827 states and 2382 transitions. [2022-01-11 01:47:17,318 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-11 01:47:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2382 transitions. [2022-01-11 01:47:17,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:17,319 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:17,319 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-11 01:47:17,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 01:47:17,319 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:17,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:17,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2139556579, now seen corresponding path program 1 times [2022-01-11 01:47:17,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:17,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650416538] [2022-01-11 01:47:17,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:17,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:17,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:17,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650416538] [2022-01-11 01:47:17,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650416538] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:17,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:17,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:17,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571828619] [2022-01-11 01:47:17,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:17,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:17,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:17,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:17,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:17,356 INFO L87 Difference]: Start difference. First operand 1827 states and 2382 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-11 01:47:17,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:17,623 INFO L93 Difference]: Finished difference Result 4520 states and 5942 transitions. [2022-01-11 01:47:17,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:17,623 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-11 01:47:17,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:17,629 INFO L225 Difference]: With dead ends: 4520 [2022-01-11 01:47:17,629 INFO L226 Difference]: Without dead ends: 2747 [2022-01-11 01:47:17,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:47:17,634 INFO L933 BasicCegarLoop]: 1371 mSDtfsCounter, 3443 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3443 SdHoareTripleChecker+Valid, 3309 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-11 01:47:17,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3443 Valid, 3309 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:47:17,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2022-01-11 01:47:17,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 1833. [2022-01-11 01:47:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1831 states have (on average 1.2932823593664664) internal successors, (2368), 1832 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2368 transitions. [2022-01-11 01:47:17,752 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2368 transitions. Word has length 121 [2022-01-11 01:47:17,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:17,752 INFO L470 AbstractCegarLoop]: Abstraction has 1833 states and 2368 transitions. [2022-01-11 01:47:17,752 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-11 01:47:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2368 transitions. [2022-01-11 01:47:17,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:17,753 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:17,753 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-11 01:47:17,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 01:47:17,753 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:17,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:17,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1671735390, now seen corresponding path program 1 times [2022-01-11 01:47:17,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:17,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376530929] [2022-01-11 01:47:17,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:17,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:17,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:17,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376530929] [2022-01-11 01:47:17,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376530929] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:17,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:17,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:47:17,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729154637] [2022-01-11 01:47:17,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:17,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:47:17,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:17,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:47:17,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:47:17,793 INFO L87 Difference]: Start difference. First operand 1833 states and 2368 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-11 01:47:18,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:18,129 INFO L93 Difference]: Finished difference Result 4643 states and 6040 transitions. [2022-01-11 01:47:18,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:47:18,130 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-11 01:47:18,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:18,134 INFO L225 Difference]: With dead ends: 4643 [2022-01-11 01:47:18,134 INFO L226 Difference]: Without dead ends: 2871 [2022-01-11 01:47:18,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:47:18,137 INFO L933 BasicCegarLoop]: 1342 mSDtfsCounter, 3296 mSDsluCounter, 2171 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3296 SdHoareTripleChecker+Valid, 3513 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-11 01:47:18,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3296 Valid, 3513 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:47:18,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2871 states. [2022-01-11 01:47:18,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2871 to 1839. [2022-01-11 01:47:18,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1837 states have (on average 1.281437125748503) internal successors, (2354), 1838 states have internal predecessors, (2354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:18,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2354 transitions. [2022-01-11 01:47:18,316 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2354 transitions. Word has length 121 [2022-01-11 01:47:18,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:18,316 INFO L470 AbstractCegarLoop]: Abstraction has 1839 states and 2354 transitions. [2022-01-11 01:47:18,316 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-11 01:47:18,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2354 transitions. [2022-01-11 01:47:18,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:18,317 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:18,317 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-11 01:47:18,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 01:47:18,317 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:18,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:18,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1318838177, now seen corresponding path program 1 times [2022-01-11 01:47:18,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:18,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570502845] [2022-01-11 01:47:18,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:18,318 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:18,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:18,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570502845] [2022-01-11 01:47:18,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570502845] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:18,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:18,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:18,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096688903] [2022-01-11 01:47:18,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:18,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:18,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:18,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:18,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:18,381 INFO L87 Difference]: Start difference. First operand 1839 states and 2354 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-11 01:47:18,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:18,576 INFO L93 Difference]: Finished difference Result 3659 states and 4680 transitions. [2022-01-11 01:47:18,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:18,576 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-11 01:47:18,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:18,580 INFO L225 Difference]: With dead ends: 3659 [2022-01-11 01:47:18,580 INFO L226 Difference]: Without dead ends: 1839 [2022-01-11 01:47:18,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:18,587 INFO L933 BasicCegarLoop]: 1271 mSDtfsCounter, 1185 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:18,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1185 Valid, 1271 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2022-01-11 01:47:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1839. [2022-01-11 01:47:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1837 states have (on average 1.2770821992378878) internal successors, (2346), 1838 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2346 transitions. [2022-01-11 01:47:18,721 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2346 transitions. Word has length 121 [2022-01-11 01:47:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:18,722 INFO L470 AbstractCegarLoop]: Abstraction has 1839 states and 2346 transitions. [2022-01-11 01:47:18,725 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-11 01:47:18,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2346 transitions. [2022-01-11 01:47:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-11 01:47:18,725 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:18,725 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-11 01:47:18,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 01:47:18,726 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:18,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:18,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1307522050, now seen corresponding path program 1 times [2022-01-11 01:47:18,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:18,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377443460] [2022-01-11 01:47:18,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:18,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:18,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:18,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377443460] [2022-01-11 01:47:18,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377443460] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:18,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:18,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:47:18,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167007883] [2022-01-11 01:47:18,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:18,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:18,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:18,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:18,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:18,758 INFO L87 Difference]: Start difference. First operand 1839 states and 2346 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-11 01:47:19,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:19,054 INFO L93 Difference]: Finished difference Result 5318 states and 6791 transitions. [2022-01-11 01:47:19,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:19,055 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-11 01:47:19,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:19,063 INFO L225 Difference]: With dead ends: 5318 [2022-01-11 01:47:19,063 INFO L226 Difference]: Without dead ends: 3514 [2022-01-11 01:47:19,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:19,067 INFO L933 BasicCegarLoop]: 1261 mSDtfsCounter, 1114 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 2371 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-11 01:47:19,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1114 Valid, 2371 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:19,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2022-01-11 01:47:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 3390. [2022-01-11 01:47:19,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3390 states, 3388 states have (on average 1.2724321133412042) internal successors, (4311), 3389 states have internal predecessors, (4311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 4311 transitions. [2022-01-11 01:47:19,304 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 4311 transitions. Word has length 121 [2022-01-11 01:47:19,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:19,304 INFO L470 AbstractCegarLoop]: Abstraction has 3390 states and 4311 transitions. [2022-01-11 01:47:19,304 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-11 01:47:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 4311 transitions. [2022-01-11 01:47:19,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-11 01:47:19,306 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:19,306 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-11 01:47:19,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 01:47:19,306 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:19,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:19,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1265246177, now seen corresponding path program 1 times [2022-01-11 01:47:19,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:19,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109143670] [2022-01-11 01:47:19,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:19,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:19,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:19,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109143670] [2022-01-11 01:47:19,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109143670] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:19,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:19,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:19,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410221941] [2022-01-11 01:47:19,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:19,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:19,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:19,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:19,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:19,343 INFO L87 Difference]: Start difference. First operand 3390 states and 4311 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-11 01:47:19,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:19,841 INFO L93 Difference]: Finished difference Result 9935 states and 12659 transitions. [2022-01-11 01:47:19,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:19,841 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-11 01:47:19,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:19,849 INFO L225 Difference]: With dead ends: 9935 [2022-01-11 01:47:19,849 INFO L226 Difference]: Without dead ends: 6586 [2022-01-11 01:47:19,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:19,854 INFO L933 BasicCegarLoop]: 1258 mSDtfsCounter, 1149 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 2368 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-11 01:47:19,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1149 Valid, 2368 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:19,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6586 states. [2022-01-11 01:47:20,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6586 to 6342. [2022-01-11 01:47:20,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6342 states, 6340 states have (on average 1.2705047318611988) internal successors, (8055), 6341 states have internal predecessors, (8055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6342 states to 6342 states and 8055 transitions. [2022-01-11 01:47:20,321 INFO L78 Accepts]: Start accepts. Automaton has 6342 states and 8055 transitions. Word has length 196 [2022-01-11 01:47:20,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:20,321 INFO L470 AbstractCegarLoop]: Abstraction has 6342 states and 8055 transitions. [2022-01-11 01:47:20,321 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-11 01:47:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 6342 states and 8055 transitions. [2022-01-11 01:47:20,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-11 01:47:20,326 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:20,326 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-11 01:47:20,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 01:47:20,327 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:20,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash -803643456, now seen corresponding path program 1 times [2022-01-11 01:47:20,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:20,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699010510] [2022-01-11 01:47:20,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:20,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:20,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:20,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699010510] [2022-01-11 01:47:20,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699010510] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:20,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:20,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:20,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124477433] [2022-01-11 01:47:20,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:20,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:20,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:20,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:20,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:20,379 INFO L87 Difference]: Start difference. First operand 6342 states and 8055 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-11 01:47:21,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:21,395 INFO L93 Difference]: Finished difference Result 18655 states and 23573 transitions. [2022-01-11 01:47:21,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:21,396 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-11 01:47:21,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:21,410 INFO L225 Difference]: With dead ends: 18655 [2022-01-11 01:47:21,410 INFO L226 Difference]: Without dead ends: 12427 [2022-01-11 01:47:21,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:21,417 INFO L933 BasicCegarLoop]: 1494 mSDtfsCounter, 1143 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 2734 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-11 01:47:21,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1143 Valid, 2734 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:21,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12427 states. [2022-01-11 01:47:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12427 to 12199. [2022-01-11 01:47:22,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12199 states, 12197 states have (on average 1.2576043289333443) internal successors, (15339), 12198 states have internal predecessors, (15339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:22,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12199 states to 12199 states and 15339 transitions. [2022-01-11 01:47:22,318 INFO L78 Accepts]: Start accepts. Automaton has 12199 states and 15339 transitions. Word has length 196 [2022-01-11 01:47:22,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:22,319 INFO L470 AbstractCegarLoop]: Abstraction has 12199 states and 15339 transitions. [2022-01-11 01:47:22,319 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-11 01:47:22,319 INFO L276 IsEmpty]: Start isEmpty. Operand 12199 states and 15339 transitions. [2022-01-11 01:47:22,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-01-11 01:47:22,325 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:22,325 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-11 01:47:22,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 01:47:22,325 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:22,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:22,326 INFO L85 PathProgramCache]: Analyzing trace with hash 741238654, now seen corresponding path program 1 times [2022-01-11 01:47:22,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:22,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285974277] [2022-01-11 01:47:22,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:22,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:47:22,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:22,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285974277] [2022-01-11 01:47:22,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285974277] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:22,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:22,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:22,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492756101] [2022-01-11 01:47:22,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:22,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:22,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:22,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:22,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:22,368 INFO L87 Difference]: Start difference. First operand 12199 states and 15339 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-11 01:47:23,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:23,227 INFO L93 Difference]: Finished difference Result 24246 states and 30498 transitions. [2022-01-11 01:47:23,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:23,229 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-11 01:47:23,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:23,241 INFO L225 Difference]: With dead ends: 24246 [2022-01-11 01:47:23,241 INFO L226 Difference]: Without dead ends: 12092 [2022-01-11 01:47:23,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:23,255 INFO L933 BasicCegarLoop]: 1270 mSDtfsCounter, 1265 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1265 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:23,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1265 Valid, 1271 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:23,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12092 states. [2022-01-11 01:47:24,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12092 to 12092. [2022-01-11 01:47:24,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12092 states, 12090 states have (on average 1.2582299421009098) internal successors, (15212), 12091 states have internal predecessors, (15212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:24,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12092 states to 12092 states and 15212 transitions. [2022-01-11 01:47:24,170 INFO L78 Accepts]: Start accepts. Automaton has 12092 states and 15212 transitions. Word has length 196 [2022-01-11 01:47:24,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:24,171 INFO L470 AbstractCegarLoop]: Abstraction has 12092 states and 15212 transitions. [2022-01-11 01:47:24,171 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-11 01:47:24,171 INFO L276 IsEmpty]: Start isEmpty. Operand 12092 states and 15212 transitions. [2022-01-11 01:47:24,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-01-11 01:47:24,176 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:24,176 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-11 01:47:24,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 01:47:24,177 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:24,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:24,177 INFO L85 PathProgramCache]: Analyzing trace with hash 2051901421, now seen corresponding path program 1 times [2022-01-11 01:47:24,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:24,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323499581] [2022-01-11 01:47:24,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:24,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:24,222 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:24,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323499581] [2022-01-11 01:47:24,222 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323499581] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:24,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:24,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:24,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425116167] [2022-01-11 01:47:24,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:24,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:24,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:24,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:24,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:24,224 INFO L87 Difference]: Start difference. First operand 12092 states and 15212 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-11 01:47:25,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:25,958 INFO L93 Difference]: Finished difference Result 34842 states and 43732 transitions. [2022-01-11 01:47:25,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:25,958 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-11 01:47:25,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:25,989 INFO L225 Difference]: With dead ends: 34842 [2022-01-11 01:47:25,989 INFO L226 Difference]: Without dead ends: 22864 [2022-01-11 01:47:26,000 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:26,000 INFO L933 BasicCegarLoop]: 1885 mSDtfsCounter, 964 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:26,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [964 Valid, 3134 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:26,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22864 states. [2022-01-11 01:47:27,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22864 to 22860. [2022-01-11 01:47:27,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22860 states, 22858 states have (on average 1.2517280601977425) internal successors, (28612), 22859 states have internal predecessors, (28612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22860 states to 22860 states and 28612 transitions. [2022-01-11 01:47:27,742 INFO L78 Accepts]: Start accepts. Automaton has 22860 states and 28612 transitions. Word has length 197 [2022-01-11 01:47:27,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:27,742 INFO L470 AbstractCegarLoop]: Abstraction has 22860 states and 28612 transitions. [2022-01-11 01:47:27,742 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-11 01:47:27,742 INFO L276 IsEmpty]: Start isEmpty. Operand 22860 states and 28612 transitions. [2022-01-11 01:47:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-01-11 01:47:27,750 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:27,750 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-11 01:47:27,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-11 01:47:27,750 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:27,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:27,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1815283596, now seen corresponding path program 1 times [2022-01-11 01:47:27,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:27,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79686873] [2022-01-11 01:47:27,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:27,751 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:47:27,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:27,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79686873] [2022-01-11 01:47:27,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79686873] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:27,774 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:27,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:27,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629947018] [2022-01-11 01:47:27,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:27,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:27,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:27,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:27,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:27,775 INFO L87 Difference]: Start difference. First operand 22860 states and 28612 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-11 01:47:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:29,573 INFO L93 Difference]: Finished difference Result 45500 states and 56966 transitions. [2022-01-11 01:47:29,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:29,573 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-11 01:47:29,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:29,604 INFO L225 Difference]: With dead ends: 45500 [2022-01-11 01:47:29,605 INFO L226 Difference]: Without dead ends: 22754 [2022-01-11 01:47:29,628 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:29,629 INFO L933 BasicCegarLoop]: 1269 mSDtfsCounter, 1263 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1263 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:29,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1263 Valid, 1270 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:29,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22754 states. [2022-01-11 01:47:31,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22754 to 22754. [2022-01-11 01:47:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22754 states, 22752 states have (on average 1.2520657524613221) internal successors, (28487), 22753 states have internal predecessors, (28487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22754 states to 22754 states and 28487 transitions. [2022-01-11 01:47:31,422 INFO L78 Accepts]: Start accepts. Automaton has 22754 states and 28487 transitions. Word has length 197 [2022-01-11 01:47:31,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:31,423 INFO L470 AbstractCegarLoop]: Abstraction has 22754 states and 28487 transitions. [2022-01-11 01:47:31,423 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-11 01:47:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand 22754 states and 28487 transitions. [2022-01-11 01:47:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-01-11 01:47:31,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:31,430 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-11 01:47:31,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-11 01:47:31,430 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:31,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:31,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2088773645, now seen corresponding path program 1 times [2022-01-11 01:47:31,430 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:31,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147186051] [2022-01-11 01:47:31,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:31,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:31,553 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:31,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147186051] [2022-01-11 01:47:31,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147186051] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:31,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:31,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:31,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301255853] [2022-01-11 01:47:31,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:31,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:31,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:31,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:31,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:31,555 INFO L87 Difference]: Start difference. First operand 22754 states and 28487 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-11 01:47:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:34,967 INFO L93 Difference]: Finished difference Result 65674 states and 82139 transitions. [2022-01-11 01:47:34,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:34,968 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-11 01:47:34,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:35,037 INFO L225 Difference]: With dead ends: 65674 [2022-01-11 01:47:35,038 INFO L226 Difference]: Without dead ends: 43034 [2022-01-11 01:47:35,102 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:35,102 INFO L933 BasicCegarLoop]: 1266 mSDtfsCounter, 973 mSDsluCounter, 1125 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:35,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [973 Valid, 2391 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:35,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43034 states. [2022-01-11 01:47:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43034 to 43030. [2022-01-11 01:47:38,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43030 states, 43028 states have (on average 1.2486520405317467) internal successors, (53727), 43029 states have internal predecessors, (53727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:38,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43030 states to 43030 states and 53727 transitions. [2022-01-11 01:47:38,745 INFO L78 Accepts]: Start accepts. Automaton has 43030 states and 53727 transitions. Word has length 198 [2022-01-11 01:47:38,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:38,745 INFO L470 AbstractCegarLoop]: Abstraction has 43030 states and 53727 transitions. [2022-01-11 01:47:38,746 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-11 01:47:38,746 INFO L276 IsEmpty]: Start isEmpty. Operand 43030 states and 53727 transitions. [2022-01-11 01:47:38,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-01-11 01:47:38,759 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:38,763 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-11 01:47:38,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-11 01:47:38,763 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:38,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:38,764 INFO L85 PathProgramCache]: Analyzing trace with hash -2086811620, now seen corresponding path program 1 times [2022-01-11 01:47:38,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:38,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064409140] [2022-01-11 01:47:38,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:38,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:38,846 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:47:38,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:38,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064409140] [2022-01-11 01:47:38,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064409140] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:38,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:38,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:38,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703762618] [2022-01-11 01:47:38,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:38,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:38,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:38,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:38,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:38,848 INFO L87 Difference]: Start difference. First operand 43030 states and 53727 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-11 01:47:45,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:45,400 INFO L93 Difference]: Finished difference Result 126438 states and 157836 transitions. [2022-01-11 01:47:45,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:45,400 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-11 01:47:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:45,521 INFO L225 Difference]: With dead ends: 126438 [2022-01-11 01:47:45,521 INFO L226 Difference]: Without dead ends: 83522 [2022-01-11 01:47:45,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:45,571 INFO L933 BasicCegarLoop]: 1601 mSDtfsCounter, 1145 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 2836 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:45,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1145 Valid, 2836 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:47:45,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83522 states. [2022-01-11 01:47:52,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83522 to 81470. [2022-01-11 01:47:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81470 states, 81468 states have (on average 1.24623164923651) internal successors, (101528), 81469 states have internal predecessors, (101528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:52,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81470 states to 81470 states and 101528 transitions. [2022-01-11 01:47:52,284 INFO L78 Accepts]: Start accepts. Automaton has 81470 states and 101528 transitions. Word has length 199 [2022-01-11 01:47:52,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:47:52,284 INFO L470 AbstractCegarLoop]: Abstraction has 81470 states and 101528 transitions. [2022-01-11 01:47:52,284 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-01-11 01:47:52,284 INFO L276 IsEmpty]: Start isEmpty. Operand 81470 states and 101528 transitions. [2022-01-11 01:47:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-01-11 01:47:52,312 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:47:52,312 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-11 01:47:52,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-11 01:47:52,313 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:47:52,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:47:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1155414915, now seen corresponding path program 1 times [2022-01-11 01:47:52,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:47:52,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442757525] [2022-01-11 01:47:52,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:47:52,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:47:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:47:52,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:47:52,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:47:52,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442757525] [2022-01-11 01:47:52,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442757525] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:47:52,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:47:52,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:47:52,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976751102] [2022-01-11 01:47:52,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:47:52,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:47:52,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:47:52,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:47:52,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:52,515 INFO L87 Difference]: Start difference. First operand 81470 states and 101528 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:47:59,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:47:59,464 INFO L93 Difference]: Finished difference Result 162770 states and 202858 transitions. [2022-01-11 01:47:59,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:47:59,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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-11 01:47:59,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:47:59,725 INFO L225 Difference]: With dead ends: 162770 [2022-01-11 01:47:59,725 INFO L226 Difference]: Without dead ends: 81366 [2022-01-11 01:47:59,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:47:59,827 INFO L933 BasicCegarLoop]: 1268 mSDtfsCounter, 1260 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1260 SdHoareTripleChecker+Valid, 1269 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:47:59,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1260 Valid, 1269 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:47:59,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81366 states. [2022-01-11 01:48:06,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81366 to 81366. [2022-01-11 01:48:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81366 states, 81364 states have (on average 1.2463251560886879) internal successors, (101406), 81365 states have internal predecessors, (101406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81366 states to 81366 states and 101406 transitions. [2022-01-11 01:48:07,030 INFO L78 Accepts]: Start accepts. Automaton has 81366 states and 101406 transitions. Word has length 199 [2022-01-11 01:48:07,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:48:07,030 INFO L470 AbstractCegarLoop]: Abstraction has 81366 states and 101406 transitions. [2022-01-11 01:48:07,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:48:07,031 INFO L276 IsEmpty]: Start isEmpty. Operand 81366 states and 101406 transitions. [2022-01-11 01:48:07,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-01-11 01:48:07,052 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:48:07,053 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:48:07,053 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-11 01:48:07,053 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-11 01:48:07,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:48:07,053 INFO L85 PathProgramCache]: Analyzing trace with hash -519470621, now seen corresponding path program 1 times [2022-01-11 01:48:07,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:48:07,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127941273] [2022-01-11 01:48:07,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:48:07,054 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:48:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:48:07,092 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:48:07,092 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:48:07,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127941273] [2022-01-11 01:48:07,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127941273] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:48:07,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:48:07,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:48:07,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782308589] [2022-01-11 01:48:07,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:48:07,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:48:07,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:48:07,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:48:07,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:48:07,093 INFO L87 Difference]: Start difference. First operand 81366 states and 101406 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)