/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_SUM.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 07:39:55,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 07:39:55,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 07:39:55,644 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 07:39:55,644 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 07:39:55,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 07:39:55,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 07:39:55,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 07:39:55,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 07:39:55,665 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 07:39:55,666 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 07:39:55,667 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 07:39:55,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 07:39:55,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 07:39:55,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 07:39:55,669 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 07:39:55,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 07:39:55,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 07:39:55,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 07:39:55,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 07:39:55,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 07:39:55,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 07:39:55,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 07:39:55,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 07:39:55,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 07:39:55,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 07:39:55,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 07:39:55,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 07:39:55,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 07:39:55,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 07:39:55,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 07:39:55,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 07:39:55,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 07:39:55,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 07:39:55,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 07:39:55,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 07:39:55,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 07:39:55,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 07:39:55,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 07:39:55,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 07:39:55,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 07:39:55,719 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 07:39:55,737 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 07:39:55,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 07:39:55,737 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 07:39:55,737 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 07:39:55,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 07:39:55,738 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 07:39:55,738 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 07:39:55,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 07:39:55,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 07:39:55,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 07:39:55,739 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 07:39:55,739 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 07:39:55,739 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 07:39:55,739 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 07:39:55,739 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 07:39:55,740 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 07:39:55,740 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 07:39:55,740 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 07:39:55,740 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 07:39:55,740 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 07:39:55,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 07:39:55,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 07:39:55,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 07:39:55,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 07:39:55,741 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 07:39:55,741 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 07:39:55,741 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 07:39:55,741 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 07:39:55,741 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 07:39:55,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 07:39:55,741 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 07:39:55,742 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 07:39:55,742 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 07:39:55,742 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 07:39:55,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 07:39:55,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 07:39:55,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 07:39:55,980 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 07:39:55,983 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 07:39:55,984 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2022-01-11 07:39:56,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54c8bebd1/267ad5da073a43739535a1ea96e16471/FLAGe9e0789e8 [2022-01-11 07:39:56,463 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 07:39:56,464 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2022-01-11 07:39:56,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54c8bebd1/267ad5da073a43739535a1ea96e16471/FLAGe9e0789e8 [2022-01-11 07:39:56,496 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54c8bebd1/267ad5da073a43739535a1ea96e16471 [2022-01-11 07:39:56,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 07:39:56,499 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 07:39:56,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 07:39:56,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 07:39:56,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 07:39:56,507 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 07:39:56" (1/1) ... [2022-01-11 07:39:56,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17290b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:39:56, skipping insertion in model container [2022-01-11 07:39:56,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 07:39:56" (1/1) ... [2022-01-11 07:39:56,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 07:39:56,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 07:39:56,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[914,927] [2022-01-11 07:39:56,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[7115,7128] [2022-01-11 07:39:56,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 07:39:56,777 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 07:39:56,787 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[914,927] [2022-01-11 07:39:56,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[7115,7128] [2022-01-11 07:39:56,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 07:39:56,838 INFO L208 MainTranslator]: Completed translation [2022-01-11 07:39:56,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:39:56 WrapperNode [2022-01-11 07:39:56,839 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 07:39:56,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 07:39:56,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 07:39:56,840 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 07:39:56,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:39:56" (1/1) ... [2022-01-11 07:39:56,857 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:39:56" (1/1) ... [2022-01-11 07:39:56,895 INFO L137 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 61, calls inlined = 89, statements flattened = 1114 [2022-01-11 07:39:56,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 07:39:56,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 07:39:56,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 07:39:56,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 07:39:56,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:39:56" (1/1) ... [2022-01-11 07:39:56,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:39:56" (1/1) ... [2022-01-11 07:39:56,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:39:56" (1/1) ... [2022-01-11 07:39:56,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:39:56" (1/1) ... [2022-01-11 07:39:56,923 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:39:56" (1/1) ... [2022-01-11 07:39:56,934 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:39:56" (1/1) ... [2022-01-11 07:39:56,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:39:56" (1/1) ... [2022-01-11 07:39:56,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 07:39:56,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 07:39:56,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 07:39:56,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 07:39:56,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:39:56" (1/1) ... [2022-01-11 07:39:56,972 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 07:39:56,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 07:39:57,012 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 07:39:57,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 07:39:57,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 07:39:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 07:39:57,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 07:39:57,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 07:39:57,181 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 07:39:57,183 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 07:39:57,977 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 07:39:57,994 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 07:39:57,994 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-01-11 07:39:57,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:39:57 BoogieIcfgContainer [2022-01-11 07:39:57,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 07:39:57,998 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 07:39:57,998 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 07:39:57,999 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 07:39:58,001 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:39:57" (1/1) ... [2022-01-11 07:39:58,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 07:39:58 BasicIcfg [2022-01-11 07:39:58,207 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 07:39:58,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 07:39:58,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 07:39:58,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 07:39:58,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 07:39:56" (1/4) ... [2022-01-11 07:39:58,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cf705c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 07:39:58, skipping insertion in model container [2022-01-11 07:39:58,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 07:39:56" (2/4) ... [2022-01-11 07:39:58,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cf705c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 07:39:58, skipping insertion in model container [2022-01-11 07:39:58,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 07:39:57" (3/4) ... [2022-01-11 07:39:58,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cf705c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 07:39:58, skipping insertion in model container [2022-01-11 07:39:58,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 07:39:58" (4/4) ... [2022-01-11 07:39:58,215 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.03.cil-2.cTransformedIcfg [2022-01-11 07:39:58,219 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 07:39:58,220 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-11 07:39:58,262 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 07:39:58,269 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 07:39:58,269 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-11 07:39:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 428 states, 424 states have (on average 1.5471698113207548) internal successors, (656), 427 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:39:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 07:39:58,310 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:39:58,310 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:39:58,311 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:39:58,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:39:58,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1947266229, now seen corresponding path program 1 times [2022-01-11 07:39:58,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:39:58,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195584771] [2022-01-11 07:39:58,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:39:58,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:39:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:39:58,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:39:58,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:39:58,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195584771] [2022-01-11 07:39:58,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195584771] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:39:58,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:39:58,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:39:58,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213666222] [2022-01-11 07:39:58,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:39:58,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:39:58,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:39:58,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:39:58,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:39:58,624 INFO L87 Difference]: Start difference. First operand has 428 states, 424 states have (on average 1.5471698113207548) internal successors, (656), 427 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:39:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:39:58,797 INFO L93 Difference]: Finished difference Result 885 states and 1354 transitions. [2022-01-11 07:39:58,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:39:58,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-11 07:39:58,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:39:58,824 INFO L225 Difference]: With dead ends: 885 [2022-01-11 07:39:58,824 INFO L226 Difference]: Without dead ends: 512 [2022-01-11 07:39:58,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:39:58,831 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 124 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 07:39:58,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 1222 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 07:39:58,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-01-11 07:39:58,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 508. [2022-01-11 07:39:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 505 states have (on average 1.4732673267326732) internal successors, (744), 507 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:39:58,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 744 transitions. [2022-01-11 07:39:58,906 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 744 transitions. Word has length 44 [2022-01-11 07:39:58,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:39:58,907 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 744 transitions. [2022-01-11 07:39:58,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:39:58,907 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 744 transitions. [2022-01-11 07:39:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 07:39:58,909 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:39:58,909 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:39:58,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 07:39:58,909 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:39:58,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:39:58,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1586524979, now seen corresponding path program 1 times [2022-01-11 07:39:58,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:39:58,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486910283] [2022-01-11 07:39:58,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:39:58,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:39:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:39:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:39:59,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:39:59,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486910283] [2022-01-11 07:39:59,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486910283] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:39:59,022 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:39:59,023 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:39:59,023 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838720554] [2022-01-11 07:39:59,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:39:59,024 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:39:59,024 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:39:59,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:39:59,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:39:59,025 INFO L87 Difference]: Start difference. First operand 508 states and 744 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:39:59,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:39:59,109 INFO L93 Difference]: Finished difference Result 794 states and 1142 transitions. [2022-01-11 07:39:59,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:39:59,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-11 07:39:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:39:59,116 INFO L225 Difference]: With dead ends: 794 [2022-01-11 07:39:59,117 INFO L226 Difference]: Without dead ends: 664 [2022-01-11 07:39:59,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:39:59,122 INFO L933 BasicCegarLoop]: 619 mSDtfsCounter, 582 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:39:59,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [582 Valid, 737 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:39:59,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-01-11 07:39:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 660. [2022-01-11 07:39:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 657 states have (on average 1.4459665144596652) internal successors, (950), 659 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:39:59,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 950 transitions. [2022-01-11 07:39:59,178 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 950 transitions. Word has length 44 [2022-01-11 07:39:59,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:39:59,178 INFO L470 AbstractCegarLoop]: Abstraction has 660 states and 950 transitions. [2022-01-11 07:39:59,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:39:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 950 transitions. [2022-01-11 07:39:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 07:39:59,181 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:39:59,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:39:59,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 07:39:59,182 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:39:59,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:39:59,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1627410396, now seen corresponding path program 1 times [2022-01-11 07:39:59,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:39:59,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013896831] [2022-01-11 07:39:59,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:39:59,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:39:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:39:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:39:59,280 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:39:59,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013896831] [2022-01-11 07:39:59,281 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013896831] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:39:59,281 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:39:59,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:39:59,281 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568649529] [2022-01-11 07:39:59,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:39:59,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:39:59,282 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:39:59,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:39:59,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:39:59,283 INFO L87 Difference]: Start difference. First operand 660 states and 950 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:39:59,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:39:59,342 INFO L93 Difference]: Finished difference Result 1208 states and 1710 transitions. [2022-01-11 07:39:59,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:39:59,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-11 07:39:59,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:39:59,347 INFO L225 Difference]: With dead ends: 1208 [2022-01-11 07:39:59,347 INFO L226 Difference]: Without dead ends: 873 [2022-01-11 07:39:59,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:39:59,356 INFO L933 BasicCegarLoop]: 614 mSDtfsCounter, 94 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:39:59,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 1172 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:39:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-01-11 07:39:59,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 859. [2022-01-11 07:39:59,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 856 states have (on average 1.4228971962616823) internal successors, (1218), 858 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:39:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1218 transitions. [2022-01-11 07:39:59,392 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1218 transitions. Word has length 45 [2022-01-11 07:39:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:39:59,392 INFO L470 AbstractCegarLoop]: Abstraction has 859 states and 1218 transitions. [2022-01-11 07:39:59,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:39:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1218 transitions. [2022-01-11 07:39:59,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 07:39:59,399 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:39:59,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:39:59,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 07:39:59,401 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:39:59,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:39:59,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1597827933, now seen corresponding path program 1 times [2022-01-11 07:39:59,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:39:59,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957742111] [2022-01-11 07:39:59,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:39:59,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:39:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:39:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:39:59,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:39:59,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957742111] [2022-01-11 07:39:59,483 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957742111] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:39:59,483 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:39:59,483 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:39:59,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108851383] [2022-01-11 07:39:59,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:39:59,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:39:59,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:39:59,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:39:59,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:39:59,486 INFO L87 Difference]: Start difference. First operand 859 states and 1218 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:39:59,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:39:59,540 INFO L93 Difference]: Finished difference Result 1747 states and 2430 transitions. [2022-01-11 07:39:59,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:39:59,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-11 07:39:59,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:39:59,546 INFO L225 Difference]: With dead ends: 1747 [2022-01-11 07:39:59,547 INFO L226 Difference]: Without dead ends: 1271 [2022-01-11 07:39:59,549 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:39:59,555 INFO L933 BasicCegarLoop]: 614 mSDtfsCounter, 570 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:39:59,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [570 Valid, 703 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:39:59,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2022-01-11 07:39:59,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1239. [2022-01-11 07:39:59,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1236 states have (on average 1.389967637540453) internal successors, (1718), 1238 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:39:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1718 transitions. [2022-01-11 07:39:59,604 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1718 transitions. Word has length 45 [2022-01-11 07:39:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:39:59,604 INFO L470 AbstractCegarLoop]: Abstraction has 1239 states and 1718 transitions. [2022-01-11 07:39:59,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:39:59,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1718 transitions. [2022-01-11 07:39:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-11 07:39:59,606 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:39:59,606 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:39:59,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 07:39:59,606 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:39:59,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:39:59,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1153767199, now seen corresponding path program 1 times [2022-01-11 07:39:59,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:39:59,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127176582] [2022-01-11 07:39:59,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:39:59,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:39:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:39:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:39:59,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:39:59,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127176582] [2022-01-11 07:39:59,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127176582] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:39:59,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:39:59,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:39:59,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803175494] [2022-01-11 07:39:59,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:39:59,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:39:59,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:39:59,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:39:59,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:39:59,676 INFO L87 Difference]: Start difference. First operand 1239 states and 1718 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:39:59,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:39:59,747 INFO L93 Difference]: Finished difference Result 2442 states and 3331 transitions. [2022-01-11 07:39:59,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:39:59,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-11 07:39:59,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:39:59,781 INFO L225 Difference]: With dead ends: 2442 [2022-01-11 07:39:59,782 INFO L226 Difference]: Without dead ends: 1558 [2022-01-11 07:39:59,783 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:39:59,784 INFO L933 BasicCegarLoop]: 618 mSDtfsCounter, 567 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:39:59,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [567 Valid, 707 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:39:59,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2022-01-11 07:39:59,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1536. [2022-01-11 07:39:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1533 states have (on average 1.3718199608610568) internal successors, (2103), 1535 states have internal predecessors, (2103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:39:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 2103 transitions. [2022-01-11 07:39:59,842 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 2103 transitions. Word has length 51 [2022-01-11 07:39:59,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:39:59,845 INFO L470 AbstractCegarLoop]: Abstraction has 1536 states and 2103 transitions. [2022-01-11 07:39:59,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:39:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 2103 transitions. [2022-01-11 07:39:59,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 07:39:59,851 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:39:59,852 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:39:59,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 07:39:59,852 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:39:59,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:39:59,853 INFO L85 PathProgramCache]: Analyzing trace with hash 717599730, now seen corresponding path program 1 times [2022-01-11 07:39:59,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:39:59,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977665808] [2022-01-11 07:39:59,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:39:59,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:39:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:39:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 07:39:59,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:39:59,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977665808] [2022-01-11 07:39:59,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977665808] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:39:59,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:39:59,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:39:59,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487849172] [2022-01-11 07:39:59,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:39:59,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:39:59,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:39:59,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:39:59,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:39:59,949 INFO L87 Difference]: Start difference. First operand 1536 states and 2103 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:00,090 INFO L93 Difference]: Finished difference Result 3162 states and 4307 transitions. [2022-01-11 07:40:00,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:40:00,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-11 07:40:00,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:00,101 INFO L225 Difference]: With dead ends: 3162 [2022-01-11 07:40:00,101 INFO L226 Difference]: Without dead ends: 2211 [2022-01-11 07:40:00,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:40:00,104 INFO L933 BasicCegarLoop]: 607 mSDtfsCounter, 395 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:00,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 2537 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2022-01-11 07:40:00,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 1560. [2022-01-11 07:40:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1557 states have (on average 1.3545279383429671) internal successors, (2109), 1559 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:00,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2109 transitions. [2022-01-11 07:40:00,195 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2109 transitions. Word has length 52 [2022-01-11 07:40:00,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:00,195 INFO L470 AbstractCegarLoop]: Abstraction has 1560 states and 2109 transitions. [2022-01-11 07:40:00,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:00,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2109 transitions. [2022-01-11 07:40:00,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 07:40:00,196 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:00,197 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:00,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 07:40:00,197 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:00,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:00,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1627067311, now seen corresponding path program 1 times [2022-01-11 07:40:00,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:00,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280220473] [2022-01-11 07:40:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:00,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:00,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:00,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 07:40:00,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:00,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280220473] [2022-01-11 07:40:00,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280220473] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:00,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:00,292 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:40:00,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988123554] [2022-01-11 07:40:00,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:00,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:40:00,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:00,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:40:00,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:40:00,294 INFO L87 Difference]: Start difference. First operand 1560 states and 2109 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:00,455 INFO L93 Difference]: Finished difference Result 3315 states and 4458 transitions. [2022-01-11 07:40:00,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:40:00,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-11 07:40:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:00,463 INFO L225 Difference]: With dead ends: 3315 [2022-01-11 07:40:00,463 INFO L226 Difference]: Without dead ends: 2150 [2022-01-11 07:40:00,465 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:40:00,466 INFO L933 BasicCegarLoop]: 606 mSDtfsCounter, 354 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:00,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 2553 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2022-01-11 07:40:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1578. [2022-01-11 07:40:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1575 states have (on average 1.3377777777777777) internal successors, (2107), 1577 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2107 transitions. [2022-01-11 07:40:00,567 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2107 transitions. Word has length 52 [2022-01-11 07:40:00,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:00,567 INFO L470 AbstractCegarLoop]: Abstraction has 1578 states and 2107 transitions. [2022-01-11 07:40:00,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:00,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2107 transitions. [2022-01-11 07:40:00,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 07:40:00,568 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:00,569 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:00,569 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 07:40:00,569 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:00,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:00,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1615751184, now seen corresponding path program 1 times [2022-01-11 07:40:00,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:00,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950381260] [2022-01-11 07:40:00,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:00,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:00,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:00,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950381260] [2022-01-11 07:40:00,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950381260] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:00,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:00,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 07:40:00,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182893197] [2022-01-11 07:40:00,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:00,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 07:40:00,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:00,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 07:40:00,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 07:40:00,658 INFO L87 Difference]: Start difference. First operand 1578 states and 2107 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:00,824 INFO L93 Difference]: Finished difference Result 1810 states and 2407 transitions. [2022-01-11 07:40:00,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 07:40:00,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-11 07:40:00,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:00,832 INFO L225 Difference]: With dead ends: 1810 [2022-01-11 07:40:00,832 INFO L226 Difference]: Without dead ends: 1808 [2022-01-11 07:40:00,832 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:40:00,833 INFO L933 BasicCegarLoop]: 615 mSDtfsCounter, 1273 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:00,833 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1273 Valid, 703 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-11 07:40:00,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1576. [2022-01-11 07:40:00,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1574 states have (on average 1.3329097839898347) internal successors, (2098), 1575 states have internal predecessors, (2098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:00,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2098 transitions. [2022-01-11 07:40:00,948 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2098 transitions. Word has length 52 [2022-01-11 07:40:00,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:00,948 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 2098 transitions. [2022-01-11 07:40:00,949 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2098 transitions. [2022-01-11 07:40:00,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-11 07:40:00,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:00,950 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:00,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 07:40:00,950 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:00,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:00,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1451321727, now seen corresponding path program 1 times [2022-01-11 07:40:00,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:00,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474662840] [2022-01-11 07:40:00,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:00,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:01,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:01,182 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:01,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474662840] [2022-01-11 07:40:01,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474662840] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 07:40:01,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019904387] [2022-01-11 07:40:01,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:01,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 07:40:01,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 07:40:01,185 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 07:40:01,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 07:40:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:01,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-11 07:40:01,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 07:40:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:01,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 07:40:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:01,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019904387] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 07:40:01,903 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 07:40:01,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-11 07:40:01,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535889746] [2022-01-11 07:40:01,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 07:40:01,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 07:40:01,904 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:01,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 07:40:01,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 07:40:01,905 INFO L87 Difference]: Start difference. First operand 1576 states and 2098 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:02,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:02,492 INFO L93 Difference]: Finished difference Result 3933 states and 5198 transitions. [2022-01-11 07:40:02,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 07:40:02,493 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-01-11 07:40:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:02,507 INFO L225 Difference]: With dead ends: 3933 [2022-01-11 07:40:02,507 INFO L226 Difference]: Without dead ends: 3931 [2022-01-11 07:40:02,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-11 07:40:02,508 INFO L933 BasicCegarLoop]: 766 mSDtfsCounter, 1230 mSDsluCounter, 1898 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 2664 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:02,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1230 Valid, 2664 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2022-01-11 07:40:02,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 2551. [2022-01-11 07:40:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2549 states have (on average 1.3256178893683797) internal successors, (3379), 2550 states have internal predecessors, (3379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 3379 transitions. [2022-01-11 07:40:02,775 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 3379 transitions. Word has length 53 [2022-01-11 07:40:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:02,775 INFO L470 AbstractCegarLoop]: Abstraction has 2551 states and 3379 transitions. [2022-01-11 07:40:02,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 3379 transitions. [2022-01-11 07:40:02,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-11 07:40:02,777 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:02,777 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:02,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 07:40:02,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 07:40:02,992 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:02,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:02,992 INFO L85 PathProgramCache]: Analyzing trace with hash -608300638, now seen corresponding path program 2 times [2022-01-11 07:40:02,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:02,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759438756] [2022-01-11 07:40:02,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:02,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:03,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:03,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:03,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759438756] [2022-01-11 07:40:03,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759438756] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:03,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:03,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:03,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615870142] [2022-01-11 07:40:03,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:03,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:03,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:03,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:03,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:03,037 INFO L87 Difference]: Start difference. First operand 2551 states and 3379 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:03,249 INFO L93 Difference]: Finished difference Result 3645 states and 4824 transitions. [2022-01-11 07:40:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:03,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-11 07:40:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:03,257 INFO L225 Difference]: With dead ends: 3645 [2022-01-11 07:40:03,257 INFO L226 Difference]: Without dead ends: 1905 [2022-01-11 07:40:03,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:03,261 INFO L933 BasicCegarLoop]: 678 mSDtfsCounter, 561 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:03,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [561 Valid, 794 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:03,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2022-01-11 07:40:03,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1889. [2022-01-11 07:40:03,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1887 states have (on average 1.3116057233704292) internal successors, (2475), 1888 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2475 transitions. [2022-01-11 07:40:03,444 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2475 transitions. Word has length 56 [2022-01-11 07:40:03,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:03,444 INFO L470 AbstractCegarLoop]: Abstraction has 1889 states and 2475 transitions. [2022-01-11 07:40:03,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:03,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2475 transitions. [2022-01-11 07:40:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-11 07:40:03,446 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:03,446 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:03,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 07:40:03,446 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:03,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:03,447 INFO L85 PathProgramCache]: Analyzing trace with hash 354334303, now seen corresponding path program 1 times [2022-01-11 07:40:03,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:03,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349732211] [2022-01-11 07:40:03,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:03,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:03,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:03,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349732211] [2022-01-11 07:40:03,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349732211] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:03,484 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:03,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:03,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965810322] [2022-01-11 07:40:03,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:03,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:03,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:03,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:03,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:03,486 INFO L87 Difference]: Start difference. First operand 1889 states and 2475 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:03,773 INFO L93 Difference]: Finished difference Result 4376 states and 5623 transitions. [2022-01-11 07:40:03,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:03,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-01-11 07:40:03,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:03,783 INFO L225 Difference]: With dead ends: 4376 [2022-01-11 07:40:03,783 INFO L226 Difference]: Without dead ends: 2274 [2022-01-11 07:40:03,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:03,786 INFO L933 BasicCegarLoop]: 701 mSDtfsCounter, 89 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:03,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 1298 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:03,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2022-01-11 07:40:03,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2274. [2022-01-11 07:40:03,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 2272 states have (on average 1.2913732394366197) internal successors, (2934), 2273 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 2934 transitions. [2022-01-11 07:40:03,967 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 2934 transitions. Word has length 60 [2022-01-11 07:40:03,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:03,967 INFO L470 AbstractCegarLoop]: Abstraction has 2274 states and 2934 transitions. [2022-01-11 07:40:03,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 2934 transitions. [2022-01-11 07:40:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 07:40:03,969 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:03,969 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] [2022-01-11 07:40:03,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 07:40:03,970 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:03,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:03,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1360571065, now seen corresponding path program 1 times [2022-01-11 07:40:03,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:03,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136966142] [2022-01-11 07:40:03,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:03,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:03,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:03,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136966142] [2022-01-11 07:40:03,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136966142] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:03,997 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:03,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:03,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891507397] [2022-01-11 07:40:03,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:03,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:03,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:03,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:03,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:03,998 INFO L87 Difference]: Start difference. First operand 2274 states and 2934 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:04,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:04,223 INFO L93 Difference]: Finished difference Result 2819 states and 3747 transitions. [2022-01-11 07:40:04,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:04,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 07:40:04,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:04,232 INFO L225 Difference]: With dead ends: 2819 [2022-01-11 07:40:04,232 INFO L226 Difference]: Without dead ends: 2509 [2022-01-11 07:40:04,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:04,234 INFO L933 BasicCegarLoop]: 618 mSDtfsCounter, 551 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:04,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 1003 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:04,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2022-01-11 07:40:04,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2507. [2022-01-11 07:40:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2505 states have (on average 1.3085828343313373) internal successors, (3278), 2506 states have internal predecessors, (3278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3278 transitions. [2022-01-11 07:40:04,468 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3278 transitions. Word has length 66 [2022-01-11 07:40:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:04,469 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3278 transitions. [2022-01-11 07:40:04,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:04,469 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3278 transitions. [2022-01-11 07:40:04,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 07:40:04,471 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:04,471 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] [2022-01-11 07:40:04,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 07:40:04,471 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:04,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:04,472 INFO L85 PathProgramCache]: Analyzing trace with hash -95469209, now seen corresponding path program 1 times [2022-01-11 07:40:04,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:04,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165223715] [2022-01-11 07:40:04,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:04,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:04,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:04,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165223715] [2022-01-11 07:40:04,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165223715] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:04,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:04,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:04,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684639252] [2022-01-11 07:40:04,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:04,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:04,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:04,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:04,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:04,502 INFO L87 Difference]: Start difference. First operand 2507 states and 3278 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:04,700 INFO L93 Difference]: Finished difference Result 3049 states and 4085 transitions. [2022-01-11 07:40:04,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:04,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 07:40:04,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:04,710 INFO L225 Difference]: With dead ends: 3049 [2022-01-11 07:40:04,710 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:40:04,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:04,713 INFO L933 BasicCegarLoop]: 597 mSDtfsCounter, 591 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:04,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [591 Valid, 597 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:04,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:40:04,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:40:04,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2505 states have (on average 1.3053892215568863) internal successors, (3270), 2506 states have internal predecessors, (3270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:04,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3270 transitions. [2022-01-11 07:40:04,977 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3270 transitions. Word has length 66 [2022-01-11 07:40:04,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:04,978 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3270 transitions. [2022-01-11 07:40:04,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:04,978 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3270 transitions. [2022-01-11 07:40:04,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 07:40:04,979 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:04,979 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:04,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 07:40:04,980 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:04,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:04,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1440132793, now seen corresponding path program 1 times [2022-01-11 07:40:04,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:04,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662287911] [2022-01-11 07:40:04,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:04,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:04,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:05,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:05,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662287911] [2022-01-11 07:40:05,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662287911] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:05,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:05,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:05,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814319313] [2022-01-11 07:40:05,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:05,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:05,012 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:05,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:05,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:05,013 INFO L87 Difference]: Start difference. First operand 2507 states and 3270 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:05,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:05,238 INFO L93 Difference]: Finished difference Result 3048 states and 4068 transitions. [2022-01-11 07:40:05,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:05,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 07:40:05,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:05,261 INFO L225 Difference]: With dead ends: 3048 [2022-01-11 07:40:05,261 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:40:05,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:05,263 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 585 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:05,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [585 Valid, 592 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:05,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:40:05,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:40:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2505 states have (on average 1.3021956087824351) internal successors, (3262), 2506 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:05,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3262 transitions. [2022-01-11 07:40:05,479 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3262 transitions. Word has length 66 [2022-01-11 07:40:05,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:05,480 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3262 transitions. [2022-01-11 07:40:05,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3262 transitions. [2022-01-11 07:40:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 07:40:05,481 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:05,482 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] [2022-01-11 07:40:05,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 07:40:05,482 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:05,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:05,482 INFO L85 PathProgramCache]: Analyzing trace with hash -790772377, now seen corresponding path program 1 times [2022-01-11 07:40:05,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:05,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494956588] [2022-01-11 07:40:05,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:05,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:05,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:05,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:05,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494956588] [2022-01-11 07:40:05,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494956588] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:05,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:05,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:05,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479537718] [2022-01-11 07:40:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:05,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:05,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:05,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:05,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:05,517 INFO L87 Difference]: Start difference. First operand 2507 states and 3262 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:05,746 INFO L93 Difference]: Finished difference Result 3047 states and 4051 transitions. [2022-01-11 07:40:05,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:05,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 07:40:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:05,752 INFO L225 Difference]: With dead ends: 3047 [2022-01-11 07:40:05,752 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:40:05,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:05,755 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 579 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:05,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 587 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:40:05,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:40:05,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2505 states have (on average 1.299001996007984) internal successors, (3254), 2506 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:06,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3254 transitions. [2022-01-11 07:40:06,005 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3254 transitions. Word has length 66 [2022-01-11 07:40:06,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:06,005 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3254 transitions. [2022-01-11 07:40:06,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3254 transitions. [2022-01-11 07:40:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 07:40:06,008 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:06,008 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] [2022-01-11 07:40:06,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 07:40:06,008 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:06,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:06,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1169837383, now seen corresponding path program 1 times [2022-01-11 07:40:06,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:06,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263031264] [2022-01-11 07:40:06,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:06,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:06,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:06,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263031264] [2022-01-11 07:40:06,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263031264] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:06,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:06,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:06,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585546007] [2022-01-11 07:40:06,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:06,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:06,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:06,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:06,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:06,042 INFO L87 Difference]: Start difference. First operand 2507 states and 3254 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:06,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:06,325 INFO L93 Difference]: Finished difference Result 3046 states and 4034 transitions. [2022-01-11 07:40:06,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:06,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 07:40:06,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:06,330 INFO L225 Difference]: With dead ends: 3046 [2022-01-11 07:40:06,330 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:40:06,332 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:06,332 INFO L933 BasicCegarLoop]: 570 mSDtfsCounter, 525 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:06,333 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 608 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:06,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:40:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:40:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2505 states have (on average 1.291816367265469) internal successors, (3236), 2506 states have internal predecessors, (3236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3236 transitions. [2022-01-11 07:40:06,575 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3236 transitions. Word has length 66 [2022-01-11 07:40:06,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:06,575 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3236 transitions. [2022-01-11 07:40:06,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3236 transitions. [2022-01-11 07:40:06,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 07:40:06,577 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:06,577 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] [2022-01-11 07:40:06,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 07:40:06,577 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:06,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:06,578 INFO L85 PathProgramCache]: Analyzing trace with hash 698780390, now seen corresponding path program 1 times [2022-01-11 07:40:06,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:06,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409639046] [2022-01-11 07:40:06,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:06,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:06,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:06,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409639046] [2022-01-11 07:40:06,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409639046] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:06,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:06,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:06,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434862132] [2022-01-11 07:40:06,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:06,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:06,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:06,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:06,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:06,607 INFO L87 Difference]: Start difference. First operand 2507 states and 3236 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:06,839 INFO L93 Difference]: Finished difference Result 3045 states and 3997 transitions. [2022-01-11 07:40:06,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:06,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 07:40:06,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:06,844 INFO L225 Difference]: With dead ends: 3045 [2022-01-11 07:40:06,844 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:40:06,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:06,846 INFO L933 BasicCegarLoop]: 559 mSDtfsCounter, 514 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:06,846 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [514 Valid, 596 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:06,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:40:07,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:40:07,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2505 states have (on average 1.284630738522954) internal successors, (3218), 2506 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3218 transitions. [2022-01-11 07:40:07,053 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3218 transitions. Word has length 66 [2022-01-11 07:40:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:07,054 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3218 transitions. [2022-01-11 07:40:07,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3218 transitions. [2022-01-11 07:40:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 07:40:07,056 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:07,056 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] [2022-01-11 07:40:07,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 07:40:07,056 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:07,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:07,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1822398341, now seen corresponding path program 1 times [2022-01-11 07:40:07,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:07,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095751790] [2022-01-11 07:40:07,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:07,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:07,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-11 07:40:07,082 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:07,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095751790] [2022-01-11 07:40:07,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095751790] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:07,083 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:07,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:07,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56809322] [2022-01-11 07:40:07,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:07,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:07,083 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:07,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:07,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:07,084 INFO L87 Difference]: Start difference. First operand 2507 states and 3218 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:07,301 INFO L93 Difference]: Finished difference Result 3044 states and 3960 transitions. [2022-01-11 07:40:07,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:07,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 07:40:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:07,307 INFO L225 Difference]: With dead ends: 3044 [2022-01-11 07:40:07,307 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:40:07,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:07,309 INFO L933 BasicCegarLoop]: 548 mSDtfsCounter, 503 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:07,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [503 Valid, 584 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:40:07,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:40:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2505 states have (on average 1.2774451097804391) internal successors, (3200), 2506 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:07,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3200 transitions. [2022-01-11 07:40:07,531 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3200 transitions. Word has length 66 [2022-01-11 07:40:07,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:07,531 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3200 transitions. [2022-01-11 07:40:07,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:07,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3200 transitions. [2022-01-11 07:40:07,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 07:40:07,535 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:07,535 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] [2022-01-11 07:40:07,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 07:40:07,535 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:07,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:07,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1878301788, now seen corresponding path program 1 times [2022-01-11 07:40:07,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:07,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545652133] [2022-01-11 07:40:07,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:07,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:07,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:07,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:07,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:07,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545652133] [2022-01-11 07:40:07,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545652133] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:07,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:07,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:07,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988079303] [2022-01-11 07:40:07,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:07,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:07,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:07,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:07,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:07,563 INFO L87 Difference]: Start difference. First operand 2507 states and 3200 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:07,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:07,788 INFO L93 Difference]: Finished difference Result 3043 states and 3923 transitions. [2022-01-11 07:40:07,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:07,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 07:40:07,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:07,793 INFO L225 Difference]: With dead ends: 3043 [2022-01-11 07:40:07,793 INFO L226 Difference]: Without dead ends: 2507 [2022-01-11 07:40:07,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:07,795 INFO L933 BasicCegarLoop]: 537 mSDtfsCounter, 492 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:07,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [492 Valid, 572 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:07,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-11 07:40:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-11 07:40:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2505 states have (on average 1.2702594810379242) internal successors, (3182), 2506 states have internal predecessors, (3182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3182 transitions. [2022-01-11 07:40:08,018 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3182 transitions. Word has length 66 [2022-01-11 07:40:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:08,018 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3182 transitions. [2022-01-11 07:40:08,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:08,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3182 transitions. [2022-01-11 07:40:08,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 07:40:08,020 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:08,020 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:08,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 07:40:08,021 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:08,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:08,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2082000579, now seen corresponding path program 1 times [2022-01-11 07:40:08,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:08,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699162123] [2022-01-11 07:40:08,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:08,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:08,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:08,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699162123] [2022-01-11 07:40:08,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699162123] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:08,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:08,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:40:08,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466766114] [2022-01-11 07:40:08,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:08,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:40:08,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:08,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:40:08,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:40:08,063 INFO L87 Difference]: Start difference. First operand 2507 states and 3182 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:08,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:08,382 INFO L93 Difference]: Finished difference Result 3412 states and 4393 transitions. [2022-01-11 07:40:08,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:40:08,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 07:40:08,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:08,387 INFO L225 Difference]: With dead ends: 3412 [2022-01-11 07:40:08,387 INFO L226 Difference]: Without dead ends: 2897 [2022-01-11 07:40:08,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:40:08,389 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 946 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:08,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [946 Valid, 1847 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 07:40:08,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2022-01-11 07:40:08,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2513. [2022-01-11 07:40:08,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2511 states have (on average 1.26563122262047) internal successors, (3178), 2512 states have internal predecessors, (3178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3178 transitions. [2022-01-11 07:40:08,650 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3178 transitions. Word has length 66 [2022-01-11 07:40:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:08,650 INFO L470 AbstractCegarLoop]: Abstraction has 2513 states and 3178 transitions. [2022-01-11 07:40:08,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3178 transitions. [2022-01-11 07:40:08,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 07:40:08,652 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:08,652 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] [2022-01-11 07:40:08,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 07:40:08,653 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:08,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1862166780, now seen corresponding path program 1 times [2022-01-11 07:40:08,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:08,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36476965] [2022-01-11 07:40:08,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:08,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:08,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:08,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:08,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36476965] [2022-01-11 07:40:08,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36476965] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:08,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:08,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 07:40:08,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859328602] [2022-01-11 07:40:08,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:08,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 07:40:08,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:08,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 07:40:08,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 07:40:08,700 INFO L87 Difference]: Start difference. First operand 2513 states and 3178 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:09,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:09,033 INFO L93 Difference]: Finished difference Result 3465 states and 4431 transitions. [2022-01-11 07:40:09,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 07:40:09,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 07:40:09,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:09,041 INFO L225 Difference]: With dead ends: 3465 [2022-01-11 07:40:09,041 INFO L226 Difference]: Without dead ends: 2951 [2022-01-11 07:40:09,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 07:40:09,043 INFO L933 BasicCegarLoop]: 522 mSDtfsCounter, 854 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1936 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:09,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [854 Valid, 1936 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 07:40:09,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2022-01-11 07:40:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2519. [2022-01-11 07:40:09,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2517 states have (on average 1.2610250297973777) internal successors, (3174), 2518 states have internal predecessors, (3174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 3174 transitions. [2022-01-11 07:40:09,251 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 3174 transitions. Word has length 66 [2022-01-11 07:40:09,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:09,252 INFO L470 AbstractCegarLoop]: Abstraction has 2519 states and 3174 transitions. [2022-01-11 07:40:09,252 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:09,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 3174 transitions. [2022-01-11 07:40:09,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 07:40:09,254 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:09,254 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] [2022-01-11 07:40:09,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 07:40:09,254 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:09,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:09,254 INFO L85 PathProgramCache]: Analyzing trace with hash 355591173, now seen corresponding path program 1 times [2022-01-11 07:40:09,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:09,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273137527] [2022-01-11 07:40:09,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:09,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:09,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:09,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273137527] [2022-01-11 07:40:09,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273137527] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:09,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:09,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:09,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091576048] [2022-01-11 07:40:09,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:09,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:09,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:09,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:09,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:09,286 INFO L87 Difference]: Start difference. First operand 2519 states and 3174 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:09,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:09,545 INFO L93 Difference]: Finished difference Result 3555 states and 4498 transitions. [2022-01-11 07:40:09,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:09,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2022-01-11 07:40:09,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:09,550 INFO L225 Difference]: With dead ends: 3555 [2022-01-11 07:40:09,550 INFO L226 Difference]: Without dead ends: 3009 [2022-01-11 07:40:09,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:09,551 INFO L933 BasicCegarLoop]: 526 mSDtfsCounter, 451 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:09,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 850 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2022-01-11 07:40:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 2955. [2022-01-11 07:40:09,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2955 states, 2953 states have (on average 1.2607517778530308) internal successors, (3723), 2954 states have internal predecessors, (3723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 3723 transitions. [2022-01-11 07:40:09,802 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 3723 transitions. Word has length 66 [2022-01-11 07:40:09,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:09,802 INFO L470 AbstractCegarLoop]: Abstraction has 2955 states and 3723 transitions. [2022-01-11 07:40:09,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3723 transitions. [2022-01-11 07:40:09,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-11 07:40:09,804 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:09,805 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:09,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 07:40:09,805 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:09,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:09,805 INFO L85 PathProgramCache]: Analyzing trace with hash 540485178, now seen corresponding path program 1 times [2022-01-11 07:40:09,805 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:09,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987084880] [2022-01-11 07:40:09,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:09,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 07:40:09,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:09,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987084880] [2022-01-11 07:40:09,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987084880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:09,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:09,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:09,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344288334] [2022-01-11 07:40:09,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:09,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:09,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:09,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:09,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:09,836 INFO L87 Difference]: Start difference. First operand 2955 states and 3723 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:10,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:10,095 INFO L93 Difference]: Finished difference Result 4818 states and 6075 transitions. [2022-01-11 07:40:10,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:10,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-01-11 07:40:10,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:10,101 INFO L225 Difference]: With dead ends: 4818 [2022-01-11 07:40:10,101 INFO L226 Difference]: Without dead ends: 2955 [2022-01-11 07:40:10,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:10,106 INFO L933 BasicCegarLoop]: 535 mSDtfsCounter, 478 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:10,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [478 Valid, 619 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:10,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-01-11 07:40:10,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2955. [2022-01-11 07:40:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2955 states, 2953 states have (on average 1.2472062309515746) internal successors, (3683), 2954 states have internal predecessors, (3683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 3683 transitions. [2022-01-11 07:40:10,390 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 3683 transitions. Word has length 68 [2022-01-11 07:40:10,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:10,390 INFO L470 AbstractCegarLoop]: Abstraction has 2955 states and 3683 transitions. [2022-01-11 07:40:10,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:10,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3683 transitions. [2022-01-11 07:40:10,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-11 07:40:10,392 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:10,392 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:10,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 07:40:10,393 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:10,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:10,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1416385341, now seen corresponding path program 1 times [2022-01-11 07:40:10,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:10,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708768358] [2022-01-11 07:40:10,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:10,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 07:40:10,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:10,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708768358] [2022-01-11 07:40:10,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708768358] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:10,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:10,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:10,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456220911] [2022-01-11 07:40:10,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:10,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:10,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:10,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:10,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:10,428 INFO L87 Difference]: Start difference. First operand 2955 states and 3683 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:10,650 INFO L93 Difference]: Finished difference Result 4254 states and 5317 transitions. [2022-01-11 07:40:10,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:10,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-01-11 07:40:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:10,655 INFO L225 Difference]: With dead ends: 4254 [2022-01-11 07:40:10,655 INFO L226 Difference]: Without dead ends: 2629 [2022-01-11 07:40:10,658 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:10,659 INFO L933 BasicCegarLoop]: 618 mSDtfsCounter, 99 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:10,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 1135 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:10,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2022-01-11 07:40:10,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2627. [2022-01-11 07:40:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2625 states have (on average 1.2377142857142858) internal successors, (3249), 2626 states have internal predecessors, (3249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:10,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3249 transitions. [2022-01-11 07:40:10,917 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3249 transitions. Word has length 69 [2022-01-11 07:40:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:10,917 INFO L470 AbstractCegarLoop]: Abstraction has 2627 states and 3249 transitions. [2022-01-11 07:40:10,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3249 transitions. [2022-01-11 07:40:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-11 07:40:10,920 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:10,920 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:10,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 07:40:10,921 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:10,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:10,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1946897006, now seen corresponding path program 1 times [2022-01-11 07:40:10,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:10,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102082868] [2022-01-11 07:40:10,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:10,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-11 07:40:10,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:10,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102082868] [2022-01-11 07:40:10,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102082868] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:10,953 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:10,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:10,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546763378] [2022-01-11 07:40:10,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:10,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:10,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:10,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:10,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:10,954 INFO L87 Difference]: Start difference. First operand 2627 states and 3249 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:11,287 INFO L93 Difference]: Finished difference Result 4271 states and 5353 transitions. [2022-01-11 07:40:11,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:11,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-01-11 07:40:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:11,294 INFO L225 Difference]: With dead ends: 4271 [2022-01-11 07:40:11,294 INFO L226 Difference]: Without dead ends: 2903 [2022-01-11 07:40:11,297 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:11,297 INFO L933 BasicCegarLoop]: 529 mSDtfsCounter, 509 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:11,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 617 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2022-01-11 07:40:11,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2864. [2022-01-11 07:40:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2864 states, 2862 states have (on average 1.253319357092942) internal successors, (3587), 2863 states have internal predecessors, (3587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 3587 transitions. [2022-01-11 07:40:11,561 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 3587 transitions. Word has length 100 [2022-01-11 07:40:11,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:11,561 INFO L470 AbstractCegarLoop]: Abstraction has 2864 states and 3587 transitions. [2022-01-11 07:40:11,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:11,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 3587 transitions. [2022-01-11 07:40:11,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-11 07:40:11,563 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:11,564 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] [2022-01-11 07:40:11,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 07:40:11,564 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:11,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:11,564 INFO L85 PathProgramCache]: Analyzing trace with hash 329541292, now seen corresponding path program 1 times [2022-01-11 07:40:11,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:11,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684785698] [2022-01-11 07:40:11,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:11,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:11,601 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:11,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684785698] [2022-01-11 07:40:11,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684785698] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:11,601 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:11,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:11,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624602903] [2022-01-11 07:40:11,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:11,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:11,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:11,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:11,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:11,603 INFO L87 Difference]: Start difference. First operand 2864 states and 3587 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:11,901 INFO L93 Difference]: Finished difference Result 4728 states and 5958 transitions. [2022-01-11 07:40:11,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:11,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-01-11 07:40:11,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:11,907 INFO L225 Difference]: With dead ends: 4728 [2022-01-11 07:40:11,907 INFO L226 Difference]: Without dead ends: 3752 [2022-01-11 07:40:11,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:11,910 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 448 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:11,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [448 Valid, 837 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:11,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2022-01-11 07:40:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 3650. [2022-01-11 07:40:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 3648 states have (on average 1.2552083333333333) internal successors, (4579), 3649 states have internal predecessors, (4579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 4579 transitions. [2022-01-11 07:40:12,228 INFO L78 Accepts]: Start accepts. Automaton has 3650 states and 4579 transitions. Word has length 106 [2022-01-11 07:40:12,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:12,228 INFO L470 AbstractCegarLoop]: Abstraction has 3650 states and 4579 transitions. [2022-01-11 07:40:12,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 4579 transitions. [2022-01-11 07:40:12,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-11 07:40:12,232 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:12,232 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] [2022-01-11 07:40:12,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 07:40:12,232 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:12,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:12,233 INFO L85 PathProgramCache]: Analyzing trace with hash -188961109, now seen corresponding path program 1 times [2022-01-11 07:40:12,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:12,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198658438] [2022-01-11 07:40:12,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:12,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:12,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:12,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198658438] [2022-01-11 07:40:12,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198658438] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:12,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:12,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:12,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620590555] [2022-01-11 07:40:12,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:12,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:12,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:12,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:12,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:12,291 INFO L87 Difference]: Start difference. First operand 3650 states and 4579 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:12,774 INFO L93 Difference]: Finished difference Result 7035 states and 8818 transitions. [2022-01-11 07:40:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:12,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-01-11 07:40:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:12,781 INFO L225 Difference]: With dead ends: 7035 [2022-01-11 07:40:12,781 INFO L226 Difference]: Without dead ends: 5301 [2022-01-11 07:40:12,784 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:12,784 INFO L933 BasicCegarLoop]: 594 mSDtfsCounter, 457 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:12,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 970 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:12,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2022-01-11 07:40:13,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 5215. [2022-01-11 07:40:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5215 states, 5213 states have (on average 1.2441971993094187) internal successors, (6486), 5214 states have internal predecessors, (6486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:13,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5215 states to 5215 states and 6486 transitions. [2022-01-11 07:40:13,098 INFO L78 Accepts]: Start accepts. Automaton has 5215 states and 6486 transitions. Word has length 106 [2022-01-11 07:40:13,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:13,099 INFO L470 AbstractCegarLoop]: Abstraction has 5215 states and 6486 transitions. [2022-01-11 07:40:13,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:13,099 INFO L276 IsEmpty]: Start isEmpty. Operand 5215 states and 6486 transitions. [2022-01-11 07:40:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-11 07:40:13,102 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:13,102 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] [2022-01-11 07:40:13,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 07:40:13,103 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:13,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:13,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1023363636, now seen corresponding path program 1 times [2022-01-11 07:40:13,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:13,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037147545] [2022-01-11 07:40:13,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:13,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:13,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:13,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 07:40:13,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:13,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037147545] [2022-01-11 07:40:13,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037147545] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:13,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:13,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:13,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592985576] [2022-01-11 07:40:13,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:13,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:13,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:13,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:13,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:13,127 INFO L87 Difference]: Start difference. First operand 5215 states and 6486 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:13,502 INFO L93 Difference]: Finished difference Result 8491 states and 10565 transitions. [2022-01-11 07:40:13,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:13,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-01-11 07:40:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:13,509 INFO L225 Difference]: With dead ends: 8491 [2022-01-11 07:40:13,509 INFO L226 Difference]: Without dead ends: 5168 [2022-01-11 07:40:13,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:13,515 INFO L933 BasicCegarLoop]: 520 mSDtfsCounter, 396 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:13,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 640 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:13,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2022-01-11 07:40:13,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 5168. [2022-01-11 07:40:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5168 states, 5166 states have (on average 1.2450638792102207) internal successors, (6432), 5167 states have internal predecessors, (6432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5168 states to 5168 states and 6432 transitions. [2022-01-11 07:40:13,887 INFO L78 Accepts]: Start accepts. Automaton has 5168 states and 6432 transitions. Word has length 106 [2022-01-11 07:40:13,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:13,887 INFO L470 AbstractCegarLoop]: Abstraction has 5168 states and 6432 transitions. [2022-01-11 07:40:13,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:13,887 INFO L276 IsEmpty]: Start isEmpty. Operand 5168 states and 6432 transitions. [2022-01-11 07:40:13,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-11 07:40:13,890 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:13,890 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] [2022-01-11 07:40:13,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 07:40:13,891 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:13,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:13,891 INFO L85 PathProgramCache]: Analyzing trace with hash 18795464, now seen corresponding path program 1 times [2022-01-11 07:40:13,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:13,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150297935] [2022-01-11 07:40:13,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:13,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:13,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-11 07:40:13,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:13,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150297935] [2022-01-11 07:40:13,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150297935] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:13,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:13,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:13,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663708850] [2022-01-11 07:40:13,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:13,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:13,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:13,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:13,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:13,930 INFO L87 Difference]: Start difference. First operand 5168 states and 6432 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:14,565 INFO L93 Difference]: Finished difference Result 11086 states and 13773 transitions. [2022-01-11 07:40:14,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:14,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-01-11 07:40:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:14,574 INFO L225 Difference]: With dead ends: 11086 [2022-01-11 07:40:14,574 INFO L226 Difference]: Without dead ends: 7834 [2022-01-11 07:40:14,577 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:14,577 INFO L933 BasicCegarLoop]: 620 mSDtfsCounter, 373 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:14,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 1000 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:14,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7834 states. [2022-01-11 07:40:15,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7834 to 7832. [2022-01-11 07:40:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7832 states, 7830 states have (on average 1.2361430395913156) internal successors, (9679), 7831 states have internal predecessors, (9679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:15,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7832 states to 7832 states and 9679 transitions. [2022-01-11 07:40:15,111 INFO L78 Accepts]: Start accepts. Automaton has 7832 states and 9679 transitions. Word has length 107 [2022-01-11 07:40:15,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:15,112 INFO L470 AbstractCegarLoop]: Abstraction has 7832 states and 9679 transitions. [2022-01-11 07:40:15,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:15,112 INFO L276 IsEmpty]: Start isEmpty. Operand 7832 states and 9679 transitions. [2022-01-11 07:40:15,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-11 07:40:15,116 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:15,116 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] [2022-01-11 07:40:15,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 07:40:15,117 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:15,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:15,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1179939801, now seen corresponding path program 1 times [2022-01-11 07:40:15,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:15,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432495723] [2022-01-11 07:40:15,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:15,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 07:40:15,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:15,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432495723] [2022-01-11 07:40:15,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432495723] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:15,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:15,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:15,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47097135] [2022-01-11 07:40:15,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:15,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:15,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:15,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:15,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:15,143 INFO L87 Difference]: Start difference. First operand 7832 states and 9679 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:15,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:15,600 INFO L93 Difference]: Finished difference Result 13702 states and 16928 transitions. [2022-01-11 07:40:15,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:15,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 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 107 [2022-01-11 07:40:15,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:15,608 INFO L225 Difference]: With dead ends: 13702 [2022-01-11 07:40:15,609 INFO L226 Difference]: Without dead ends: 7786 [2022-01-11 07:40:15,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:15,616 INFO L933 BasicCegarLoop]: 519 mSDtfsCounter, 394 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:15,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 639 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:15,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7786 states. [2022-01-11 07:40:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7786 to 7786. [2022-01-11 07:40:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7786 states, 7784 states have (on average 1.2367677286742036) internal successors, (9627), 7785 states have internal predecessors, (9627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7786 states to 7786 states and 9627 transitions. [2022-01-11 07:40:16,086 INFO L78 Accepts]: Start accepts. Automaton has 7786 states and 9627 transitions. Word has length 107 [2022-01-11 07:40:16,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:16,087 INFO L470 AbstractCegarLoop]: Abstraction has 7786 states and 9627 transitions. [2022-01-11 07:40:16,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 7786 states and 9627 transitions. [2022-01-11 07:40:16,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-11 07:40:16,090 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:16,090 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] [2022-01-11 07:40:16,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 07:40:16,091 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:16,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:16,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1895121984, now seen corresponding path program 1 times [2022-01-11 07:40:16,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:16,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402784264] [2022-01-11 07:40:16,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:16,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:16,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:16,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402784264] [2022-01-11 07:40:16,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402784264] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:16,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:16,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:16,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698952027] [2022-01-11 07:40:16,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:16,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:16,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:16,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:16,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:16,131 INFO L87 Difference]: Start difference. First operand 7786 states and 9627 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:16,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:16,913 INFO L93 Difference]: Finished difference Result 18451 states and 22782 transitions. [2022-01-11 07:40:16,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:16,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2022-01-11 07:40:16,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:16,925 INFO L225 Difference]: With dead ends: 18451 [2022-01-11 07:40:16,925 INFO L226 Difference]: Without dead ends: 12581 [2022-01-11 07:40:16,929 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:16,930 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 378 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:16,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 966 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:16,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12581 states. [2022-01-11 07:40:17,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12581 to 12579. [2022-01-11 07:40:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12579 states, 12577 states have (on average 1.2305001192653255) internal successors, (15476), 12578 states have internal predecessors, (15476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:17,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12579 states to 12579 states and 15476 transitions. [2022-01-11 07:40:17,781 INFO L78 Accepts]: Start accepts. Automaton has 12579 states and 15476 transitions. Word has length 108 [2022-01-11 07:40:17,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:17,781 INFO L470 AbstractCegarLoop]: Abstraction has 12579 states and 15476 transitions. [2022-01-11 07:40:17,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand 12579 states and 15476 transitions. [2022-01-11 07:40:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-11 07:40:17,786 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:17,787 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] [2022-01-11 07:40:17,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 07:40:17,787 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:17,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:17,788 INFO L85 PathProgramCache]: Analyzing trace with hash 696386719, now seen corresponding path program 1 times [2022-01-11 07:40:17,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:17,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896098861] [2022-01-11 07:40:17,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:17,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 07:40:17,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:17,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896098861] [2022-01-11 07:40:17,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896098861] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:17,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:17,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:17,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563413708] [2022-01-11 07:40:17,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:17,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:17,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:17,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:17,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:17,817 INFO L87 Difference]: Start difference. First operand 12579 states and 15476 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:18,605 INFO L93 Difference]: Finished difference Result 23197 states and 28525 transitions. [2022-01-11 07:40:18,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:18,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 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 108 [2022-01-11 07:40:18,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:18,626 INFO L225 Difference]: With dead ends: 23197 [2022-01-11 07:40:18,626 INFO L226 Difference]: Without dead ends: 12534 [2022-01-11 07:40:18,644 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:18,645 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 392 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:18,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 638 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:18,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12534 states. [2022-01-11 07:40:19,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12534 to 12534. [2022-01-11 07:40:19,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12534 states, 12532 states have (on average 1.2309288222151293) internal successors, (15426), 12533 states have internal predecessors, (15426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:19,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12534 states to 12534 states and 15426 transitions. [2022-01-11 07:40:19,529 INFO L78 Accepts]: Start accepts. Automaton has 12534 states and 15426 transitions. Word has length 108 [2022-01-11 07:40:19,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:19,529 INFO L470 AbstractCegarLoop]: Abstraction has 12534 states and 15426 transitions. [2022-01-11 07:40:19,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:19,529 INFO L276 IsEmpty]: Start isEmpty. Operand 12534 states and 15426 transitions. [2022-01-11 07:40:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-11 07:40:19,534 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:19,534 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] [2022-01-11 07:40:19,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 07:40:19,535 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:19,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:19,535 INFO L85 PathProgramCache]: Analyzing trace with hash 827617335, now seen corresponding path program 1 times [2022-01-11 07:40:19,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:19,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251394938] [2022-01-11 07:40:19,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:19,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:19,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:19,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:19,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251394938] [2022-01-11 07:40:19,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251394938] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:19,578 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:19,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:19,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828295089] [2022-01-11 07:40:19,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:19,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:19,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:19,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:19,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:19,579 INFO L87 Difference]: Start difference. First operand 12534 states and 15426 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:20,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:20,974 INFO L93 Difference]: Finished difference Result 32520 states and 39927 transitions. [2022-01-11 07:40:20,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:20,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2022-01-11 07:40:20,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:21,000 INFO L225 Difference]: With dead ends: 32520 [2022-01-11 07:40:21,000 INFO L226 Difference]: Without dead ends: 21902 [2022-01-11 07:40:21,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:21,009 INFO L933 BasicCegarLoop]: 847 mSDtfsCounter, 327 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:21,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 1345 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21902 states. [2022-01-11 07:40:22,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21902 to 21902. [2022-01-11 07:40:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21902 states, 21900 states have (on average 1.2156164383561643) internal successors, (26622), 21901 states have internal predecessors, (26622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21902 states to 21902 states and 26622 transitions. [2022-01-11 07:40:22,438 INFO L78 Accepts]: Start accepts. Automaton has 21902 states and 26622 transitions. Word has length 109 [2022-01-11 07:40:22,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:22,439 INFO L470 AbstractCegarLoop]: Abstraction has 21902 states and 26622 transitions. [2022-01-11 07:40:22,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:22,439 INFO L276 IsEmpty]: Start isEmpty. Operand 21902 states and 26622 transitions. [2022-01-11 07:40:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 07:40:22,444 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:22,444 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:22,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 07:40:22,445 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:22,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1600075552, now seen corresponding path program 1 times [2022-01-11 07:40:22,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:22,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495015537] [2022-01-11 07:40:22,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:22,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 07:40:22,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:22,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495015537] [2022-01-11 07:40:22,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495015537] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:22,481 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:22,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:22,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920623415] [2022-01-11 07:40:22,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:22,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:22,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:22,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:22,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:22,482 INFO L87 Difference]: Start difference. First operand 21902 states and 26622 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:23,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:23,819 INFO L93 Difference]: Finished difference Result 24079 states and 29423 transitions. [2022-01-11 07:40:23,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:23,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-01-11 07:40:23,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:23,842 INFO L225 Difference]: With dead ends: 24079 [2022-01-11 07:40:23,842 INFO L226 Difference]: Without dead ends: 22478 [2022-01-11 07:40:23,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:23,849 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 477 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:23,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 534 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:23,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22478 states. [2022-01-11 07:40:25,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22478 to 22478. [2022-01-11 07:40:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22478 states, 22476 states have (on average 1.2159636946075814) internal successors, (27330), 22477 states have internal predecessors, (27330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:25,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22478 states to 22478 states and 27330 transitions. [2022-01-11 07:40:25,293 INFO L78 Accepts]: Start accepts. Automaton has 22478 states and 27330 transitions. Word has length 110 [2022-01-11 07:40:25,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:25,293 INFO L470 AbstractCegarLoop]: Abstraction has 22478 states and 27330 transitions. [2022-01-11 07:40:25,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:25,293 INFO L276 IsEmpty]: Start isEmpty. Operand 22478 states and 27330 transitions. [2022-01-11 07:40:25,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-11 07:40:25,299 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:25,299 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:25,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 07:40:25,299 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:25,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1840615681, now seen corresponding path program 1 times [2022-01-11 07:40:25,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:25,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924203567] [2022-01-11 07:40:25,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:25,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:25,334 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 07:40:25,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:25,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924203567] [2022-01-11 07:40:25,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924203567] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:25,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:25,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:25,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327186819] [2022-01-11 07:40:25,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:25,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:25,335 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:25,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:25,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:25,335 INFO L87 Difference]: Start difference. First operand 22478 states and 27330 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:26,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:26,700 INFO L93 Difference]: Finished difference Result 23241 states and 28275 transitions. [2022-01-11 07:40:26,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:26,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-01-11 07:40:26,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:26,724 INFO L225 Difference]: With dead ends: 23241 [2022-01-11 07:40:26,724 INFO L226 Difference]: Without dead ends: 21064 [2022-01-11 07:40:26,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:26,733 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 69 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:26,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 914 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21064 states. [2022-01-11 07:40:28,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21064 to 21064. [2022-01-11 07:40:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21064 states, 21062 states have (on average 1.211708289811034) internal successors, (25521), 21063 states have internal predecessors, (25521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:28,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21064 states to 21064 states and 25521 transitions. [2022-01-11 07:40:28,194 INFO L78 Accepts]: Start accepts. Automaton has 21064 states and 25521 transitions. Word has length 110 [2022-01-11 07:40:28,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:28,195 INFO L470 AbstractCegarLoop]: Abstraction has 21064 states and 25521 transitions. [2022-01-11 07:40:28,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:28,195 INFO L276 IsEmpty]: Start isEmpty. Operand 21064 states and 25521 transitions. [2022-01-11 07:40:28,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-11 07:40:28,201 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:28,202 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:28,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 07:40:28,202 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:28,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:28,203 INFO L85 PathProgramCache]: Analyzing trace with hash -877727385, now seen corresponding path program 1 times [2022-01-11 07:40:28,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:28,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318884447] [2022-01-11 07:40:28,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:28,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 07:40:28,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:28,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318884447] [2022-01-11 07:40:28,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318884447] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:28,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:28,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:28,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794209697] [2022-01-11 07:40:28,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:28,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:28,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:28,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:28,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:28,244 INFO L87 Difference]: Start difference. First operand 21064 states and 25521 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:29,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:29,427 INFO L93 Difference]: Finished difference Result 21836 states and 26465 transitions. [2022-01-11 07:40:29,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:29,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-01-11 07:40:29,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:29,451 INFO L225 Difference]: With dead ends: 21836 [2022-01-11 07:40:29,451 INFO L226 Difference]: Without dead ends: 21073 [2022-01-11 07:40:29,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:29,456 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 60 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:29,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 918 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21073 states. [2022-01-11 07:40:30,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21073 to 21073. [2022-01-11 07:40:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21073 states, 21071 states have (on average 1.210953443120877) internal successors, (25516), 21072 states have internal predecessors, (25516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21073 states to 21073 states and 25516 transitions. [2022-01-11 07:40:30,728 INFO L78 Accepts]: Start accepts. Automaton has 21073 states and 25516 transitions. Word has length 113 [2022-01-11 07:40:30,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:30,728 INFO L470 AbstractCegarLoop]: Abstraction has 21073 states and 25516 transitions. [2022-01-11 07:40:30,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 21073 states and 25516 transitions. [2022-01-11 07:40:30,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-11 07:40:30,734 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:30,734 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:30,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 07:40:30,734 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:30,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:30,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1326424024, now seen corresponding path program 1 times [2022-01-11 07:40:30,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:30,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344376948] [2022-01-11 07:40:30,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:30,735 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 07:40:30,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:30,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344376948] [2022-01-11 07:40:30,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344376948] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:30,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:30,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:30,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782654078] [2022-01-11 07:40:30,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:30,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:30,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:30,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:30,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:30,774 INFO L87 Difference]: Start difference. First operand 21073 states and 25516 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:32,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:32,107 INFO L93 Difference]: Finished difference Result 21468 states and 25979 transitions. [2022-01-11 07:40:32,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:32,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-01-11 07:40:32,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:32,127 INFO L225 Difference]: With dead ends: 21468 [2022-01-11 07:40:32,127 INFO L226 Difference]: Without dead ends: 20040 [2022-01-11 07:40:32,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:32,130 INFO L933 BasicCegarLoop]: 511 mSDtfsCounter, 462 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:32,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [462 Valid, 529 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:32,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20040 states. [2022-01-11 07:40:33,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20040 to 20040. [2022-01-11 07:40:33,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20040 states, 20039 states have (on average 1.2128349718049802) internal successors, (24304), 20039 states have internal predecessors, (24304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20040 states to 20040 states and 24304 transitions. [2022-01-11 07:40:33,268 INFO L78 Accepts]: Start accepts. Automaton has 20040 states and 24304 transitions. Word has length 113 [2022-01-11 07:40:33,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:33,268 INFO L470 AbstractCegarLoop]: Abstraction has 20040 states and 24304 transitions. [2022-01-11 07:40:33,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 20040 states and 24304 transitions. [2022-01-11 07:40:33,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-01-11 07:40:33,278 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:33,278 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] [2022-01-11 07:40:33,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 07:40:33,278 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:33,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:33,279 INFO L85 PathProgramCache]: Analyzing trace with hash 90985971, now seen corresponding path program 1 times [2022-01-11 07:40:33,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:33,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007501335] [2022-01-11 07:40:33,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:33,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:33,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:33,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007501335] [2022-01-11 07:40:33,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007501335] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:33,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:33,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:33,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523538474] [2022-01-11 07:40:33,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:33,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:33,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:33,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:33,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:33,341 INFO L87 Difference]: Start difference. First operand 20040 states and 24304 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:35,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:35,142 INFO L93 Difference]: Finished difference Result 48774 states and 59094 transitions. [2022-01-11 07:40:35,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:35,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2022-01-11 07:40:35,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:35,176 INFO L225 Difference]: With dead ends: 48774 [2022-01-11 07:40:35,176 INFO L226 Difference]: Without dead ends: 28792 [2022-01-11 07:40:35,190 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:35,191 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 238 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:35,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 715 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:35,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28792 states. [2022-01-11 07:40:36,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28792 to 28662. [2022-01-11 07:40:36,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28662 states, 28661 states have (on average 1.2037263179930917) internal successors, (34500), 28661 states have internal predecessors, (34500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28662 states to 28662 states and 34500 transitions. [2022-01-11 07:40:37,031 INFO L78 Accepts]: Start accepts. Automaton has 28662 states and 34500 transitions. Word has length 140 [2022-01-11 07:40:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:37,032 INFO L470 AbstractCegarLoop]: Abstraction has 28662 states and 34500 transitions. [2022-01-11 07:40:37,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:37,032 INFO L276 IsEmpty]: Start isEmpty. Operand 28662 states and 34500 transitions. [2022-01-11 07:40:37,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-01-11 07:40:37,045 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:37,045 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] [2022-01-11 07:40:37,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 07:40:37,045 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:37,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:37,046 INFO L85 PathProgramCache]: Analyzing trace with hash 859589611, now seen corresponding path program 1 times [2022-01-11 07:40:37,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:37,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327576130] [2022-01-11 07:40:37,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:37,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:37,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:37,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327576130] [2022-01-11 07:40:37,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327576130] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:37,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:37,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 07:40:37,087 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145329192] [2022-01-11 07:40:37,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:37,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:37,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:37,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:37,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:37,089 INFO L87 Difference]: Start difference. First operand 28662 states and 34500 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:39,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:39,575 INFO L93 Difference]: Finished difference Result 69934 states and 84182 transitions. [2022-01-11 07:40:39,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:39,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2022-01-11 07:40:39,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:39,629 INFO L225 Difference]: With dead ends: 69934 [2022-01-11 07:40:39,630 INFO L226 Difference]: Without dead ends: 41342 [2022-01-11 07:40:39,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:39,662 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 241 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:39,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 713 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:39,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41342 states. [2022-01-11 07:40:42,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41342 to 41148. [2022-01-11 07:40:42,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41148 states, 41147 states have (on average 1.196782268452135) internal successors, (49244), 41147 states have internal predecessors, (49244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41148 states to 41148 states and 49244 transitions. [2022-01-11 07:40:42,565 INFO L78 Accepts]: Start accepts. Automaton has 41148 states and 49244 transitions. Word has length 140 [2022-01-11 07:40:42,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:42,566 INFO L470 AbstractCegarLoop]: Abstraction has 41148 states and 49244 transitions. [2022-01-11 07:40:42,566 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:42,566 INFO L276 IsEmpty]: Start isEmpty. Operand 41148 states and 49244 transitions. [2022-01-11 07:40:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-11 07:40:42,585 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:42,585 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:42,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-11 07:40:42,585 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:42,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:42,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1075156264, now seen corresponding path program 1 times [2022-01-11 07:40:42,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:42,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467506797] [2022-01-11 07:40:42,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:42,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:42,624 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-11 07:40:42,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:42,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467506797] [2022-01-11 07:40:42,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467506797] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:42,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:42,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:42,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110749177] [2022-01-11 07:40:42,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:42,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:42,625 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:42,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:42,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:42,626 INFO L87 Difference]: Start difference. First operand 41148 states and 49244 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:45,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:45,508 INFO L93 Difference]: Finished difference Result 73592 states and 88113 transitions. [2022-01-11 07:40:45,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:45,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 157 [2022-01-11 07:40:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:45,564 INFO L225 Difference]: With dead ends: 73592 [2022-01-11 07:40:45,565 INFO L226 Difference]: Without dead ends: 42000 [2022-01-11 07:40:45,604 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:45,605 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 291 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:45,605 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 772 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 07:40:45,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42000 states. [2022-01-11 07:40:48,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42000 to 40428. [2022-01-11 07:40:48,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40428 states, 40427 states have (on average 1.1783214188537363) internal successors, (47636), 40427 states have internal predecessors, (47636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40428 states to 40428 states and 47636 transitions. [2022-01-11 07:40:48,492 INFO L78 Accepts]: Start accepts. Automaton has 40428 states and 47636 transitions. Word has length 157 [2022-01-11 07:40:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:48,493 INFO L470 AbstractCegarLoop]: Abstraction has 40428 states and 47636 transitions. [2022-01-11 07:40:48,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 40428 states and 47636 transitions. [2022-01-11 07:40:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-11 07:40:48,511 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:48,511 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:48,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-11 07:40:48,511 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:48,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:48,512 INFO L85 PathProgramCache]: Analyzing trace with hash -835496368, now seen corresponding path program 1 times [2022-01-11 07:40:48,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:48,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616033594] [2022-01-11 07:40:48,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:48,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-11 07:40:48,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:48,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616033594] [2022-01-11 07:40:48,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616033594] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:48,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:48,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:48,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416893860] [2022-01-11 07:40:48,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:48,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:48,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:48,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:48,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:48,560 INFO L87 Difference]: Start difference. First operand 40428 states and 47636 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:51,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 07:40:51,563 INFO L93 Difference]: Finished difference Result 80760 states and 95170 transitions. [2022-01-11 07:40:51,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 07:40:51,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 158 [2022-01-11 07:40:51,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 07:40:51,618 INFO L225 Difference]: With dead ends: 80760 [2022-01-11 07:40:51,618 INFO L226 Difference]: Without dead ends: 40430 [2022-01-11 07:40:51,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:51,649 INFO L933 BasicCegarLoop]: 657 mSDtfsCounter, 278 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 07:40:51,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 1021 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 07:40:51,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40430 states. [2022-01-11 07:40:54,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40430 to 40428. [2022-01-11 07:40:54,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40428 states, 40427 states have (on average 1.1694164790857595) internal successors, (47276), 40427 states have internal predecessors, (47276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40428 states to 40428 states and 47276 transitions. [2022-01-11 07:40:54,391 INFO L78 Accepts]: Start accepts. Automaton has 40428 states and 47276 transitions. Word has length 158 [2022-01-11 07:40:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 07:40:54,391 INFO L470 AbstractCegarLoop]: Abstraction has 40428 states and 47276 transitions. [2022-01-11 07:40:54,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 07:40:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 40428 states and 47276 transitions. [2022-01-11 07:40:54,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-11 07:40:54,413 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 07:40:54,413 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 07:40:54,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-11 07:40:54,413 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 07:40:54,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 07:40:54,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1855723407, now seen corresponding path program 1 times [2022-01-11 07:40:54,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 07:40:54,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436845186] [2022-01-11 07:40:54,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 07:40:54,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 07:40:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 07:40:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 07:40:54,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 07:40:54,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436845186] [2022-01-11 07:40:54,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436845186] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 07:40:54,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 07:40:54,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 07:40:54,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396639725] [2022-01-11 07:40:54,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 07:40:54,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 07:40:54,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 07:40:54,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 07:40:54,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 07:40:54,455 INFO L87 Difference]: Start difference. First operand 40428 states and 47276 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)