/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 14:10:39,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 14:10:39,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 14:10:39,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 14:10:39,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 14:10:39,205 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 14:10:39,206 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 14:10:39,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 14:10:39,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 14:10:39,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 14:10:39,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 14:10:39,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 14:10:39,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 14:10:39,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 14:10:39,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 14:10:39,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 14:10:39,213 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 14:10:39,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 14:10:39,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 14:10:39,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 14:10:39,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 14:10:39,234 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 14:10:39,235 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 14:10:39,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 14:10:39,237 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 14:10:39,237 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 14:10:39,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 14:10:39,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 14:10:39,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 14:10:39,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 14:10:39,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 14:10:39,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 14:10:39,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 14:10:39,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 14:10:39,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 14:10:39,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 14:10:39,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 14:10:39,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 14:10:39,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 14:10:39,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 14:10:39,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 14:10:39,250 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 14:10:39,272 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 14:10:39,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 14:10:39,272 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 14:10:39,272 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 14:10:39,273 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 14:10:39,273 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 14:10:39,273 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 14:10:39,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 14:10:39,274 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 14:10:39,274 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 14:10:39,274 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 14:10:39,275 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 14:10:39,275 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 14:10:39,275 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 14:10:39,275 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 14:10:39,275 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 14:10:39,275 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 14:10:39,275 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 14:10:39,275 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 14:10:39,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 14:10:39,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 14:10:39,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:10:39,276 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 14:10:39,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 14:10:39,276 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 14:10:39,276 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 14:10:39,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 14:10:39,276 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 14:10:39,276 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 14:10:39,277 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 14:10:39,277 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 14:10:39,277 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 14:10:39,278 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 14:10:39,278 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 14:10:39,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 14:10:39,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 14:10:39,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 14:10:39,452 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 14:10:39,455 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 14:10:39,456 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.09.cil-2.c [2022-01-10 14:10:39,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19cb17f16/fb8d4b98a7114ff58ba04f83f348fb53/FLAG1307f27c2 [2022-01-10 14:10:39,949 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 14:10:39,950 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_1.cil-2+token_ring.09.cil-2.c [2022-01-10 14:10:39,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19cb17f16/fb8d4b98a7114ff58ba04f83f348fb53/FLAG1307f27c2 [2022-01-10 14:10:39,966 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19cb17f16/fb8d4b98a7114ff58ba04f83f348fb53 [2022-01-10 14:10:39,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 14:10:39,969 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 14:10:39,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 14:10:39,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 14:10:39,976 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 14:10:39,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:10:39" (1/1) ... [2022-01-10 14:10:39,977 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2639a707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:39, skipping insertion in model container [2022-01-10 14:10:39,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:10:39" (1/1) ... [2022-01-10 14:10:39,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 14:10:40,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 14:10:40,214 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.09.cil-2.c[913,926] [2022-01-10 14:10:40,251 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.09.cil-2.c[5977,5990] [2022-01-10 14:10:40,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:10:40,347 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 14:10:40,356 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.09.cil-2.c[913,926] [2022-01-10 14:10:40,377 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.09.cil-2.c[5977,5990] [2022-01-10 14:10:40,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 14:10:40,449 INFO L208 MainTranslator]: Completed translation [2022-01-10 14:10:40,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:40 WrapperNode [2022-01-10 14:10:40,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 14:10:40,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 14:10:40,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 14:10:40,451 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 14:10:40,457 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:40" (1/1) ... [2022-01-10 14:10:40,484 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:40" (1/1) ... [2022-01-10 14:10:40,557 INFO L137 Inliner]: procedures = 67, calls = 76, calls flagged for inlining = 71, calls inlined = 202, statements flattened = 3022 [2022-01-10 14:10:40,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 14:10:40,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 14:10:40,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 14:10:40,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 14:10:40,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:40" (1/1) ... [2022-01-10 14:10:40,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:40" (1/1) ... [2022-01-10 14:10:40,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:40" (1/1) ... [2022-01-10 14:10:40,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:40" (1/1) ... [2022-01-10 14:10:40,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:40" (1/1) ... [2022-01-10 14:10:40,638 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:40" (1/1) ... [2022-01-10 14:10:40,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:40" (1/1) ... [2022-01-10 14:10:40,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 14:10:40,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 14:10:40,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 14:10:40,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 14:10:40,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:40" (1/1) ... [2022-01-10 14:10:40,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 14:10:40,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:10:40,694 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 14:10:40,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 14:10:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 14:10:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 14:10:40,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 14:10:40,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 14:10:40,870 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 14:10:40,871 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 14:10:42,041 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 14:10:42,059 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 14:10:42,059 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-01-10 14:10:42,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:10:42 BoogieIcfgContainer [2022-01-10 14:10:42,062 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 14:10:42,063 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 14:10:42,063 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 14:10:42,064 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 14:10:42,066 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:10:42" (1/1) ... [2022-01-10 14:10:42,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:10:42 BasicIcfg [2022-01-10 14:10:42,311 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 14:10:42,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 14:10:42,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 14:10:42,314 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 14:10:42,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:10:39" (1/4) ... [2022-01-10 14:10:42,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562846f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:10:42, skipping insertion in model container [2022-01-10 14:10:42,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:10:40" (2/4) ... [2022-01-10 14:10:42,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562846f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:10:42, skipping insertion in model container [2022-01-10 14:10:42,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:10:42" (3/4) ... [2022-01-10 14:10:42,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562846f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 02:10:42, skipping insertion in model container [2022-01-10 14:10:42,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 02:10:42" (4/4) ... [2022-01-10 14:10:42,316 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.09.cil-2.cTransformedIcfg [2022-01-10 14:10:42,320 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 14:10:42,320 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-10 14:10:42,361 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 14:10:42,365 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 14:10:42,366 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-10 14:10:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 1264 states, 1259 states have (on average 1.5162827640984908) internal successors, (1909), 1263 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-10 14:10:42,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-10 14:10:42,400 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:42,400 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:42,401 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-10 14:10:42,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:42,405 INFO L85 PathProgramCache]: Analyzing trace with hash -260266145, now seen corresponding path program 1 times [2022-01-10 14:10:42,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:42,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388193559] [2022-01-10 14:10:42,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:42,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:42,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:42,685 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:42,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388193559] [2022-01-10 14:10:42,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388193559] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:42,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:42,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:42,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676154967] [2022-01-10 14:10:42,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:42,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:42,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:42,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:42,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:42,756 INFO L87 Difference]: Start difference. First operand has 1264 states, 1259 states have (on average 1.5162827640984908) internal successors, (1909), 1263 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) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:42,877 INFO L93 Difference]: Finished difference Result 2462 states and 3703 transitions. [2022-01-10 14:10:42,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:42,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-10 14:10:42,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:42,897 INFO L225 Difference]: With dead ends: 2462 [2022-01-10 14:10:42,897 INFO L226 Difference]: Without dead ends: 1318 [2022-01-10 14:10:42,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:42,910 INFO L933 BasicCegarLoop]: 1879 mSDtfsCounter, 1840 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1840 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:42,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1840 Valid, 1973 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:42,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2022-01-10 14:10:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1297. [2022-01-10 14:10:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1297 states, 1293 states have (on average 1.48569218870843) internal successors, (1921), 1296 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:42,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1921 transitions. [2022-01-10 14:10:42,990 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1921 transitions. Word has length 36 [2022-01-10 14:10:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:42,991 INFO L470 AbstractCegarLoop]: Abstraction has 1297 states and 1921 transitions. [2022-01-10 14:10:42,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1921 transitions. [2022-01-10 14:10:42,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 14:10:42,996 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:42,996 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:42,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 14:10:42,996 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-10 14:10:42,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:42,998 INFO L85 PathProgramCache]: Analyzing trace with hash -2014701239, now seen corresponding path program 1 times [2022-01-10 14:10:42,999 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:42,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472310670] [2022-01-10 14:10:42,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:42,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:43,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:43,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472310670] [2022-01-10 14:10:43,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472310670] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:43,084 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:43,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:43,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911703160] [2022-01-10 14:10:43,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:43,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:43,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:43,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:43,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:43,090 INFO L87 Difference]: Start difference. First operand 1297 states and 1921 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:43,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:43,123 INFO L93 Difference]: Finished difference Result 1466 states and 2156 transitions. [2022-01-10 14:10:43,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:43,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-01-10 14:10:43,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:43,131 INFO L225 Difference]: With dead ends: 1466 [2022-01-10 14:10:43,131 INFO L226 Difference]: Without dead ends: 1355 [2022-01-10 14:10:43,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:43,132 INFO L933 BasicCegarLoop]: 1859 mSDtfsCounter, 60 mSDsluCounter, 1820 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 3679 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:43,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 3679 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:43,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-01-10 14:10:43,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1350. [2022-01-10 14:10:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1346 states have (on average 1.4814264487369986) internal successors, (1994), 1349 states have internal predecessors, (1994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:43,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1994 transitions. [2022-01-10 14:10:43,153 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1994 transitions. Word has length 37 [2022-01-10 14:10:43,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:43,154 INFO L470 AbstractCegarLoop]: Abstraction has 1350 states and 1994 transitions. [2022-01-10 14:10:43,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1994 transitions. [2022-01-10 14:10:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 14:10:43,159 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:43,159 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:43,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 14:10:43,163 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-10 14:10:43,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:43,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2125969224, now seen corresponding path program 1 times [2022-01-10 14:10:43,163 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:43,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221345259] [2022-01-10 14:10:43,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:43,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:43,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:43,213 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:43,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221345259] [2022-01-10 14:10:43,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221345259] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:43,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:43,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:43,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409302582] [2022-01-10 14:10:43,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:43,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:43,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:43,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:43,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:43,245 INFO L87 Difference]: Start difference. First operand 1350 states and 1994 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:43,285 INFO L93 Difference]: Finished difference Result 1667 states and 2430 transitions. [2022-01-10 14:10:43,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:43,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-01-10 14:10:43,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:43,290 INFO L225 Difference]: With dead ends: 1667 [2022-01-10 14:10:43,290 INFO L226 Difference]: Without dead ends: 1503 [2022-01-10 14:10:43,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:43,295 INFO L933 BasicCegarLoop]: 1882 mSDtfsCounter, 1831 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1831 SdHoareTripleChecker+Valid, 1970 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:43,296 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1831 Valid, 1970 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2022-01-10 14:10:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1481. [2022-01-10 14:10:43,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1481 states, 1477 states have (on average 1.4691943127962086) internal successors, (2170), 1480 states have internal predecessors, (2170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:43,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2170 transitions. [2022-01-10 14:10:43,325 INFO L78 Accepts]: Start accepts. Automaton has 1481 states and 2170 transitions. Word has length 37 [2022-01-10 14:10:43,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:43,325 INFO L470 AbstractCegarLoop]: Abstraction has 1481 states and 2170 transitions. [2022-01-10 14:10:43,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:43,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1481 states and 2170 transitions. [2022-01-10 14:10:43,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 14:10:43,327 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:43,328 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:43,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 14:10:43,328 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-10 14:10:43,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:43,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1284966479, now seen corresponding path program 1 times [2022-01-10 14:10:43,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:43,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210218357] [2022-01-10 14:10:43,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:43,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:43,389 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:43,389 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:43,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210218357] [2022-01-10 14:10:43,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210218357] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:43,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:43,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:43,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411477660] [2022-01-10 14:10:43,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:43,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:43,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:43,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:43,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:43,392 INFO L87 Difference]: Start difference. First operand 1481 states and 2170 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:43,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:43,436 INFO L93 Difference]: Finished difference Result 1932 states and 2777 transitions. [2022-01-10 14:10:43,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:43,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-10 14:10:43,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:43,441 INFO L225 Difference]: With dead ends: 1932 [2022-01-10 14:10:43,441 INFO L226 Difference]: Without dead ends: 1637 [2022-01-10 14:10:43,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:43,446 INFO L933 BasicCegarLoop]: 1912 mSDtfsCounter, 48 mSDsluCounter, 1847 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3759 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-10 14:10:43,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 3759 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:43,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2022-01-10 14:10:43,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1637. [2022-01-10 14:10:43,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1637 states, 1633 states have (on average 1.443968156766687) internal successors, (2358), 1636 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:43,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 2358 transitions. [2022-01-10 14:10:43,477 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 2358 transitions. Word has length 51 [2022-01-10 14:10:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:43,477 INFO L470 AbstractCegarLoop]: Abstraction has 1637 states and 2358 transitions. [2022-01-10 14:10:43,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 2358 transitions. [2022-01-10 14:10:43,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-10 14:10:43,478 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:43,478 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:43,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 14:10:43,478 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-10 14:10:43,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:43,479 INFO L85 PathProgramCache]: Analyzing trace with hash -879825757, now seen corresponding path program 1 times [2022-01-10 14:10:43,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:43,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451383669] [2022-01-10 14:10:43,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:43,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:43,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:43,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451383669] [2022-01-10 14:10:43,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451383669] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:43,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:43,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:43,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266043831] [2022-01-10 14:10:43,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:43,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:43,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:43,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:43,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:43,541 INFO L87 Difference]: Start difference. First operand 1637 states and 2358 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:43,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:43,589 INFO L93 Difference]: Finished difference Result 2110 states and 2974 transitions. [2022-01-10 14:10:43,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:43,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-01-10 14:10:43,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:43,595 INFO L225 Difference]: With dead ends: 2110 [2022-01-10 14:10:43,595 INFO L226 Difference]: Without dead ends: 1745 [2022-01-10 14:10:43,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:43,596 INFO L933 BasicCegarLoop]: 1859 mSDtfsCounter, 1805 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1805 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:43,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1805 Valid, 1947 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:43,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2022-01-10 14:10:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1745. [2022-01-10 14:10:43,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1745 states, 1741 states have (on average 1.427914991384262) internal successors, (2486), 1744 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:43,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1745 states to 1745 states and 2486 transitions. [2022-01-10 14:10:43,635 INFO L78 Accepts]: Start accepts. Automaton has 1745 states and 2486 transitions. Word has length 55 [2022-01-10 14:10:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:43,637 INFO L470 AbstractCegarLoop]: Abstraction has 1745 states and 2486 transitions. [2022-01-10 14:10:43,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:43,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2486 transitions. [2022-01-10 14:10:43,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 14:10:43,640 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:43,640 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:43,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 14:10:43,641 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-10 14:10:43,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:43,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1271876383, now seen corresponding path program 1 times [2022-01-10 14:10:43,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:43,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456297645] [2022-01-10 14:10:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:43,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:43,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:43,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:43,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456297645] [2022-01-10 14:10:43,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456297645] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:43,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:43,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:10:43,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050468477] [2022-01-10 14:10:43,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:43,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:10:43,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:43,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:10:43,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:10:43,746 INFO L87 Difference]: Start difference. First operand 1745 states and 2486 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:43,861 INFO L93 Difference]: Finished difference Result 2828 states and 3890 transitions. [2022-01-10 14:10:43,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:10:43,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-10 14:10:43,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:43,867 INFO L225 Difference]: With dead ends: 2828 [2022-01-10 14:10:43,867 INFO L226 Difference]: Without dead ends: 2405 [2022-01-10 14:10:43,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:10:43,869 INFO L933 BasicCegarLoop]: 1932 mSDtfsCounter, 302 mSDsluCounter, 5714 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 7646 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:43,869 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 7646 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:43,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2022-01-10 14:10:43,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 1769. [2022-01-10 14:10:43,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1765 states have (on average 1.4198300283286118) internal successors, (2506), 1768 states have internal predecessors, (2506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:43,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2506 transitions. [2022-01-10 14:10:43,913 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2506 transitions. Word has length 56 [2022-01-10 14:10:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:43,914 INFO L470 AbstractCegarLoop]: Abstraction has 1769 states and 2506 transitions. [2022-01-10 14:10:43,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2506 transitions. [2022-01-10 14:10:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 14:10:43,915 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:43,915 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:43,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 14:10:43,915 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-10 14:10:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:43,916 INFO L85 PathProgramCache]: Analyzing trace with hash -921076446, now seen corresponding path program 1 times [2022-01-10 14:10:43,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:43,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230740597] [2022-01-10 14:10:43,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:43,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:43,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:43,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:43,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230740597] [2022-01-10 14:10:43,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230740597] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:43,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:43,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:10:43,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793014179] [2022-01-10 14:10:43,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:43,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:10:43,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:43,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:10:43,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:10:43,979 INFO L87 Difference]: Start difference. First operand 1769 states and 2506 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:44,080 INFO L93 Difference]: Finished difference Result 2558 states and 3516 transitions. [2022-01-10 14:10:44,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:10:44,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-10 14:10:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:44,086 INFO L225 Difference]: With dead ends: 2558 [2022-01-10 14:10:44,086 INFO L226 Difference]: Without dead ends: 2060 [2022-01-10 14:10:44,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:10:44,089 INFO L933 BasicCegarLoop]: 1909 mSDtfsCounter, 276 mSDsluCounter, 5683 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 7592 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:44,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 7592 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2022-01-10 14:10:44,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1667. [2022-01-10 14:10:44,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1667 states, 1663 states have (on average 1.428141912206855) internal successors, (2375), 1666 states have internal predecessors, (2375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:44,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1667 states to 1667 states and 2375 transitions. [2022-01-10 14:10:44,184 INFO L78 Accepts]: Start accepts. Automaton has 1667 states and 2375 transitions. Word has length 56 [2022-01-10 14:10:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:44,185 INFO L470 AbstractCegarLoop]: Abstraction has 1667 states and 2375 transitions. [2022-01-10 14:10:44,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:44,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1667 states and 2375 transitions. [2022-01-10 14:10:44,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 14:10:44,186 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:44,186 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:44,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 14:10:44,186 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-10 14:10:44,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:44,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1296711298, now seen corresponding path program 1 times [2022-01-10 14:10:44,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:44,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313882112] [2022-01-10 14:10:44,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:44,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:44,279 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:44,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313882112] [2022-01-10 14:10:44,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313882112] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:44,279 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:44,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 14:10:44,280 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231604631] [2022-01-10 14:10:44,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:44,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 14:10:44,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:44,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 14:10:44,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 14:10:44,281 INFO L87 Difference]: Start difference. First operand 1667 states and 2375 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:44,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:44,385 INFO L93 Difference]: Finished difference Result 1717 states and 2435 transitions. [2022-01-10 14:10:44,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 14:10:44,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-10 14:10:44,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:44,391 INFO L225 Difference]: With dead ends: 1717 [2022-01-10 14:10:44,391 INFO L226 Difference]: Without dead ends: 1715 [2022-01-10 14:10:44,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:10:44,392 INFO L933 BasicCegarLoop]: 1859 mSDtfsCounter, 3686 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3686 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:44,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3686 Valid, 1928 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:44,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2022-01-10 14:10:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1665. [2022-01-10 14:10:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1662 states have (on average 1.4271961492178098) internal successors, (2372), 1664 states have internal predecessors, (2372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:44,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2372 transitions. [2022-01-10 14:10:44,475 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2372 transitions. Word has length 56 [2022-01-10 14:10:44,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:44,475 INFO L470 AbstractCegarLoop]: Abstraction has 1665 states and 2372 transitions. [2022-01-10 14:10:44,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:44,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2372 transitions. [2022-01-10 14:10:44,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-10 14:10:44,476 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:44,477 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:44,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 14:10:44,477 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-10 14:10:44,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:44,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1543348451, now seen corresponding path program 1 times [2022-01-10 14:10:44,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:44,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829867413] [2022-01-10 14:10:44,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:44,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:44,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:44,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829867413] [2022-01-10 14:10:44,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829867413] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 14:10:44,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673636189] [2022-01-10 14:10:44,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:44,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 14:10:44,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 14:10:44,658 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 14:10:44,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 14:10:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:44,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 14:10:44,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 14:10:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:45,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 14:10:45,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:45,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673636189] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 14:10:45,363 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 14:10:45,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-10 14:10:45,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151318683] [2022-01-10 14:10:45,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 14:10:45,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 14:10:45,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:45,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 14:10:45,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:10:45,364 INFO L87 Difference]: Start difference. First operand 1665 states and 2372 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:45,633 INFO L93 Difference]: Finished difference Result 2551 states and 3500 transitions. [2022-01-10 14:10:45,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 14:10:45,636 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-01-10 14:10:45,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:45,644 INFO L225 Difference]: With dead ends: 2551 [2022-01-10 14:10:45,644 INFO L226 Difference]: Without dead ends: 2549 [2022-01-10 14:10:45,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 14:10:45,646 INFO L933 BasicCegarLoop]: 1934 mSDtfsCounter, 3886 mSDsluCounter, 6137 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3886 SdHoareTripleChecker+Valid, 8071 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:45,646 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3886 Valid, 8071 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:45,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2022-01-10 14:10:45,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 1937. [2022-01-10 14:10:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1937 states, 1934 states have (on average 1.40899689762151) internal successors, (2725), 1936 states have internal predecessors, (2725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:45,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 2725 transitions. [2022-01-10 14:10:45,795 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 2725 transitions. Word has length 57 [2022-01-10 14:10:45,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:45,797 INFO L470 AbstractCegarLoop]: Abstraction has 1937 states and 2725 transitions. [2022-01-10 14:10:45,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:45,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 2725 transitions. [2022-01-10 14:10:45,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 14:10:45,799 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:45,799 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:45,824 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-10 14:10:46,007 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-10 14:10:46,008 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-10 14:10:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:46,008 INFO L85 PathProgramCache]: Analyzing trace with hash -410148906, now seen corresponding path program 2 times [2022-01-10 14:10:46,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:46,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689164272] [2022-01-10 14:10:46,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:46,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:46,045 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:46,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689164272] [2022-01-10 14:10:46,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689164272] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:46,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:46,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:46,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387791605] [2022-01-10 14:10:46,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:46,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:46,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:46,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:46,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:46,046 INFO L87 Difference]: Start difference. First operand 1937 states and 2725 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:46,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:46,137 INFO L93 Difference]: Finished difference Result 2444 states and 3385 transitions. [2022-01-10 14:10:46,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:46,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-01-10 14:10:46,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:46,143 INFO L225 Difference]: With dead ends: 2444 [2022-01-10 14:10:46,143 INFO L226 Difference]: Without dead ends: 1848 [2022-01-10 14:10:46,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:46,145 INFO L933 BasicCegarLoop]: 1893 mSDtfsCounter, 1809 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1809 SdHoareTripleChecker+Valid, 1962 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:46,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1809 Valid, 1962 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:46,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2022-01-10 14:10:46,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1822. [2022-01-10 14:10:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1819 states have (on average 1.4145134689389776) internal successors, (2573), 1821 states have internal predecessors, (2573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2573 transitions. [2022-01-10 14:10:46,238 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2573 transitions. Word has length 72 [2022-01-10 14:10:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:46,238 INFO L470 AbstractCegarLoop]: Abstraction has 1822 states and 2573 transitions. [2022-01-10 14:10:46,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2573 transitions. [2022-01-10 14:10:46,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-01-10 14:10:46,243 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:46,244 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:46,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 14:10:46,244 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-10 14:10:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash -411874258, now seen corresponding path program 1 times [2022-01-10 14:10:46,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:46,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806074991] [2022-01-10 14:10:46,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:46,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:10:46,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:46,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806074991] [2022-01-10 14:10:46,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806074991] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:46,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:46,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:46,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545584021] [2022-01-10 14:10:46,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:46,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:46,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:46,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:46,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:46,299 INFO L87 Difference]: Start difference. First operand 1822 states and 2573 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:46,398 INFO L93 Difference]: Finished difference Result 2476 states and 3400 transitions. [2022-01-10 14:10:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:46,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2022-01-10 14:10:46,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:46,404 INFO L225 Difference]: With dead ends: 2476 [2022-01-10 14:10:46,404 INFO L226 Difference]: Without dead ends: 1840 [2022-01-10 14:10:46,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:46,405 INFO L933 BasicCegarLoop]: 1866 mSDtfsCounter, 1794 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1794 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:46,405 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1794 Valid, 1950 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2022-01-10 14:10:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1822. [2022-01-10 14:10:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1819 states have (on average 1.4035184167124795) internal successors, (2553), 1821 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2553 transitions. [2022-01-10 14:10:46,495 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2553 transitions. Word has length 84 [2022-01-10 14:10:46,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:46,495 INFO L470 AbstractCegarLoop]: Abstraction has 1822 states and 2553 transitions. [2022-01-10 14:10:46,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2553 transitions. [2022-01-10 14:10:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-10 14:10:46,496 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:46,496 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:46,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 14:10:46,497 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-10 14:10:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:46,497 INFO L85 PathProgramCache]: Analyzing trace with hash -971551542, now seen corresponding path program 1 times [2022-01-10 14:10:46,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:46,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160118093] [2022-01-10 14:10:46,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:46,497 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:46,532 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 14:10:46,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:46,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160118093] [2022-01-10 14:10:46,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160118093] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:46,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:46,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:46,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031650662] [2022-01-10 14:10:46,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:46,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:46,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:46,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:46,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:46,533 INFO L87 Difference]: Start difference. First operand 1822 states and 2553 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:46,602 INFO L93 Difference]: Finished difference Result 2086 states and 2871 transitions. [2022-01-10 14:10:46,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:46,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-01-10 14:10:46,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:46,606 INFO L225 Difference]: With dead ends: 2086 [2022-01-10 14:10:46,606 INFO L226 Difference]: Without dead ends: 1180 [2022-01-10 14:10:46,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:46,608 INFO L933 BasicCegarLoop]: 1892 mSDtfsCounter, 56 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3716 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:46,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 3716 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:46,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-01-10 14:10:46,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2022-01-10 14:10:46,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1178 states have (on average 1.4915110356536503) internal successors, (1757), 1179 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1757 transitions. [2022-01-10 14:10:46,642 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1757 transitions. Word has length 85 [2022-01-10 14:10:46,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:46,642 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 1757 transitions. [2022-01-10 14:10:46,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:46,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1757 transitions. [2022-01-10 14:10:46,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:46,643 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:46,643 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:46,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 14:10:46,643 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-10 14:10:46,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:46,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1484531064, now seen corresponding path program 1 times [2022-01-10 14:10:46,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:46,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106321563] [2022-01-10 14:10:46,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:46,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:46,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:46,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:46,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106321563] [2022-01-10 14:10:46,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106321563] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:46,677 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:46,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:46,677 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374148110] [2022-01-10 14:10:46,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:46,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:46,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:46,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:46,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:46,678 INFO L87 Difference]: Start difference. First operand 1180 states and 1757 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:46,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:46,724 INFO L93 Difference]: Finished difference Result 2347 states and 3493 transitions. [2022-01-10 14:10:46,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:46,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:46,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:46,728 INFO L225 Difference]: With dead ends: 2347 [2022-01-10 14:10:46,728 INFO L226 Difference]: Without dead ends: 1180 [2022-01-10 14:10:46,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:46,731 INFO L933 BasicCegarLoop]: 1755 mSDtfsCounter, 1744 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1744 SdHoareTripleChecker+Valid, 1756 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:46,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1744 Valid, 1756 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2022-01-10 14:10:46,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2022-01-10 14:10:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1178 states have (on average 1.4906621392190154) internal successors, (1756), 1179 states have internal predecessors, (1756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:46,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1756 transitions. [2022-01-10 14:10:46,769 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1756 transitions. Word has length 132 [2022-01-10 14:10:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:46,769 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 1756 transitions. [2022-01-10 14:10:46,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1756 transitions. [2022-01-10 14:10:46,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:46,770 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:46,770 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:46,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 14:10:46,771 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-10 14:10:46,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:46,771 INFO L85 PathProgramCache]: Analyzing trace with hash -116634983, now seen corresponding path program 1 times [2022-01-10 14:10:46,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:46,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208352575] [2022-01-10 14:10:46,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:46,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:46,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:46,812 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:46,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208352575] [2022-01-10 14:10:46,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208352575] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:46,813 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:46,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:46,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292145890] [2022-01-10 14:10:46,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:46,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:46,813 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:46,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:46,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:46,814 INFO L87 Difference]: Start difference. First operand 1180 states and 1756 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:46,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:46,919 INFO L93 Difference]: Finished difference Result 3323 states and 4931 transitions. [2022-01-10 14:10:46,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:46,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:46,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:46,926 INFO L225 Difference]: With dead ends: 3323 [2022-01-10 14:10:46,927 INFO L226 Difference]: Without dead ends: 2160 [2022-01-10 14:10:46,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:46,930 INFO L933 BasicCegarLoop]: 1750 mSDtfsCounter, 1632 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 3292 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:46,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1632 Valid, 3292 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:46,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2022-01-10 14:10:47,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2156. [2022-01-10 14:10:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4837511606313836) internal successors, (3196), 2155 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3196 transitions. [2022-01-10 14:10:47,020 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3196 transitions. Word has length 132 [2022-01-10 14:10:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:47,021 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3196 transitions. [2022-01-10 14:10:47,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3196 transitions. [2022-01-10 14:10:47,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:47,022 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:47,022 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:47,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 14:10:47,022 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-10 14:10:47,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:47,022 INFO L85 PathProgramCache]: Analyzing trace with hash -704959303, now seen corresponding path program 1 times [2022-01-10 14:10:47,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:47,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055855252] [2022-01-10 14:10:47,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:47,023 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:47,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:47,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055855252] [2022-01-10 14:10:47,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055855252] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:47,054 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:47,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:47,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134600554] [2022-01-10 14:10:47,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:47,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:47,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:47,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:47,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:47,056 INFO L87 Difference]: Start difference. First operand 2156 states and 3196 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:47,138 INFO L93 Difference]: Finished difference Result 4294 states and 6364 transitions. [2022-01-10 14:10:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:47,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:47,145 INFO L225 Difference]: With dead ends: 4294 [2022-01-10 14:10:47,145 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:47,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:47,148 INFO L933 BasicCegarLoop]: 1744 mSDtfsCounter, 1732 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:47,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1732 Valid, 1744 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:47,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:47,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:47,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4800371402042711) internal successors, (3188), 2155 states have internal predecessors, (3188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3188 transitions. [2022-01-10 14:10:47,231 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3188 transitions. Word has length 132 [2022-01-10 14:10:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:47,231 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3188 transitions. [2022-01-10 14:10:47,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3188 transitions. [2022-01-10 14:10:47,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:47,232 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:47,232 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:47,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 14:10:47,232 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-10 14:10:47,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:47,233 INFO L85 PathProgramCache]: Analyzing trace with hash -862484839, now seen corresponding path program 1 times [2022-01-10 14:10:47,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:47,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797855246] [2022-01-10 14:10:47,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:47,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:47,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:47,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797855246] [2022-01-10 14:10:47,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797855246] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:47,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:47,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:47,266 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559321982] [2022-01-10 14:10:47,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:47,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:47,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:47,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:47,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:47,267 INFO L87 Difference]: Start difference. First operand 2156 states and 3188 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:47,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:47,389 INFO L93 Difference]: Finished difference Result 4293 states and 6347 transitions. [2022-01-10 14:10:47,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:47,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:47,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:47,394 INFO L225 Difference]: With dead ends: 4293 [2022-01-10 14:10:47,394 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:47,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:47,397 INFO L933 BasicCegarLoop]: 1739 mSDtfsCounter, 1726 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:47,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1726 Valid, 1739 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:47,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:47,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4763231197771587) internal successors, (3180), 2155 states have internal predecessors, (3180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3180 transitions. [2022-01-10 14:10:47,473 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3180 transitions. Word has length 132 [2022-01-10 14:10:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:47,473 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3180 transitions. [2022-01-10 14:10:47,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3180 transitions. [2022-01-10 14:10:47,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:47,474 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:47,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:47,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 14:10:47,474 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-10 14:10:47,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:47,475 INFO L85 PathProgramCache]: Analyzing trace with hash 102265017, now seen corresponding path program 1 times [2022-01-10 14:10:47,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:47,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795834407] [2022-01-10 14:10:47,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:47,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:47,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:47,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795834407] [2022-01-10 14:10:47,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795834407] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:47,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:47,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:47,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847151339] [2022-01-10 14:10:47,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:47,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:47,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:47,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:47,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:47,509 INFO L87 Difference]: Start difference. First operand 2156 states and 3180 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:47,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:47,617 INFO L93 Difference]: Finished difference Result 4292 states and 6330 transitions. [2022-01-10 14:10:47,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:47,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:47,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:47,620 INFO L225 Difference]: With dead ends: 4292 [2022-01-10 14:10:47,620 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:47,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:47,623 INFO L933 BasicCegarLoop]: 1734 mSDtfsCounter, 1720 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1720 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:47,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1720 Valid, 1734 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:47,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:47,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4726090993500465) internal successors, (3172), 2155 states have internal predecessors, (3172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3172 transitions. [2022-01-10 14:10:47,690 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3172 transitions. Word has length 132 [2022-01-10 14:10:47,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:47,691 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3172 transitions. [2022-01-10 14:10:47,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3172 transitions. [2022-01-10 14:10:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:47,691 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:47,692 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:47,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 14:10:47,692 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-10 14:10:47,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:47,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1103217305, now seen corresponding path program 1 times [2022-01-10 14:10:47,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:47,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365032701] [2022-01-10 14:10:47,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:47,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:47,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:47,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365032701] [2022-01-10 14:10:47,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365032701] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:47,721 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:47,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:47,721 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400993905] [2022-01-10 14:10:47,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:47,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:47,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:47,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:47,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:47,722 INFO L87 Difference]: Start difference. First operand 2156 states and 3172 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:47,822 INFO L93 Difference]: Finished difference Result 4291 states and 6313 transitions. [2022-01-10 14:10:47,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:47,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:47,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:47,825 INFO L225 Difference]: With dead ends: 4291 [2022-01-10 14:10:47,825 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:47,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:47,827 INFO L933 BasicCegarLoop]: 1729 mSDtfsCounter, 1714 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:47,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1714 Valid, 1729 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:47,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:47,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.468895078922934) internal successors, (3164), 2155 states have internal predecessors, (3164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3164 transitions. [2022-01-10 14:10:47,899 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3164 transitions. Word has length 132 [2022-01-10 14:10:47,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:47,899 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3164 transitions. [2022-01-10 14:10:47,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3164 transitions. [2022-01-10 14:10:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:47,901 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:47,901 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:47,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 14:10:47,901 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-10 14:10:47,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:47,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1689695417, now seen corresponding path program 1 times [2022-01-10 14:10:47,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:47,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282178676] [2022-01-10 14:10:47,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:47,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:47,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:47,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282178676] [2022-01-10 14:10:47,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282178676] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:47,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:47,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:47,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377431842] [2022-01-10 14:10:47,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:47,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:47,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:47,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:47,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:47,932 INFO L87 Difference]: Start difference. First operand 2156 states and 3164 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:48,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:48,010 INFO L93 Difference]: Finished difference Result 4290 states and 6296 transitions. [2022-01-10 14:10:48,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:48,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:48,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:48,014 INFO L225 Difference]: With dead ends: 4290 [2022-01-10 14:10:48,014 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:48,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:48,016 INFO L933 BasicCegarLoop]: 1724 mSDtfsCounter, 1708 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:48,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1708 Valid, 1724 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:48,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4651810584958218) internal successors, (3156), 2155 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:48,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3156 transitions. [2022-01-10 14:10:48,089 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3156 transitions. Word has length 132 [2022-01-10 14:10:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:48,089 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3156 transitions. [2022-01-10 14:10:48,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:48,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3156 transitions. [2022-01-10 14:10:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:48,090 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:48,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:48,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 14:10:48,091 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-10 14:10:48,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:48,091 INFO L85 PathProgramCache]: Analyzing trace with hash 877330073, now seen corresponding path program 1 times [2022-01-10 14:10:48,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:48,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210474716] [2022-01-10 14:10:48,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:48,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:48,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:48,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210474716] [2022-01-10 14:10:48,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210474716] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:48,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:48,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:48,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413488370] [2022-01-10 14:10:48,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:48,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:48,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:48,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:48,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:48,134 INFO L87 Difference]: Start difference. First operand 2156 states and 3156 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:48,225 INFO L93 Difference]: Finished difference Result 4289 states and 6279 transitions. [2022-01-10 14:10:48,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:48,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:48,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:48,229 INFO L225 Difference]: With dead ends: 4289 [2022-01-10 14:10:48,229 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:48,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:48,232 INFO L933 BasicCegarLoop]: 1719 mSDtfsCounter, 1702 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1702 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:48,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1702 Valid, 1719 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:48,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4614670380687094) internal successors, (3148), 2155 states have internal predecessors, (3148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:48,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3148 transitions. [2022-01-10 14:10:48,314 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3148 transitions. Word has length 132 [2022-01-10 14:10:48,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:48,314 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3148 transitions. [2022-01-10 14:10:48,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3148 transitions. [2022-01-10 14:10:48,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:48,315 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:48,315 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:48,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 14:10:48,315 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-10 14:10:48,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:48,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1642727239, now seen corresponding path program 1 times [2022-01-10 14:10:48,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:48,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591588214] [2022-01-10 14:10:48,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:48,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:48,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:48,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591588214] [2022-01-10 14:10:48,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591588214] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:48,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:48,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:48,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269010600] [2022-01-10 14:10:48,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:48,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:48,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:48,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:48,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:48,346 INFO L87 Difference]: Start difference. First operand 2156 states and 3148 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:48,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:48,433 INFO L93 Difference]: Finished difference Result 4288 states and 6262 transitions. [2022-01-10 14:10:48,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:48,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:48,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:48,437 INFO L225 Difference]: With dead ends: 4288 [2022-01-10 14:10:48,438 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:48,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:48,440 INFO L933 BasicCegarLoop]: 1714 mSDtfsCounter, 1696 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:48,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1696 Valid, 1714 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:48,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:48,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.457753017641597) internal successors, (3140), 2155 states have internal predecessors, (3140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3140 transitions. [2022-01-10 14:10:48,545 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3140 transitions. Word has length 132 [2022-01-10 14:10:48,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:48,545 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3140 transitions. [2022-01-10 14:10:48,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:48,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3140 transitions. [2022-01-10 14:10:48,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:48,546 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:48,546 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:48,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 14:10:48,547 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-10 14:10:48,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:48,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1878211225, now seen corresponding path program 1 times [2022-01-10 14:10:48,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:48,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389603896] [2022-01-10 14:10:48,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:48,547 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:48,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:48,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389603896] [2022-01-10 14:10:48,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389603896] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:48,575 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:48,575 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:48,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679531011] [2022-01-10 14:10:48,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:48,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:48,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:48,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:48,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:48,576 INFO L87 Difference]: Start difference. First operand 2156 states and 3140 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:48,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:48,673 INFO L93 Difference]: Finished difference Result 4287 states and 6245 transitions. [2022-01-10 14:10:48,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:48,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:48,677 INFO L225 Difference]: With dead ends: 4287 [2022-01-10 14:10:48,677 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:48,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:48,681 INFO L933 BasicCegarLoop]: 1709 mSDtfsCounter, 1690 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:48,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1690 Valid, 1709 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:48,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:48,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:48,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4540389972144847) internal successors, (3132), 2155 states have internal predecessors, (3132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:48,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3132 transitions. [2022-01-10 14:10:48,764 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3132 transitions. Word has length 132 [2022-01-10 14:10:48,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:48,764 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3132 transitions. [2022-01-10 14:10:48,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3132 transitions. [2022-01-10 14:10:48,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:48,765 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:48,765 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:48,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 14:10:48,766 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-10 14:10:48,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:48,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1853242553, now seen corresponding path program 1 times [2022-01-10 14:10:48,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:48,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072754969] [2022-01-10 14:10:48,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:48,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:48,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:48,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:48,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072754969] [2022-01-10 14:10:48,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072754969] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:48,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:48,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:48,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785471982] [2022-01-10 14:10:48,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:48,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:48,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:48,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:48,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:48,801 INFO L87 Difference]: Start difference. First operand 2156 states and 3132 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:48,941 INFO L93 Difference]: Finished difference Result 4286 states and 6228 transitions. [2022-01-10 14:10:48,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:48,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:48,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:48,945 INFO L225 Difference]: With dead ends: 4286 [2022-01-10 14:10:48,945 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:48,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:48,948 INFO L933 BasicCegarLoop]: 1704 mSDtfsCounter, 1684 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 1704 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:48,948 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1684 Valid, 1704 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:48,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:49,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4503249767873723) internal successors, (3124), 2155 states have internal predecessors, (3124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3124 transitions. [2022-01-10 14:10:49,070 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3124 transitions. Word has length 132 [2022-01-10 14:10:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:49,070 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3124 transitions. [2022-01-10 14:10:49,070 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3124 transitions. [2022-01-10 14:10:49,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:49,071 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:49,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:49,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 14:10:49,071 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-10 14:10:49,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:49,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1334151527, now seen corresponding path program 1 times [2022-01-10 14:10:49,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:49,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457144132] [2022-01-10 14:10:49,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:49,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:49,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:49,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457144132] [2022-01-10 14:10:49,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457144132] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:49,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:49,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:49,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500059666] [2022-01-10 14:10:49,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:49,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:49,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:49,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:49,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:49,100 INFO L87 Difference]: Start difference. First operand 2156 states and 3124 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:49,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:49,215 INFO L93 Difference]: Finished difference Result 4285 states and 6211 transitions. [2022-01-10 14:10:49,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:49,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:49,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:49,218 INFO L225 Difference]: With dead ends: 4285 [2022-01-10 14:10:49,218 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:49,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:49,221 INFO L933 BasicCegarLoop]: 1675 mSDtfsCounter, 1564 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 1773 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:49,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1564 Valid, 1773 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:49,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:49,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.436397400185701) internal successors, (3094), 2155 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3094 transitions. [2022-01-10 14:10:49,313 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3094 transitions. Word has length 132 [2022-01-10 14:10:49,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:49,314 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3094 transitions. [2022-01-10 14:10:49,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3094 transitions. [2022-01-10 14:10:49,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:49,315 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:49,315 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:49,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 14:10:49,315 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-10 14:10:49,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:49,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1776166968, now seen corresponding path program 1 times [2022-01-10 14:10:49,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:49,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529261693] [2022-01-10 14:10:49,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:49,316 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:49,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:49,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:49,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529261693] [2022-01-10 14:10:49,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529261693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:49,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:49,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:49,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534190796] [2022-01-10 14:10:49,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:49,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:49,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:49,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:49,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:49,378 INFO L87 Difference]: Start difference. First operand 2156 states and 3094 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:49,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:49,500 INFO L93 Difference]: Finished difference Result 4284 states and 6150 transitions. [2022-01-10 14:10:49,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:49,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:49,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:49,505 INFO L225 Difference]: With dead ends: 4284 [2022-01-10 14:10:49,505 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:49,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:49,508 INFO L933 BasicCegarLoop]: 1658 mSDtfsCounter, 1547 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:49,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1547 Valid, 1755 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:49,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4224698235840296) internal successors, (3064), 2155 states have internal predecessors, (3064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3064 transitions. [2022-01-10 14:10:49,606 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3064 transitions. Word has length 132 [2022-01-10 14:10:49,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:49,606 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3064 transitions. [2022-01-10 14:10:49,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:49,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3064 transitions. [2022-01-10 14:10:49,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:49,607 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:49,607 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:49,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 14:10:49,607 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-10 14:10:49,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:49,607 INFO L85 PathProgramCache]: Analyzing trace with hash 388320471, now seen corresponding path program 1 times [2022-01-10 14:10:49,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:49,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741781721] [2022-01-10 14:10:49,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:49,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:49,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:49,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:49,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741781721] [2022-01-10 14:10:49,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741781721] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:49,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:49,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:49,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304600963] [2022-01-10 14:10:49,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:49,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:49,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:49,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:49,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:49,640 INFO L87 Difference]: Start difference. First operand 2156 states and 3064 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:49,758 INFO L93 Difference]: Finished difference Result 4283 states and 6089 transitions. [2022-01-10 14:10:49,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:49,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:49,761 INFO L225 Difference]: With dead ends: 4283 [2022-01-10 14:10:49,762 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:49,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:49,764 INFO L933 BasicCegarLoop]: 1641 mSDtfsCounter, 1530 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:49,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1530 Valid, 1737 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:49,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:49,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:49,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.4085422469823583) internal successors, (3034), 2155 states have internal predecessors, (3034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3034 transitions. [2022-01-10 14:10:49,881 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3034 transitions. Word has length 132 [2022-01-10 14:10:49,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:49,881 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3034 transitions. [2022-01-10 14:10:49,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3034 transitions. [2022-01-10 14:10:49,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:49,881 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:49,882 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:49,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 14:10:49,882 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-10 14:10:49,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1885532938, now seen corresponding path program 1 times [2022-01-10 14:10:49,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:49,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901788035] [2022-01-10 14:10:49,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:49,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:49,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:49,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901788035] [2022-01-10 14:10:49,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901788035] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:49,908 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:49,908 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:49,908 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163815401] [2022-01-10 14:10:49,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:49,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:49,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:49,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:49,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:49,909 INFO L87 Difference]: Start difference. First operand 2156 states and 3034 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:50,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:50,044 INFO L93 Difference]: Finished difference Result 4282 states and 6028 transitions. [2022-01-10 14:10:50,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:50,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:50,050 INFO L225 Difference]: With dead ends: 4282 [2022-01-10 14:10:50,050 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:50,053 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:50,053 INFO L933 BasicCegarLoop]: 1624 mSDtfsCounter, 1513 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1513 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:50,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1513 Valid, 1719 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:50,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:50,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.3946146703806872) internal successors, (3004), 2155 states have internal predecessors, (3004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3004 transitions. [2022-01-10 14:10:50,146 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3004 transitions. Word has length 132 [2022-01-10 14:10:50,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:50,146 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3004 transitions. [2022-01-10 14:10:50,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3004 transitions. [2022-01-10 14:10:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:50,147 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:50,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:50,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 14:10:50,147 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-10 14:10:50,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:50,148 INFO L85 PathProgramCache]: Analyzing trace with hash -561639403, now seen corresponding path program 1 times [2022-01-10 14:10:50,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:50,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769579934] [2022-01-10 14:10:50,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:50,149 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:50,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:50,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:50,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769579934] [2022-01-10 14:10:50,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769579934] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:50,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:50,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:50,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658134630] [2022-01-10 14:10:50,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:50,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:50,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:50,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:50,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:50,180 INFO L87 Difference]: Start difference. First operand 2156 states and 3004 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:50,333 INFO L93 Difference]: Finished difference Result 4281 states and 5967 transitions. [2022-01-10 14:10:50,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:50,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:50,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:50,337 INFO L225 Difference]: With dead ends: 4281 [2022-01-10 14:10:50,337 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:50,339 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:50,339 INFO L933 BasicCegarLoop]: 1607 mSDtfsCounter, 1496 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1496 SdHoareTripleChecker+Valid, 1701 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:50,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1496 Valid, 1701 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:50,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:50,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.3806870937790159) internal successors, (2974), 2155 states have internal predecessors, (2974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2974 transitions. [2022-01-10 14:10:50,438 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2974 transitions. Word has length 132 [2022-01-10 14:10:50,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:50,438 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 2974 transitions. [2022-01-10 14:10:50,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:50,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2974 transitions. [2022-01-10 14:10:50,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:50,439 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:50,439 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:50,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 14:10:50,439 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-10 14:10:50,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:50,440 INFO L85 PathProgramCache]: Analyzing trace with hash 141139636, now seen corresponding path program 1 times [2022-01-10 14:10:50,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:50,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338766473] [2022-01-10 14:10:50,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:50,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:50,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:50,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338766473] [2022-01-10 14:10:50,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338766473] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:50,475 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:50,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:50,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140463136] [2022-01-10 14:10:50,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:50,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:50,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:50,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:50,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:50,476 INFO L87 Difference]: Start difference. First operand 2156 states and 2974 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:50,603 INFO L93 Difference]: Finished difference Result 4280 states and 5906 transitions. [2022-01-10 14:10:50,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:50,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:50,607 INFO L225 Difference]: With dead ends: 4280 [2022-01-10 14:10:50,607 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:50,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:50,614 INFO L933 BasicCegarLoop]: 1590 mSDtfsCounter, 1479 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:50,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1479 Valid, 1683 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:50,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:50,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:50,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.3667595171773446) internal successors, (2944), 2155 states have internal predecessors, (2944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2944 transitions. [2022-01-10 14:10:50,759 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2944 transitions. Word has length 132 [2022-01-10 14:10:50,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:50,759 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 2944 transitions. [2022-01-10 14:10:50,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2944 transitions. [2022-01-10 14:10:50,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:50,760 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:50,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:50,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 14:10:50,761 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-10 14:10:50,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:50,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1818738605, now seen corresponding path program 1 times [2022-01-10 14:10:50,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:50,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143219228] [2022-01-10 14:10:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:50,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:50,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:50,795 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:50,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143219228] [2022-01-10 14:10:50,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143219228] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:50,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:50,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:50,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544106624] [2022-01-10 14:10:50,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:50,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:50,796 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:50,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:50,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:50,797 INFO L87 Difference]: Start difference. First operand 2156 states and 2944 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:50,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:50,977 INFO L93 Difference]: Finished difference Result 4279 states and 5845 transitions. [2022-01-10 14:10:50,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:50,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:50,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:50,982 INFO L225 Difference]: With dead ends: 4279 [2022-01-10 14:10:50,982 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:50,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:50,985 INFO L933 BasicCegarLoop]: 1573 mSDtfsCounter, 1462 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:50,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1462 Valid, 1665 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.3528319405756732) internal successors, (2914), 2155 states have internal predecessors, (2914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:51,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2914 transitions. [2022-01-10 14:10:51,134 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2914 transitions. Word has length 132 [2022-01-10 14:10:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:51,134 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 2914 transitions. [2022-01-10 14:10:51,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:51,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2914 transitions. [2022-01-10 14:10:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:51,135 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:51,135 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:51,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 14:10:51,137 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-10 14:10:51,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:51,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1147100530, now seen corresponding path program 1 times [2022-01-10 14:10:51,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:51,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110864396] [2022-01-10 14:10:51,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:51,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:51,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:51,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110864396] [2022-01-10 14:10:51,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110864396] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:51,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:51,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:51,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575063885] [2022-01-10 14:10:51,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:51,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:51,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:51,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:51,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:51,178 INFO L87 Difference]: Start difference. First operand 2156 states and 2914 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:51,315 INFO L93 Difference]: Finished difference Result 4278 states and 5784 transitions. [2022-01-10 14:10:51,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:51,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:51,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:51,319 INFO L225 Difference]: With dead ends: 4278 [2022-01-10 14:10:51,319 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:51,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:51,321 INFO L933 BasicCegarLoop]: 1556 mSDtfsCounter, 1445 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:51,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1445 Valid, 1647 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:51,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.338904363974002) internal successors, (2884), 2155 states have internal predecessors, (2884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2884 transitions. [2022-01-10 14:10:51,426 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2884 transitions. Word has length 132 [2022-01-10 14:10:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:51,427 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 2884 transitions. [2022-01-10 14:10:51,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2884 transitions. [2022-01-10 14:10:51,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:51,427 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:51,427 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:51,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-10 14:10:51,428 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-10 14:10:51,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:51,428 INFO L85 PathProgramCache]: Analyzing trace with hash 278355345, now seen corresponding path program 1 times [2022-01-10 14:10:51,428 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:51,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043203140] [2022-01-10 14:10:51,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:51,429 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:51,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:51,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043203140] [2022-01-10 14:10:51,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043203140] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:51,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:51,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:51,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584696715] [2022-01-10 14:10:51,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:51,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:51,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:51,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:51,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:51,472 INFO L87 Difference]: Start difference. First operand 2156 states and 2884 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:51,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:51,598 INFO L93 Difference]: Finished difference Result 4277 states and 5723 transitions. [2022-01-10 14:10:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:51,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:51,602 INFO L225 Difference]: With dead ends: 4277 [2022-01-10 14:10:51,602 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:51,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:51,606 INFO L933 BasicCegarLoop]: 1539 mSDtfsCounter, 1428 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:51,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1428 Valid, 1629 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:51,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:51,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:51,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.3249767873723306) internal successors, (2854), 2155 states have internal predecessors, (2854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2854 transitions. [2022-01-10 14:10:51,712 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2854 transitions. Word has length 132 [2022-01-10 14:10:51,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:51,713 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 2854 transitions. [2022-01-10 14:10:51,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:51,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2854 transitions. [2022-01-10 14:10:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:51,713 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:51,713 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:51,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-10 14:10:51,714 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-10 14:10:51,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:51,714 INFO L85 PathProgramCache]: Analyzing trace with hash 282708272, now seen corresponding path program 1 times [2022-01-10 14:10:51,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:51,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237724920] [2022-01-10 14:10:51,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:51,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:51,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:51,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:51,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237724920] [2022-01-10 14:10:51,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237724920] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:51,743 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:51,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:51,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368545662] [2022-01-10 14:10:51,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:51,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:51,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:51,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:51,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:51,745 INFO L87 Difference]: Start difference. First operand 2156 states and 2854 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:51,870 INFO L93 Difference]: Finished difference Result 4276 states and 5662 transitions. [2022-01-10 14:10:51,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:51,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:51,873 INFO L225 Difference]: With dead ends: 4276 [2022-01-10 14:10:51,873 INFO L226 Difference]: Without dead ends: 2156 [2022-01-10 14:10:51,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:51,876 INFO L933 BasicCegarLoop]: 1522 mSDtfsCounter, 1411 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:51,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1411 Valid, 1611 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2022-01-10 14:10:51,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 2156. [2022-01-10 14:10:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2154 states have (on average 1.3110492107706593) internal successors, (2824), 2155 states have internal predecessors, (2824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:51,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 2824 transitions. [2022-01-10 14:10:51,988 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 2824 transitions. Word has length 132 [2022-01-10 14:10:51,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:51,988 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 2824 transitions. [2022-01-10 14:10:51,988 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:51,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 2824 transitions. [2022-01-10 14:10:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:51,989 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:51,989 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:51,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 14:10:51,989 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-10 14:10:51,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:51,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1560209359, now seen corresponding path program 1 times [2022-01-10 14:10:51,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:51,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536600495] [2022-01-10 14:10:51,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:51,990 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:52,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:52,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536600495] [2022-01-10 14:10:52,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536600495] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:52,039 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:52,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:10:52,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495941307] [2022-01-10 14:10:52,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:52,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:10:52,040 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:52,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:10:52,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:10:52,041 INFO L87 Difference]: Start difference. First operand 2156 states and 2824 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:52,326 INFO L93 Difference]: Finished difference Result 5031 states and 6656 transitions. [2022-01-10 14:10:52,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:10:52,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:52,331 INFO L225 Difference]: With dead ends: 5031 [2022-01-10 14:10:52,331 INFO L226 Difference]: Without dead ends: 2918 [2022-01-10 14:10:52,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:10:52,334 INFO L933 BasicCegarLoop]: 1657 mSDtfsCounter, 4376 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4376 SdHoareTripleChecker+Valid, 3213 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:52,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4376 Valid, 3213 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:10:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2022-01-10 14:10:52,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 2162. [2022-01-10 14:10:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2162 states, 2160 states have (on average 1.3) internal successors, (2808), 2161 states have internal predecessors, (2808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2162 states to 2162 states and 2808 transitions. [2022-01-10 14:10:52,471 INFO L78 Accepts]: Start accepts. Automaton has 2162 states and 2808 transitions. Word has length 132 [2022-01-10 14:10:52,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:52,472 INFO L470 AbstractCegarLoop]: Abstraction has 2162 states and 2808 transitions. [2022-01-10 14:10:52,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:52,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2162 states and 2808 transitions. [2022-01-10 14:10:52,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:52,472 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:52,472 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:52,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 14:10:52,473 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-10 14:10:52,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:52,473 INFO L85 PathProgramCache]: Analyzing trace with hash 589918352, now seen corresponding path program 1 times [2022-01-10 14:10:52,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:52,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770088322] [2022-01-10 14:10:52,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:52,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:52,505 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:52,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770088322] [2022-01-10 14:10:52,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770088322] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:52,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:52,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:10:52,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170616209] [2022-01-10 14:10:52,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:52,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:10:52,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:52,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:10:52,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:10:52,506 INFO L87 Difference]: Start difference. First operand 2162 states and 2808 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:52,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:52,821 INFO L93 Difference]: Finished difference Result 5287 states and 6921 transitions. [2022-01-10 14:10:52,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:10:52,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:52,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:52,825 INFO L225 Difference]: With dead ends: 5287 [2022-01-10 14:10:52,826 INFO L226 Difference]: Without dead ends: 3182 [2022-01-10 14:10:52,827 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:10:52,828 INFO L933 BasicCegarLoop]: 1609 mSDtfsCounter, 4082 mSDsluCounter, 2126 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4082 SdHoareTripleChecker+Valid, 3735 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:52,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4082 Valid, 3735 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:10:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2022-01-10 14:10:52,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 2168. [2022-01-10 14:10:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2168 states, 2166 states have (on average 1.289012003693444) internal successors, (2792), 2167 states have internal predecessors, (2792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2168 states to 2168 states and 2792 transitions. [2022-01-10 14:10:52,966 INFO L78 Accepts]: Start accepts. Automaton has 2168 states and 2792 transitions. Word has length 132 [2022-01-10 14:10:52,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:52,966 INFO L470 AbstractCegarLoop]: Abstraction has 2168 states and 2792 transitions. [2022-01-10 14:10:52,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:52,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2168 states and 2792 transitions. [2022-01-10 14:10:52,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:52,966 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:52,967 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:52,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-10 14:10:52,967 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-10 14:10:52,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:52,967 INFO L85 PathProgramCache]: Analyzing trace with hash 710038225, now seen corresponding path program 1 times [2022-01-10 14:10:52,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:52,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949906916] [2022-01-10 14:10:52,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:52,967 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:53,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:53,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:53,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949906916] [2022-01-10 14:10:53,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949906916] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:53,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:53,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 14:10:53,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276085031] [2022-01-10 14:10:53,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:53,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 14:10:53,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:53,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 14:10:53,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 14:10:53,004 INFO L87 Difference]: Start difference. First operand 2168 states and 2792 transitions. Second operand has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:53,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:53,395 INFO L93 Difference]: Finished difference Result 6138 states and 7961 transitions. [2022-01-10 14:10:53,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 14:10:53,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:53,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:53,402 INFO L225 Difference]: With dead ends: 6138 [2022-01-10 14:10:53,403 INFO L226 Difference]: Without dead ends: 4076 [2022-01-10 14:10:53,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 14:10:53,406 INFO L933 BasicCegarLoop]: 1464 mSDtfsCounter, 3111 mSDsluCounter, 4128 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3111 SdHoareTripleChecker+Valid, 5592 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:53,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3111 Valid, 5592 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:10:53,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2022-01-10 14:10:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 2174. [2022-01-10 14:10:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2174 states, 2172 states have (on average 1.278084714548803) internal successors, (2776), 2173 states have internal predecessors, (2776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 2776 transitions. [2022-01-10 14:10:53,645 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 2776 transitions. Word has length 132 [2022-01-10 14:10:53,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:53,646 INFO L470 AbstractCegarLoop]: Abstraction has 2174 states and 2776 transitions. [2022-01-10 14:10:53,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.4) internal successors, (132), 5 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 2776 transitions. [2022-01-10 14:10:53,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-01-10 14:10:53,646 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:53,646 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:53,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-10 14:10:53,647 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-10 14:10:53,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:53,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1039803986, now seen corresponding path program 1 times [2022-01-10 14:10:53,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:53,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113320970] [2022-01-10 14:10:53,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:53,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:53,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:53,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:53,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113320970] [2022-01-10 14:10:53,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113320970] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:53,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:53,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 14:10:53,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842902501] [2022-01-10 14:10:53,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:53,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:53,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:53,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:53,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:53,690 INFO L87 Difference]: Start difference. First operand 2174 states and 2776 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:54,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:54,080 INFO L93 Difference]: Finished difference Result 6306 states and 8060 transitions. [2022-01-10 14:10:54,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:54,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2022-01-10 14:10:54,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:54,084 INFO L225 Difference]: With dead ends: 6306 [2022-01-10 14:10:54,084 INFO L226 Difference]: Without dead ends: 4170 [2022-01-10 14:10:54,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:54,088 INFO L933 BasicCegarLoop]: 1487 mSDtfsCounter, 1328 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1328 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:54,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1328 Valid, 2807 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:10:54,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2022-01-10 14:10:54,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4032. [2022-01-10 14:10:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4032 states, 4030 states have (on average 1.2739454094292804) internal successors, (5134), 4031 states have internal predecessors, (5134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5134 transitions. [2022-01-10 14:10:54,465 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5134 transitions. Word has length 132 [2022-01-10 14:10:54,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:54,466 INFO L470 AbstractCegarLoop]: Abstraction has 4032 states and 5134 transitions. [2022-01-10 14:10:54,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:54,466 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5134 transitions. [2022-01-10 14:10:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-01-10 14:10:54,468 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:54,468 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:54,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-10 14:10:54,468 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-10 14:10:54,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:54,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1465323241, now seen corresponding path program 1 times [2022-01-10 14:10:54,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:54,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423712021] [2022-01-10 14:10:54,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:54,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:54,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:54,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423712021] [2022-01-10 14:10:54,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423712021] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:54,521 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:54,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:54,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958958141] [2022-01-10 14:10:54,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:54,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:54,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:54,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:54,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:54,523 INFO L87 Difference]: Start difference. First operand 4032 states and 5134 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:55,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:55,129 INFO L93 Difference]: Finished difference Result 11842 states and 15105 transitions. [2022-01-10 14:10:55,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:55,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2022-01-10 14:10:55,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:55,141 INFO L225 Difference]: With dead ends: 11842 [2022-01-10 14:10:55,141 INFO L226 Difference]: Without dead ends: 7854 [2022-01-10 14:10:55,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:55,149 INFO L933 BasicCegarLoop]: 1484 mSDtfsCounter, 1366 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1366 SdHoareTripleChecker+Valid, 2804 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:55,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1366 Valid, 2804 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:55,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7854 states. [2022-01-10 14:10:55,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7854 to 7582. [2022-01-10 14:10:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7582 states, 7580 states have (on average 1.2720316622691292) internal successors, (9642), 7581 states have internal predecessors, (9642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7582 states to 7582 states and 9642 transitions. [2022-01-10 14:10:55,760 INFO L78 Accepts]: Start accepts. Automaton has 7582 states and 9642 transitions. Word has length 214 [2022-01-10 14:10:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:55,761 INFO L470 AbstractCegarLoop]: Abstraction has 7582 states and 9642 transitions. [2022-01-10 14:10:55,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:55,761 INFO L276 IsEmpty]: Start isEmpty. Operand 7582 states and 9642 transitions. [2022-01-10 14:10:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-01-10 14:10:55,765 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:55,766 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:55,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-10 14:10:55,766 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-10 14:10:55,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:55,767 INFO L85 PathProgramCache]: Analyzing trace with hash 765839958, now seen corresponding path program 1 times [2022-01-10 14:10:55,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:55,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985004619] [2022-01-10 14:10:55,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:55,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:10:55,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:55,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985004619] [2022-01-10 14:10:55,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985004619] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:55,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:55,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:55,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771984465] [2022-01-10 14:10:55,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:55,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:55,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:55,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:55,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:55,819 INFO L87 Difference]: Start difference. First operand 7582 states and 9642 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:57,068 INFO L93 Difference]: Finished difference Result 22339 states and 28271 transitions. [2022-01-10 14:10:57,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:57,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2022-01-10 14:10:57,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:57,084 INFO L225 Difference]: With dead ends: 22339 [2022-01-10 14:10:57,085 INFO L226 Difference]: Without dead ends: 14883 [2022-01-10 14:10:57,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:57,092 INFO L933 BasicCegarLoop]: 1823 mSDtfsCounter, 1357 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 3289 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:57,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1357 Valid, 3289 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:57,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14883 states. [2022-01-10 14:10:58,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14883 to 14627. [2022-01-10 14:10:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14627 states, 14625 states have (on average 1.260102564102564) internal successors, (18429), 14626 states have internal predecessors, (18429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14627 states to 14627 states and 18429 transitions. [2022-01-10 14:10:58,410 INFO L78 Accepts]: Start accepts. Automaton has 14627 states and 18429 transitions. Word has length 214 [2022-01-10 14:10:58,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:10:58,410 INFO L470 AbstractCegarLoop]: Abstraction has 14627 states and 18429 transitions. [2022-01-10 14:10:58,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:58,411 INFO L276 IsEmpty]: Start isEmpty. Operand 14627 states and 18429 transitions. [2022-01-10 14:10:58,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-01-10 14:10:58,418 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:10:58,418 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:10:58,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-10 14:10:58,419 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-10 14:10:58,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:10:58,419 INFO L85 PathProgramCache]: Analyzing trace with hash 817106551, now seen corresponding path program 1 times [2022-01-10 14:10:58,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:10:58,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773474846] [2022-01-10 14:10:58,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:10:58,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:10:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:10:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 14:10:58,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:10:58,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773474846] [2022-01-10 14:10:58,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773474846] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:10:58,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:10:58,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:10:58,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607712738] [2022-01-10 14:10:58,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:10:58,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:10:58,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:10:58,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:10:58,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:58,451 INFO L87 Difference]: Start difference. First operand 14627 states and 18429 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:10:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:10:59,587 INFO L93 Difference]: Finished difference Result 29087 states and 36659 transitions. [2022-01-10 14:10:59,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:10:59,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 214 [2022-01-10 14:10:59,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:10:59,617 INFO L225 Difference]: With dead ends: 29087 [2022-01-10 14:10:59,618 INFO L226 Difference]: Without dead ends: 14508 [2022-01-10 14:10:59,632 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:10:59,633 INFO L933 BasicCegarLoop]: 1497 mSDtfsCounter, 1492 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1492 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:10:59,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1492 Valid, 1498 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:10:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14508 states. [2022-01-10 14:11:00,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14508 to 14508. [2022-01-10 14:11:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14508 states, 14506 states have (on average 1.2606507652006067) internal successors, (18287), 14507 states have internal predecessors, (18287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14508 states to 14508 states and 18287 transitions. [2022-01-10 14:11:00,868 INFO L78 Accepts]: Start accepts. Automaton has 14508 states and 18287 transitions. Word has length 214 [2022-01-10 14:11:00,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:00,869 INFO L470 AbstractCegarLoop]: Abstraction has 14508 states and 18287 transitions. [2022-01-10 14:11:00,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 14508 states and 18287 transitions. [2022-01-10 14:11:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-01-10 14:11:00,875 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:00,876 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:00,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-10 14:11:00,876 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-10 14:11:00,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:00,876 INFO L85 PathProgramCache]: Analyzing trace with hash -768479001, now seen corresponding path program 1 times [2022-01-10 14:11:00,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:00,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220428745] [2022-01-10 14:11:00,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:00,876 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:00,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:00,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220428745] [2022-01-10 14:11:00,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220428745] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:00,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:00,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:00,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834468802] [2022-01-10 14:11:00,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:00,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:00,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:00,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:00,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:00,929 INFO L87 Difference]: Start difference. First operand 14508 states and 18287 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:03,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:03,191 INFO L93 Difference]: Finished difference Result 41990 states and 52814 transitions. [2022-01-10 14:11:03,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:03,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 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 215 [2022-01-10 14:11:03,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:03,224 INFO L225 Difference]: With dead ends: 41990 [2022-01-10 14:11:03,225 INFO L226 Difference]: Without dead ends: 27608 [2022-01-10 14:11:03,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:03,236 INFO L933 BasicCegarLoop]: 2268 mSDtfsCounter, 1160 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 3744 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:03,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1160 Valid, 3744 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27608 states. [2022-01-10 14:11:05,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27608 to 27604. [2022-01-10 14:11:05,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27604 states, 27602 states have (on average 1.2547641475255416) internal successors, (34634), 27603 states have internal predecessors, (34634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27604 states to 27604 states and 34634 transitions. [2022-01-10 14:11:05,435 INFO L78 Accepts]: Start accepts. Automaton has 27604 states and 34634 transitions. Word has length 215 [2022-01-10 14:11:05,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:05,436 INFO L470 AbstractCegarLoop]: Abstraction has 27604 states and 34634 transitions. [2022-01-10 14:11:05,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 27604 states and 34634 transitions. [2022-01-10 14:11:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-01-10 14:11:05,507 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:05,507 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:05,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-10 14:11:05,508 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-10 14:11:05,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:05,508 INFO L85 PathProgramCache]: Analyzing trace with hash 942171846, now seen corresponding path program 1 times [2022-01-10 14:11:05,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:05,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384564337] [2022-01-10 14:11:05,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:05,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:05,537 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 14:11:05,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:05,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384564337] [2022-01-10 14:11:05,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384564337] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:05,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:05,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:05,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392083548] [2022-01-10 14:11:05,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:05,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:05,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:05,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:05,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:05,539 INFO L87 Difference]: Start difference. First operand 27604 states and 34634 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:07,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:07,868 INFO L93 Difference]: Finished difference Result 54964 states and 68980 transitions. [2022-01-10 14:11:07,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:07,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 215 [2022-01-10 14:11:07,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:07,910 INFO L225 Difference]: With dead ends: 54964 [2022-01-10 14:11:07,910 INFO L226 Difference]: Without dead ends: 27486 [2022-01-10 14:11:07,935 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:07,936 INFO L933 BasicCegarLoop]: 1496 mSDtfsCounter, 1490 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:07,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1490 Valid, 1497 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27486 states. [2022-01-10 14:11:10,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27486 to 27486. [2022-01-10 14:11:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27486 states, 27484 states have (on average 1.255057487993014) internal successors, (34494), 27485 states have internal predecessors, (34494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27486 states to 27486 states and 34494 transitions. [2022-01-10 14:11:10,390 INFO L78 Accepts]: Start accepts. Automaton has 27486 states and 34494 transitions. Word has length 215 [2022-01-10 14:11:10,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:10,390 INFO L470 AbstractCegarLoop]: Abstraction has 27486 states and 34494 transitions. [2022-01-10 14:11:10,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:10,390 INFO L276 IsEmpty]: Start isEmpty. Operand 27486 states and 34494 transitions. [2022-01-10 14:11:10,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-01-10 14:11:10,401 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:10,401 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:10,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-10 14:11:10,401 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-10 14:11:10,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:10,402 INFO L85 PathProgramCache]: Analyzing trace with hash 360787817, now seen corresponding path program 1 times [2022-01-10 14:11:10,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:10,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136799054] [2022-01-10 14:11:10,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:10,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:10,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:10,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136799054] [2022-01-10 14:11:10,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136799054] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:10,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:10,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:10,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84377215] [2022-01-10 14:11:10,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:10,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:10,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:10,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:10,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:10,454 INFO L87 Difference]: Start difference. First operand 27486 states and 34494 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:14,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:14,962 INFO L93 Difference]: Finished difference Result 81187 states and 101787 transitions. [2022-01-10 14:11:14,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:14,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 216 [2022-01-10 14:11:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:15,049 INFO L225 Difference]: With dead ends: 81187 [2022-01-10 14:11:15,050 INFO L226 Difference]: Without dead ends: 53827 [2022-01-10 14:11:15,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:15,081 INFO L933 BasicCegarLoop]: 1836 mSDtfsCounter, 1357 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 3298 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.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:15,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1357 Valid, 3298 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:15,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53827 states. [2022-01-10 14:11:19,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53827 to 52351. [2022-01-10 14:11:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52351 states, 52349 states have (on average 1.2517335574700568) internal successors, (65527), 52350 states have internal predecessors, (65527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52351 states to 52351 states and 65527 transitions. [2022-01-10 14:11:19,927 INFO L78 Accepts]: Start accepts. Automaton has 52351 states and 65527 transitions. Word has length 216 [2022-01-10 14:11:19,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:19,929 INFO L470 AbstractCegarLoop]: Abstraction has 52351 states and 65527 transitions. [2022-01-10 14:11:19,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:19,929 INFO L276 IsEmpty]: Start isEmpty. Operand 52351 states and 65527 transitions. [2022-01-10 14:11:19,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2022-01-10 14:11:19,953 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:19,953 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:19,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-10 14:11:19,953 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-10 14:11:19,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:19,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1862740361, now seen corresponding path program 1 times [2022-01-10 14:11:19,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:19,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618419807] [2022-01-10 14:11:19,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:19,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 14:11:20,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:20,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618419807] [2022-01-10 14:11:20,026 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618419807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:20,026 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:20,026 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:20,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578408122] [2022-01-10 14:11:20,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:20,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:20,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:20,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:20,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:20,027 INFO L87 Difference]: Start difference. First operand 52351 states and 65527 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:25,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:25,053 INFO L93 Difference]: Finished difference Result 104523 states and 130844 transitions. [2022-01-10 14:11:25,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:25,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 216 [2022-01-10 14:11:25,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:25,156 INFO L225 Difference]: With dead ends: 104523 [2022-01-10 14:11:25,156 INFO L226 Difference]: Without dead ends: 52234 [2022-01-10 14:11:25,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:25,221 INFO L933 BasicCegarLoop]: 1495 mSDtfsCounter, 1488 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1488 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:25,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1488 Valid, 1496 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 14:11:25,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52234 states. [2022-01-10 14:11:30,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52234 to 52234. [2022-01-10 14:11:30,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52234 states, 52232 states have (on average 1.2518953897993568) internal successors, (65389), 52233 states have internal predecessors, (65389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52234 states to 52234 states and 65389 transitions. [2022-01-10 14:11:30,289 INFO L78 Accepts]: Start accepts. Automaton has 52234 states and 65389 transitions. Word has length 216 [2022-01-10 14:11:30,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 14:11:30,290 INFO L470 AbstractCegarLoop]: Abstraction has 52234 states and 65389 transitions. [2022-01-10 14:11:30,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 52234 states and 65389 transitions. [2022-01-10 14:11:30,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-01-10 14:11:30,311 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 14:11:30,315 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 14:11:30,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-10 14:11:30,316 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 14:11:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 14:11:30,316 INFO L85 PathProgramCache]: Analyzing trace with hash -660272424, now seen corresponding path program 1 times [2022-01-10 14:11:30,316 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 14:11:30,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396087712] [2022-01-10 14:11:30,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 14:11:30,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 14:11:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 14:11:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 14:11:30,436 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 14:11:30,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396087712] [2022-01-10 14:11:30,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396087712] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 14:11:30,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 14:11:30,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 14:11:30,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775759319] [2022-01-10 14:11:30,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 14:11:30,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 14:11:30,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 14:11:30,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 14:11:30,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:30,437 INFO L87 Difference]: Start difference. First operand 52234 states and 65389 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 14:11:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 14:11:39,584 INFO L93 Difference]: Finished difference Result 154014 states and 192696 transitions. [2022-01-10 14:11:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 14:11:39,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 217 [2022-01-10 14:11:39,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 14:11:39,796 INFO L225 Difference]: With dead ends: 154014 [2022-01-10 14:11:39,796 INFO L226 Difference]: Without dead ends: 101906 [2022-01-10 14:11:39,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 14:11:39,873 INFO L933 BasicCegarLoop]: 1940 mSDtfsCounter, 1357 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1357 SdHoareTripleChecker+Valid, 3400 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 14:11:39,873 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1357 Valid, 3400 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 14:11:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101906 states.