/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_LAZY.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:02:40,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:02:40,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:02:40,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:02:40,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:02:40,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:02:40,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:02:40,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:02:40,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:02:40,687 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:02:40,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:02:40,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:02:40,688 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:02:40,689 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:02:40,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:02:40,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:02:40,691 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:02:40,691 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:02:40,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:02:40,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:02:40,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:02:40,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:02:40,718 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:02:40,719 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:02:40,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:02:40,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:02:40,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:02:40,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:02:40,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:02:40,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:02:40,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:02:40,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:02:40,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:02:40,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:02:40,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:02:40,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:02:40,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:02:40,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:02:40,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:02:40,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:02:40,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:02:40,747 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 20:02:40,781 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:02:40,781 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:02:40,782 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:02:40,782 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:02:40,796 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:02:40,796 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:02:40,796 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:02:40,796 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:02:40,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:02:40,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:02:40,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:02:40,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:02:40,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:02:40,797 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:02:40,797 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:02:40,797 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:02:40,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:02:40,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:02:40,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:02:40,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:02:40,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:02:40,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:02:40,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:02:40,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:02:40,799 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:02:40,800 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:02:40,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:02:40,800 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:02:40,800 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:02:40,800 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:02:40,800 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:02:40,800 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:02:40,801 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:02:40,801 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 20:02:41,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:02:41,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:02:41,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:02:41,036 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:02:41,040 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:02:41,041 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.06.cil-1.c [2022-01-10 20:02:41,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4686ec8da/7fde77d6d1ff417fb832056540b74ed5/FLAG430acc2ef [2022-01-10 20:02:41,488 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:02:41,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.06.cil-1.c [2022-01-10 20:02:41,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4686ec8da/7fde77d6d1ff417fb832056540b74ed5/FLAG430acc2ef [2022-01-10 20:02:41,506 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4686ec8da/7fde77d6d1ff417fb832056540b74ed5 [2022-01-10 20:02:41,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:02:41,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:02:41,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:02:41,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:02:41,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:02:41,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:02:41" (1/1) ... [2022-01-10 20:02:41,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b115cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:41, skipping insertion in model container [2022-01-10 20:02:41,514 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:02:41" (1/1) ... [2022-01-10 20:02:41,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:02:41,553 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:02:41,705 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.06.cil-1.c[914,927] [2022-01-10 20:02:41,751 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.06.cil-1.c[7115,7128] [2022-01-10 20:02:41,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:02:41,838 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:02:41,845 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.06.cil-1.c[914,927] [2022-01-10 20:02:41,873 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.06.cil-1.c[7115,7128] [2022-01-10 20:02:41,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:02:41,928 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:02:41,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:41 WrapperNode [2022-01-10 20:02:41,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:02:41,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:02:41,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:02:41,930 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:02:41,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:41" (1/1) ... [2022-01-10 20:02:41,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:41" (1/1) ... [2022-01-10 20:02:42,014 INFO L137 Inliner]: procedures = 66, calls = 76, calls flagged for inlining = 71, calls inlined = 141, statements flattened = 1963 [2022-01-10 20:02:42,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:02:42,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:02:42,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:02:42,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:02:42,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:41" (1/1) ... [2022-01-10 20:02:42,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:41" (1/1) ... [2022-01-10 20:02:42,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:41" (1/1) ... [2022-01-10 20:02:42,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:41" (1/1) ... [2022-01-10 20:02:42,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:41" (1/1) ... [2022-01-10 20:02:42,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:41" (1/1) ... [2022-01-10 20:02:42,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:41" (1/1) ... [2022-01-10 20:02:42,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:02:42,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:02:42,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:02:42,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:02:42,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:41" (1/1) ... [2022-01-10 20:02:42,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:02:42,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:02:42,157 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 20:02:42,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 20:02:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:02:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:02:42,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:02:42,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:02:42,263 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:02:42,264 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:02:43,178 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:02:43,186 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:02:43,187 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2022-01-10 20:02:43,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:02:43 BoogieIcfgContainer [2022-01-10 20:02:43,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:02:43,189 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:02:43,189 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:02:43,190 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:02:43,192 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:02:43" (1/1) ... [2022-01-10 20:02:43,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:02:43 BasicIcfg [2022-01-10 20:02:43,414 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:02:43,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:02:43,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:02:43,417 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:02:43,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:02:41" (1/4) ... [2022-01-10 20:02:43,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62205f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:02:43, skipping insertion in model container [2022-01-10 20:02:43,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:41" (2/4) ... [2022-01-10 20:02:43,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62205f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:02:43, skipping insertion in model container [2022-01-10 20:02:43,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:02:43" (3/4) ... [2022-01-10 20:02:43,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62205f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:02:43, skipping insertion in model container [2022-01-10 20:02:43,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:02:43" (4/4) ... [2022-01-10 20:02:43,420 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.06.cil-1.cTransformedIcfg [2022-01-10 20:02:43,423 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:02:43,423 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-01-10 20:02:43,471 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:02:43,475 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 20:02:43,475 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-10 20:02:43,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 799 states, 794 states have (on average 1.5340050377833754) internal successors, (1218), 798 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-10 20:02:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:02:43,509 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:43,509 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-10 20:02:43,510 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:43,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:43,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1476392373, now seen corresponding path program 1 times [2022-01-10 20:02:43,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:43,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727015339] [2022-01-10 20:02:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:43,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:43,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:43,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727015339] [2022-01-10 20:02:43,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727015339] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:43,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:43,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:43,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553234235] [2022-01-10 20:02:43,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:43,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:43,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:43,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:43,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:43,846 INFO L87 Difference]: Start difference. First operand has 799 states, 794 states have (on average 1.5340050377833754) internal successors, (1218), 798 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) 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-10 20:02:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:44,125 INFO L93 Difference]: Finished difference Result 1590 states and 2417 transitions. [2022-01-10 20:02:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:44,132 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-10 20:02:44,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:44,153 INFO L225 Difference]: With dead ends: 1590 [2022-01-10 20:02:44,153 INFO L226 Difference]: Without dead ends: 882 [2022-01-10 20:02:44,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:44,166 INFO L933 BasicCegarLoop]: 1180 mSDtfsCounter, 124 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 2330 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-10 20:02:44,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 2330 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:02:44,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2022-01-10 20:02:44,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 878. [2022-01-10 20:02:44,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 874 states have (on average 1.4851258581235698) internal successors, (1298), 877 states have internal predecessors, (1298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 1298 transitions. [2022-01-10 20:02:44,278 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 1298 transitions. Word has length 44 [2022-01-10 20:02:44,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:44,279 INFO L470 AbstractCegarLoop]: Abstraction has 878 states and 1298 transitions. [2022-01-10 20:02:44,279 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-10 20:02:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 1298 transitions. [2022-01-10 20:02:44,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:02:44,281 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:44,281 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-10 20:02:44,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:02:44,281 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:44,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:44,282 INFO L85 PathProgramCache]: Analyzing trace with hash -706826898, now seen corresponding path program 1 times [2022-01-10 20:02:44,282 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:44,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553097362] [2022-01-10 20:02:44,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:44,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:44,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:44,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553097362] [2022-01-10 20:02:44,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553097362] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:44,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:44,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:44,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761255406] [2022-01-10 20:02:44,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:44,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:44,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:44,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:44,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:44,374 INFO L87 Difference]: Start difference. First operand 878 states and 1298 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-10 20:02:44,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:44,413 INFO L93 Difference]: Finished difference Result 1164 states and 1696 transitions. [2022-01-10 20:02:44,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:44,413 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-10 20:02:44,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:44,416 INFO L225 Difference]: With dead ends: 1164 [2022-01-10 20:02:44,416 INFO L226 Difference]: Without dead ends: 1034 [2022-01-10 20:02:44,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:44,418 INFO L933 BasicCegarLoop]: 1173 mSDtfsCounter, 1136 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 1291 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-10 20:02:44,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1136 Valid, 1291 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:44,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-01-10 20:02:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1030. [2022-01-10 20:02:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1026 states have (on average 1.46588693957115) internal successors, (1504), 1029 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1504 transitions. [2022-01-10 20:02:44,441 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1504 transitions. Word has length 44 [2022-01-10 20:02:44,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:44,441 INFO L470 AbstractCegarLoop]: Abstraction has 1030 states and 1504 transitions. [2022-01-10 20:02:44,442 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-10 20:02:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1504 transitions. [2022-01-10 20:02:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 20:02:44,452 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:44,452 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-10 20:02:44,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:02:44,455 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:44,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash 789529795, now seen corresponding path program 1 times [2022-01-10 20:02:44,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:44,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208316521] [2022-01-10 20:02:44,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:44,455 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:44,540 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:44,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208316521] [2022-01-10 20:02:44,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208316521] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:44,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:44,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:44,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015860661] [2022-01-10 20:02:44,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:44,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:44,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:44,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:44,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:44,544 INFO L87 Difference]: Start difference. First operand 1030 states and 1504 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-10 20:02:44,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:44,602 INFO L93 Difference]: Finished difference Result 1578 states and 2264 transitions. [2022-01-10 20:02:44,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:44,602 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-10 20:02:44,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:44,606 INFO L225 Difference]: With dead ends: 1578 [2022-01-10 20:02:44,607 INFO L226 Difference]: Without dead ends: 1243 [2022-01-10 20:02:44,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:44,612 INFO L933 BasicCegarLoop]: 1168 mSDtfsCounter, 94 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 2280 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-10 20:02:44,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 2280 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:44,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2022-01-10 20:02:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1229. [2022-01-10 20:02:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1225 states have (on average 1.446530612244898) internal successors, (1772), 1228 states have internal predecessors, (1772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1772 transitions. [2022-01-10 20:02:44,640 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1772 transitions. Word has length 45 [2022-01-10 20:02:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:44,640 INFO L470 AbstractCegarLoop]: Abstraction has 1229 states and 1772 transitions. [2022-01-10 20:02:44,640 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-10 20:02:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1772 transitions. [2022-01-10 20:02:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 20:02:44,641 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:44,641 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-10 20:02:44,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:02:44,642 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:44,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:44,643 INFO L85 PathProgramCache]: Analyzing trace with hash 819112258, now seen corresponding path program 1 times [2022-01-10 20:02:44,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:44,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99781976] [2022-01-10 20:02:44,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:44,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:44,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:44,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:44,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99781976] [2022-01-10 20:02:44,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99781976] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:44,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:44,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:44,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453325679] [2022-01-10 20:02:44,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:44,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:44,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:44,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:44,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:44,698 INFO L87 Difference]: Start difference. First operand 1229 states and 1772 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-10 20:02:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:44,744 INFO L93 Difference]: Finished difference Result 2117 states and 2984 transitions. [2022-01-10 20:02:44,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:44,744 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-10 20:02:44,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:44,750 INFO L225 Difference]: With dead ends: 2117 [2022-01-10 20:02:44,750 INFO L226 Difference]: Without dead ends: 1641 [2022-01-10 20:02:44,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:44,759 INFO L933 BasicCegarLoop]: 1168 mSDtfsCounter, 1124 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 1257 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-10 20:02:44,760 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1124 Valid, 1257 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:44,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2022-01-10 20:02:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1609. [2022-01-10 20:02:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1605 states have (on average 1.415576323987539) internal successors, (2272), 1608 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2272 transitions. [2022-01-10 20:02:44,803 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2272 transitions. Word has length 45 [2022-01-10 20:02:44,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:44,803 INFO L470 AbstractCegarLoop]: Abstraction has 1609 states and 2272 transitions. [2022-01-10 20:02:44,803 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-10 20:02:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2272 transitions. [2022-01-10 20:02:44,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 20:02:44,804 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:44,804 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-10 20:02:44,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:02:44,805 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:44,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:44,805 INFO L85 PathProgramCache]: Analyzing trace with hash -977330114, now seen corresponding path program 1 times [2022-01-10 20:02:44,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:44,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558339664] [2022-01-10 20:02:44,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:44,806 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:44,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:44,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:44,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558339664] [2022-01-10 20:02:44,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558339664] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:44,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:44,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:44,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120020392] [2022-01-10 20:02:44,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:44,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:44,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:44,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:44,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:44,890 INFO L87 Difference]: Start difference. First operand 1609 states and 2272 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:44,941 INFO L93 Difference]: Finished difference Result 2812 states and 3885 transitions. [2022-01-10 20:02:44,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:44,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-10 20:02:44,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:44,947 INFO L225 Difference]: With dead ends: 2812 [2022-01-10 20:02:44,947 INFO L226 Difference]: Without dead ends: 1928 [2022-01-10 20:02:44,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:44,948 INFO L933 BasicCegarLoop]: 1172 mSDtfsCounter, 1121 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 1261 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-10 20:02:44,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1121 Valid, 1261 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:44,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2022-01-10 20:02:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1906. [2022-01-10 20:02:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1906 states, 1902 states have (on average 1.396950578338591) internal successors, (2657), 1905 states have internal predecessors, (2657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 2657 transitions. [2022-01-10 20:02:44,996 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 2657 transitions. Word has length 51 [2022-01-10 20:02:44,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:44,998 INFO L470 AbstractCegarLoop]: Abstraction has 1906 states and 2657 transitions. [2022-01-10 20:02:44,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2657 transitions. [2022-01-10 20:02:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 20:02:45,001 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:45,002 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-10 20:02:45,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:02:45,002 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:45,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:45,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1683070771, now seen corresponding path program 1 times [2022-01-10 20:02:45,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:45,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996364478] [2022-01-10 20:02:45,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:45,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:45,090 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-10 20:02:45,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:45,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996364478] [2022-01-10 20:02:45,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996364478] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:45,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:45,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:02:45,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442963277] [2022-01-10 20:02:45,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:45,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:02:45,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:45,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:02:45,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:02:45,092 INFO L87 Difference]: Start difference. First operand 1906 states and 2657 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-10 20:02:45,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:45,203 INFO L93 Difference]: Finished difference Result 3532 states and 4861 transitions. [2022-01-10 20:02:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:02:45,204 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-10 20:02:45,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:45,212 INFO L225 Difference]: With dead ends: 3532 [2022-01-10 20:02:45,212 INFO L226 Difference]: Without dead ends: 2581 [2022-01-10 20:02:45,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:02:45,215 INFO L933 BasicCegarLoop]: 1161 mSDtfsCounter, 395 mSDsluCounter, 3592 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 4753 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-10 20:02:45,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 4753 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:45,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2581 states. [2022-01-10 20:02:45,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2581 to 1930. [2022-01-10 20:02:45,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1926 states have (on average 1.3826583592938733) internal successors, (2663), 1929 states have internal predecessors, (2663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2663 transitions. [2022-01-10 20:02:45,318 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 2663 transitions. Word has length 52 [2022-01-10 20:02:45,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:45,318 INFO L470 AbstractCegarLoop]: Abstraction has 1930 states and 2663 transitions. [2022-01-10 20:02:45,318 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-10 20:02:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 2663 transitions. [2022-01-10 20:02:45,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 20:02:45,319 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:45,319 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-10 20:02:45,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:02:45,320 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:45,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:45,320 INFO L85 PathProgramCache]: Analyzing trace with hash -661596270, now seen corresponding path program 1 times [2022-01-10 20:02:45,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:45,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088958355] [2022-01-10 20:02:45,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:45,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:45,361 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-10 20:02:45,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:45,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088958355] [2022-01-10 20:02:45,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088958355] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:45,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:45,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:02:45,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121378561] [2022-01-10 20:02:45,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:45,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:02:45,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:45,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:02:45,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:02:45,362 INFO L87 Difference]: Start difference. First operand 1930 states and 2663 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-10 20:02:45,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:45,495 INFO L93 Difference]: Finished difference Result 3685 states and 5012 transitions. [2022-01-10 20:02:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:02:45,495 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-10 20:02:45,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:45,502 INFO L225 Difference]: With dead ends: 3685 [2022-01-10 20:02:45,502 INFO L226 Difference]: Without dead ends: 2520 [2022-01-10 20:02:45,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:02:45,505 INFO L933 BasicCegarLoop]: 1160 mSDtfsCounter, 354 mSDsluCounter, 3609 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 4769 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-10 20:02:45,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 4769 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:45,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2022-01-10 20:02:45,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1948. [2022-01-10 20:02:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1948 states, 1944 states have (on average 1.3688271604938271) internal successors, (2661), 1947 states have internal predecessors, (2661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:45,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1948 states to 1948 states and 2661 transitions. [2022-01-10 20:02:45,611 INFO L78 Accepts]: Start accepts. Automaton has 1948 states and 2661 transitions. Word has length 52 [2022-01-10 20:02:45,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:45,612 INFO L470 AbstractCegarLoop]: Abstraction has 1948 states and 2661 transitions. [2022-01-10 20:02:45,612 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-10 20:02:45,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1948 states and 2661 transitions. [2022-01-10 20:02:45,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 20:02:45,613 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:45,613 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-10 20:02:45,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:02:45,613 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:45,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:45,614 INFO L85 PathProgramCache]: Analyzing trace with hash -650280143, now seen corresponding path program 1 times [2022-01-10 20:02:45,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:45,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133122070] [2022-01-10 20:02:45,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:45,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:45,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:45,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133122070] [2022-01-10 20:02:45,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133122070] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:45,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:45,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 20:02:45,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865196339] [2022-01-10 20:02:45,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:45,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 20:02:45,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:45,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 20:02:45,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 20:02:45,684 INFO L87 Difference]: Start difference. First operand 1948 states and 2661 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-10 20:02:45,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:45,843 INFO L93 Difference]: Finished difference Result 2180 states and 2961 transitions. [2022-01-10 20:02:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 20:02:45,844 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-10 20:02:45,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:45,851 INFO L225 Difference]: With dead ends: 2180 [2022-01-10 20:02:45,851 INFO L226 Difference]: Without dead ends: 2178 [2022-01-10 20:02:45,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:02:45,853 INFO L933 BasicCegarLoop]: 1169 mSDtfsCounter, 2381 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2381 SdHoareTripleChecker+Valid, 1257 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-10 20:02:45,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2381 Valid, 1257 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:45,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2022-01-10 20:02:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 1946. [2022-01-10 20:02:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1946 states, 1943 states have (on average 1.3648996397323727) internal successors, (2652), 1945 states have internal predecessors, (2652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:45,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2652 transitions. [2022-01-10 20:02:45,972 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2652 transitions. Word has length 52 [2022-01-10 20:02:45,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:45,973 INFO L470 AbstractCegarLoop]: Abstraction has 1946 states and 2652 transitions. [2022-01-10 20:02:45,973 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-10 20:02:45,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2652 transitions. [2022-01-10 20:02:45,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-10 20:02:45,974 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:45,974 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-10 20:02:45,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:02:45,974 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:45,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:45,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1316154301, now seen corresponding path program 1 times [2022-01-10 20:02:45,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:45,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893132188] [2022-01-10 20:02:45,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:45,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:46,143 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:46,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893132188] [2022-01-10 20:02:46,143 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893132188] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:02:46,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898749904] [2022-01-10 20:02:46,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:46,143 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:02:46,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:02:46,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 20:02:46,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 20:02:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:46,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 20:02:46,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:02:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:46,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:02:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:46,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898749904] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:02:46,803 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:02:46,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-10 20:02:46,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727201220] [2022-01-10 20:02:46,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:02:46,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 20:02:46,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:46,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 20:02:46,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:02:46,805 INFO L87 Difference]: Start difference. First operand 1946 states and 2652 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:47,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:47,149 INFO L93 Difference]: Finished difference Result 4303 states and 5752 transitions. [2022-01-10 20:02:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:02:47,150 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-10 20:02:47,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:47,163 INFO L225 Difference]: With dead ends: 4303 [2022-01-10 20:02:47,164 INFO L226 Difference]: Without dead ends: 4301 [2022-01-10 20:02:47,165 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-10 20:02:47,167 INFO L933 BasicCegarLoop]: 1320 mSDtfsCounter, 2881 mSDsluCounter, 4150 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2881 SdHoareTripleChecker+Valid, 5470 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:47,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2881 Valid, 5470 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:47,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2022-01-10 20:02:47,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 2921. [2022-01-10 20:02:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2921 states, 2918 states have (on average 1.3478409869773817) internal successors, (3933), 2920 states have internal predecessors, (3933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 3933 transitions. [2022-01-10 20:02:47,368 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 3933 transitions. Word has length 53 [2022-01-10 20:02:47,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:47,368 INFO L470 AbstractCegarLoop]: Abstraction has 2921 states and 3933 transitions. [2022-01-10 20:02:47,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:47,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 3933 transitions. [2022-01-10 20:02:47,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 20:02:47,369 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:47,369 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-10 20:02:47,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 20:02:47,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:02:47,584 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:47,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash 477574019, now seen corresponding path program 2 times [2022-01-10 20:02:47,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:47,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266798826] [2022-01-10 20:02:47,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:47,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:47,613 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-10 20:02:47,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:47,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266798826] [2022-01-10 20:02:47,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266798826] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:47,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:47,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:47,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756304020] [2022-01-10 20:02:47,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:47,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:47,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:47,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:47,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:47,615 INFO L87 Difference]: Start difference. First operand 2921 states and 3933 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-10 20:02:47,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:47,778 INFO L93 Difference]: Finished difference Result 4015 states and 5378 transitions. [2022-01-10 20:02:47,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:47,778 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-10 20:02:47,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:47,784 INFO L225 Difference]: With dead ends: 4015 [2022-01-10 20:02:47,784 INFO L226 Difference]: Without dead ends: 2275 [2022-01-10 20:02:47,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-10 20:02:47,787 INFO L933 BasicCegarLoop]: 1232 mSDtfsCounter, 1115 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1348 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-10 20:02:47,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1115 Valid, 1348 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:47,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2022-01-10 20:02:47,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2259. [2022-01-10 20:02:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2259 states, 2256 states have (on average 1.3426418439716312) internal successors, (3029), 2258 states have internal predecessors, (3029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2259 states to 2259 states and 3029 transitions. [2022-01-10 20:02:47,907 INFO L78 Accepts]: Start accepts. Automaton has 2259 states and 3029 transitions. Word has length 56 [2022-01-10 20:02:47,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:47,907 INFO L470 AbstractCegarLoop]: Abstraction has 2259 states and 3029 transitions. [2022-01-10 20:02:47,907 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-10 20:02:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 2259 states and 3029 transitions. [2022-01-10 20:02:47,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 20:02:47,908 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:47,908 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-10 20:02:47,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 20:02:47,908 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:47,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:47,909 INFO L85 PathProgramCache]: Analyzing trace with hash 314711327, now seen corresponding path program 1 times [2022-01-10 20:02:47,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:47,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430290079] [2022-01-10 20:02:47,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:47,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:47,933 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:47,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430290079] [2022-01-10 20:02:47,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430290079] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:47,933 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:47,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:47,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930767558] [2022-01-10 20:02:47,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:47,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:47,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:47,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:47,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:47,934 INFO L87 Difference]: Start difference. First operand 2259 states and 3029 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-10 20:02:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:48,160 INFO L93 Difference]: Finished difference Result 4746 states and 6177 transitions. [2022-01-10 20:02:48,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:48,161 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-10 20:02:48,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:48,168 INFO L225 Difference]: With dead ends: 4746 [2022-01-10 20:02:48,168 INFO L226 Difference]: Without dead ends: 2644 [2022-01-10 20:02:48,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:48,172 INFO L933 BasicCegarLoop]: 1255 mSDtfsCounter, 89 mSDsluCounter, 1151 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 2406 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-10 20:02:48,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 2406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:48,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2022-01-10 20:02:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2644. [2022-01-10 20:02:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2641 states have (on average 1.3207118515713745) internal successors, (3488), 2643 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3488 transitions. [2022-01-10 20:02:48,334 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3488 transitions. Word has length 60 [2022-01-10 20:02:48,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:48,335 INFO L470 AbstractCegarLoop]: Abstraction has 2644 states and 3488 transitions. [2022-01-10 20:02:48,335 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-10 20:02:48,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3488 transitions. [2022-01-10 20:02:48,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 20:02:48,336 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:48,336 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-10 20:02:48,336 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 20:02:48,337 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:48,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:48,337 INFO L85 PathProgramCache]: Analyzing trace with hash 311515801, now seen corresponding path program 1 times [2022-01-10 20:02:48,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:48,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114900568] [2022-01-10 20:02:48,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:48,337 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:48,363 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-10 20:02:48,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:48,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114900568] [2022-01-10 20:02:48,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114900568] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:48,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:48,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:48,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120566874] [2022-01-10 20:02:48,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:48,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:48,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:48,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:48,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:48,365 INFO L87 Difference]: Start difference. First operand 2644 states and 3488 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-10 20:02:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:48,560 INFO L93 Difference]: Finished difference Result 4507 states and 5840 transitions. [2022-01-10 20:02:48,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:48,561 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-10 20:02:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:48,579 INFO L225 Difference]: With dead ends: 4507 [2022-01-10 20:02:48,579 INFO L226 Difference]: Without dead ends: 2644 [2022-01-10 20:02:48,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:48,582 INFO L933 BasicCegarLoop]: 1164 mSDtfsCounter, 1107 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 1248 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-10 20:02:48,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1107 Valid, 1248 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:48,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2022-01-10 20:02:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2644. [2022-01-10 20:02:48,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2641 states have (on average 1.3055660734570238) internal successors, (3448), 2643 states have internal predecessors, (3448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:48,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3448 transitions. [2022-01-10 20:02:48,725 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3448 transitions. Word has length 68 [2022-01-10 20:02:48,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:48,725 INFO L470 AbstractCegarLoop]: Abstraction has 2644 states and 3448 transitions. [2022-01-10 20:02:48,725 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-10 20:02:48,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3448 transitions. [2022-01-10 20:02:48,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 20:02:48,727 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:48,727 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-10 20:02:48,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 20:02:48,727 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:48,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:48,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1638082592, now seen corresponding path program 1 times [2022-01-10 20:02:48,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:48,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132569877] [2022-01-10 20:02:48,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:48,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:48,751 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-10 20:02:48,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:48,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132569877] [2022-01-10 20:02:48,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132569877] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:48,752 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:48,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:48,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570940510] [2022-01-10 20:02:48,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:48,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:48,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:48,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:48,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:48,753 INFO L87 Difference]: Start difference. First operand 2644 states and 3448 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-10 20:02:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:48,884 INFO L93 Difference]: Finished difference Result 3943 states and 5082 transitions. [2022-01-10 20:02:48,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:48,898 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-10 20:02:48,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:48,904 INFO L225 Difference]: With dead ends: 3943 [2022-01-10 20:02:48,904 INFO L226 Difference]: Without dead ends: 2318 [2022-01-10 20:02:48,906 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:48,907 INFO L933 BasicCegarLoop]: 1247 mSDtfsCounter, 99 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 2393 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:48,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 2393 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2022-01-10 20:02:49,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2316. [2022-01-10 20:02:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2316 states, 2313 states have (on average 1.3030696065715521) internal successors, (3014), 2315 states have internal predecessors, (3014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 3014 transitions. [2022-01-10 20:02:49,048 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 3014 transitions. Word has length 69 [2022-01-10 20:02:49,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:49,048 INFO L470 AbstractCegarLoop]: Abstraction has 2316 states and 3014 transitions. [2022-01-10 20:02:49,049 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-10 20:02:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 3014 transitions. [2022-01-10 20:02:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:49,050 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:49,051 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:49,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 20:02:49,051 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:49,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:49,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1658446586, now seen corresponding path program 1 times [2022-01-10 20:02:49,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:49,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766085028] [2022-01-10 20:02:49,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:49,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:49,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:49,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:49,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766085028] [2022-01-10 20:02:49,075 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766085028] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:49,075 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:49,075 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:49,075 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504178413] [2022-01-10 20:02:49,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:49,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:49,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:49,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:49,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:49,076 INFO L87 Difference]: Start difference. First operand 2316 states and 3014 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-10 20:02:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:49,189 INFO L93 Difference]: Finished difference Result 2996 states and 4031 transitions. [2022-01-10 20:02:49,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:49,189 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 99 [2022-01-10 20:02:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:49,193 INFO L225 Difference]: With dead ends: 2996 [2022-01-10 20:02:49,193 INFO L226 Difference]: Without dead ends: 2316 [2022-01-10 20:02:49,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:49,194 INFO L933 BasicCegarLoop]: 1161 mSDtfsCounter, 1023 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:49,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1023 Valid, 1291 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:49,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2022-01-10 20:02:49,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2316. [2022-01-10 20:02:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2316 states, 2313 states have (on average 1.3026372676178124) internal successors, (3013), 2315 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2316 states to 2316 states and 3013 transitions. [2022-01-10 20:02:49,339 INFO L78 Accepts]: Start accepts. Automaton has 2316 states and 3013 transitions. Word has length 99 [2022-01-10 20:02:49,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:49,339 INFO L470 AbstractCegarLoop]: Abstraction has 2316 states and 3013 transitions. [2022-01-10 20:02:49,339 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-10 20:02:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2316 states and 3013 transitions. [2022-01-10 20:02:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:49,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:49,341 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:49,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 20:02:49,341 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:49,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1273079803, now seen corresponding path program 1 times [2022-01-10 20:02:49,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:49,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787648849] [2022-01-10 20:02:49,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:49,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:49,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:49,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:49,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787648849] [2022-01-10 20:02:49,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787648849] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:49,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:49,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:49,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563518803] [2022-01-10 20:02:49,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:49,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:49,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:49,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:49,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:49,367 INFO L87 Difference]: Start difference. First operand 2316 states and 3013 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:49,525 INFO L93 Difference]: Finished difference Result 3541 states and 4838 transitions. [2022-01-10 20:02:49,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:49,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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 99 [2022-01-10 20:02:49,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:49,529 INFO L225 Difference]: With dead ends: 3541 [2022-01-10 20:02:49,530 INFO L226 Difference]: Without dead ends: 2864 [2022-01-10 20:02:49,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:49,531 INFO L933 BasicCegarLoop]: 1156 mSDtfsCounter, 1071 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 2035 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:49,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1071 Valid, 2035 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2864 states. [2022-01-10 20:02:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2864 to 2860. [2022-01-10 20:02:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.337066853342667) internal successors, (3820), 2859 states have internal predecessors, (3820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3820 transitions. [2022-01-10 20:02:49,707 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3820 transitions. Word has length 99 [2022-01-10 20:02:49,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:49,707 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3820 transitions. [2022-01-10 20:02:49,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3820 transitions. [2022-01-10 20:02:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:49,709 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:49,709 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:49,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 20:02:49,710 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:49,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:49,710 INFO L85 PathProgramCache]: Analyzing trace with hash 588218149, now seen corresponding path program 1 times [2022-01-10 20:02:49,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:49,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009995693] [2022-01-10 20:02:49,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:49,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:49,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:49,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009995693] [2022-01-10 20:02:49,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009995693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:49,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:49,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:49,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734126760] [2022-01-10 20:02:49,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:49,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:49,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:49,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:49,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:49,738 INFO L87 Difference]: Start difference. First operand 2860 states and 3820 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:49,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:49,917 INFO L93 Difference]: Finished difference Result 4080 states and 5638 transitions. [2022-01-10 20:02:49,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:49,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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 99 [2022-01-10 20:02:49,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:49,921 INFO L225 Difference]: With dead ends: 4080 [2022-01-10 20:02:49,921 INFO L226 Difference]: Without dead ends: 2860 [2022-01-10 20:02:49,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:49,923 INFO L933 BasicCegarLoop]: 1150 mSDtfsCounter, 1141 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 1150 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:49,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1141 Valid, 1150 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:49,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-10 20:02:50,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-10 20:02:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.3342667133356667) internal successors, (3812), 2859 states have internal predecessors, (3812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:50,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3812 transitions. [2022-01-10 20:02:50,062 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3812 transitions. Word has length 99 [2022-01-10 20:02:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:50,062 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3812 transitions. [2022-01-10 20:02:50,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:50,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3812 transitions. [2022-01-10 20:02:50,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:50,064 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:50,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:50,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 20:02:50,065 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:50,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:50,065 INFO L85 PathProgramCache]: Analyzing trace with hash -875760635, now seen corresponding path program 1 times [2022-01-10 20:02:50,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:50,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205940086] [2022-01-10 20:02:50,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:50,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:50,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:50,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:50,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205940086] [2022-01-10 20:02:50,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205940086] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:50,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:50,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:50,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793371706] [2022-01-10 20:02:50,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:50,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:50,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:50,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:50,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:50,089 INFO L87 Difference]: Start difference. First operand 2860 states and 3812 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:50,242 INFO L93 Difference]: Finished difference Result 4079 states and 5621 transitions. [2022-01-10 20:02:50,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:50,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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 99 [2022-01-10 20:02:50,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:50,247 INFO L225 Difference]: With dead ends: 4079 [2022-01-10 20:02:50,247 INFO L226 Difference]: Without dead ends: 2860 [2022-01-10 20:02:50,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:50,249 INFO L933 BasicCegarLoop]: 1145 mSDtfsCounter, 1135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:50,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1135 Valid, 1145 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-10 20:02:50,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-10 20:02:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.3314665733286664) internal successors, (3804), 2859 states have internal predecessors, (3804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:50,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3804 transitions. [2022-01-10 20:02:50,384 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3804 transitions. Word has length 99 [2022-01-10 20:02:50,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:50,384 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3804 transitions. [2022-01-10 20:02:50,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:50,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3804 transitions. [2022-01-10 20:02:50,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:50,387 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:50,387 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:50,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 20:02:50,387 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:50,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:50,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1293771557, now seen corresponding path program 1 times [2022-01-10 20:02:50,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:50,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008589621] [2022-01-10 20:02:50,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:50,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:50,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:50,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008589621] [2022-01-10 20:02:50,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008589621] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:50,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:50,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:50,414 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365833013] [2022-01-10 20:02:50,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:50,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:50,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:50,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:50,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:50,414 INFO L87 Difference]: Start difference. First operand 2860 states and 3804 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:50,570 INFO L93 Difference]: Finished difference Result 4078 states and 5604 transitions. [2022-01-10 20:02:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:50,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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 99 [2022-01-10 20:02:50,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:50,573 INFO L225 Difference]: With dead ends: 4078 [2022-01-10 20:02:50,573 INFO L226 Difference]: Without dead ends: 2860 [2022-01-10 20:02:50,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:50,575 INFO L933 BasicCegarLoop]: 1140 mSDtfsCounter, 1129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:50,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1129 Valid, 1140 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:50,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-10 20:02:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-10 20:02:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.328666433321666) internal successors, (3796), 2859 states have internal predecessors, (3796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3796 transitions. [2022-01-10 20:02:50,698 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3796 transitions. Word has length 99 [2022-01-10 20:02:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:50,698 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3796 transitions. [2022-01-10 20:02:50,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3796 transitions. [2022-01-10 20:02:50,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:50,700 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:50,700 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:50,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 20:02:50,700 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:50,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:50,701 INFO L85 PathProgramCache]: Analyzing trace with hash -160264187, now seen corresponding path program 1 times [2022-01-10 20:02:50,701 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:50,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141300748] [2022-01-10 20:02:50,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:50,701 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:50,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:50,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141300748] [2022-01-10 20:02:50,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141300748] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:50,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:50,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:50,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539917116] [2022-01-10 20:02:50,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:50,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:50,724 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:50,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:50,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:50,725 INFO L87 Difference]: Start difference. First operand 2860 states and 3796 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:50,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:50,881 INFO L93 Difference]: Finished difference Result 4077 states and 5587 transitions. [2022-01-10 20:02:50,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:50,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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 99 [2022-01-10 20:02:50,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:50,885 INFO L225 Difference]: With dead ends: 4077 [2022-01-10 20:02:50,885 INFO L226 Difference]: Without dead ends: 2860 [2022-01-10 20:02:50,887 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:50,887 INFO L933 BasicCegarLoop]: 1135 mSDtfsCounter, 1123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:50,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1123 Valid, 1135 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-10 20:02:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-10 20:02:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.3258662933146657) internal successors, (3788), 2859 states have internal predecessors, (3788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3788 transitions. [2022-01-10 20:02:51,068 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3788 transitions. Word has length 99 [2022-01-10 20:02:51,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:51,069 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3788 transitions. [2022-01-10 20:02:51,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3788 transitions. [2022-01-10 20:02:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:51,071 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:51,071 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:51,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 20:02:51,071 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:51,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:51,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1454094555, now seen corresponding path program 1 times [2022-01-10 20:02:51,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:51,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338276474] [2022-01-10 20:02:51,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:51,072 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:51,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:51,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:51,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338276474] [2022-01-10 20:02:51,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338276474] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:51,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:51,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:51,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319858410] [2022-01-10 20:02:51,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:51,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:51,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:51,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:51,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:51,099 INFO L87 Difference]: Start difference. First operand 2860 states and 3788 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:51,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:51,272 INFO L93 Difference]: Finished difference Result 4076 states and 5570 transitions. [2022-01-10 20:02:51,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:51,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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 99 [2022-01-10 20:02:51,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:51,277 INFO L225 Difference]: With dead ends: 4076 [2022-01-10 20:02:51,277 INFO L226 Difference]: Without dead ends: 2860 [2022-01-10 20:02:51,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:51,279 INFO L933 BasicCegarLoop]: 1130 mSDtfsCounter, 1117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:51,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1117 Valid, 1130 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:51,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-10 20:02:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-10 20:02:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.3230661533076653) internal successors, (3780), 2859 states have internal predecessors, (3780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3780 transitions. [2022-01-10 20:02:51,465 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3780 transitions. Word has length 99 [2022-01-10 20:02:51,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:51,465 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3780 transitions. [2022-01-10 20:02:51,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3780 transitions. [2022-01-10 20:02:51,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:51,467 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:51,467 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:51,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 20:02:51,467 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:51,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:51,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2050020347, now seen corresponding path program 1 times [2022-01-10 20:02:51,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:51,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951815831] [2022-01-10 20:02:51,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:51,468 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:51,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:51,494 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:51,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951815831] [2022-01-10 20:02:51,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951815831] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:51,495 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:51,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:51,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263791038] [2022-01-10 20:02:51,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:51,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:51,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:51,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:51,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:51,496 INFO L87 Difference]: Start difference. First operand 2860 states and 3780 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:51,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:51,707 INFO L93 Difference]: Finished difference Result 4075 states and 5553 transitions. [2022-01-10 20:02:51,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:51,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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 99 [2022-01-10 20:02:51,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:51,711 INFO L225 Difference]: With dead ends: 4075 [2022-01-10 20:02:51,711 INFO L226 Difference]: Without dead ends: 2860 [2022-01-10 20:02:51,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:51,713 INFO L933 BasicCegarLoop]: 1125 mSDtfsCounter, 1111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:51,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1111 Valid, 1125 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:51,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-10 20:02:51,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-10 20:02:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.320266013300665) internal successors, (3772), 2859 states have internal predecessors, (3772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3772 transitions. [2022-01-10 20:02:51,859 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3772 transitions. Word has length 99 [2022-01-10 20:02:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:51,859 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3772 transitions. [2022-01-10 20:02:51,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3772 transitions. [2022-01-10 20:02:51,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:51,862 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:51,862 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:51,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 20:02:51,862 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:51,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:51,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1376507099, now seen corresponding path program 1 times [2022-01-10 20:02:51,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:51,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165144035] [2022-01-10 20:02:51,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:51,863 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:51,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:51,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165144035] [2022-01-10 20:02:51,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165144035] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:51,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:51,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:51,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993086100] [2022-01-10 20:02:51,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:51,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:51,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:51,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:51,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:51,892 INFO L87 Difference]: Start difference. First operand 2860 states and 3772 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:52,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:52,092 INFO L93 Difference]: Finished difference Result 4074 states and 5536 transitions. [2022-01-10 20:02:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:52,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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 99 [2022-01-10 20:02:52,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:52,096 INFO L225 Difference]: With dead ends: 4074 [2022-01-10 20:02:52,097 INFO L226 Difference]: Without dead ends: 2860 [2022-01-10 20:02:52,098 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:52,099 INFO L933 BasicCegarLoop]: 1102 mSDtfsCounter, 1024 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1024 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:52,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1024 Valid, 1170 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:52,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-10 20:02:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-10 20:02:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.311865593279664) internal successors, (3748), 2859 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3748 transitions. [2022-01-10 20:02:52,258 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3748 transitions. Word has length 99 [2022-01-10 20:02:52,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:52,258 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3748 transitions. [2022-01-10 20:02:52,258 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3748 transitions. [2022-01-10 20:02:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:52,260 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:52,260 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:52,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 20:02:52,261 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:52,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:52,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1869661052, now seen corresponding path program 1 times [2022-01-10 20:02:52,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:52,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830796870] [2022-01-10 20:02:52,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:52,261 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:52,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:52,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830796870] [2022-01-10 20:02:52,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830796870] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:52,288 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:52,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:52,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380416753] [2022-01-10 20:02:52,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:52,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:52,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:52,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:52,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:52,290 INFO L87 Difference]: Start difference. First operand 2860 states and 3748 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:52,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:52,460 INFO L93 Difference]: Finished difference Result 4073 states and 5487 transitions. [2022-01-10 20:02:52,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:52,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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 99 [2022-01-10 20:02:52,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:52,465 INFO L225 Difference]: With dead ends: 4073 [2022-01-10 20:02:52,465 INFO L226 Difference]: Without dead ends: 2860 [2022-01-10 20:02:52,466 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:52,466 INFO L933 BasicCegarLoop]: 1088 mSDtfsCounter, 1010 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1155 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:52,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1010 Valid, 1155 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:52,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-10 20:02:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-10 20:02:52,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.3034651732586628) internal successors, (3724), 2859 states have internal predecessors, (3724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3724 transitions. [2022-01-10 20:02:52,638 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3724 transitions. Word has length 99 [2022-01-10 20:02:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:52,638 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3724 transitions. [2022-01-10 20:02:52,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3724 transitions. [2022-01-10 20:02:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:52,640 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:52,640 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:52,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 20:02:52,641 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:52,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:52,641 INFO L85 PathProgramCache]: Analyzing trace with hash 11207523, now seen corresponding path program 1 times [2022-01-10 20:02:52,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:52,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537682715] [2022-01-10 20:02:52,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:52,641 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:52,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:52,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:52,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537682715] [2022-01-10 20:02:52,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537682715] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:52,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:52,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:52,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740873893] [2022-01-10 20:02:52,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:52,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:52,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:52,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:52,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:52,666 INFO L87 Difference]: Start difference. First operand 2860 states and 3724 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:52,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:52,851 INFO L93 Difference]: Finished difference Result 4072 states and 5438 transitions. [2022-01-10 20:02:52,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:52,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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 99 [2022-01-10 20:02:52,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:52,855 INFO L225 Difference]: With dead ends: 4072 [2022-01-10 20:02:52,855 INFO L226 Difference]: Without dead ends: 2860 [2022-01-10 20:02:52,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:52,858 INFO L933 BasicCegarLoop]: 1074 mSDtfsCounter, 996 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:52,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [996 Valid, 1140 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:52,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-10 20:02:53,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-10 20:02:53,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.2950647532376618) internal successors, (3700), 2859 states have internal predecessors, (3700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3700 transitions. [2022-01-10 20:02:53,028 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3700 transitions. Word has length 99 [2022-01-10 20:02:53,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:53,028 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3700 transitions. [2022-01-10 20:02:53,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3700 transitions. [2022-01-10 20:02:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:53,030 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:53,030 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:53,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 20:02:53,030 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:53,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:53,030 INFO L85 PathProgramCache]: Analyzing trace with hash 329995074, now seen corresponding path program 1 times [2022-01-10 20:02:53,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:53,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887322881] [2022-01-10 20:02:53,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:53,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:53,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:53,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887322881] [2022-01-10 20:02:53,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887322881] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:53,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:53,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:53,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522595374] [2022-01-10 20:02:53,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:53,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:53,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:53,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:53,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:53,067 INFO L87 Difference]: Start difference. First operand 2860 states and 3700 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:53,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:53,262 INFO L93 Difference]: Finished difference Result 4071 states and 5389 transitions. [2022-01-10 20:02:53,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:53,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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 99 [2022-01-10 20:02:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:53,267 INFO L225 Difference]: With dead ends: 4071 [2022-01-10 20:02:53,267 INFO L226 Difference]: Without dead ends: 2860 [2022-01-10 20:02:53,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:53,269 INFO L933 BasicCegarLoop]: 1060 mSDtfsCounter, 982 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:53,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [982 Valid, 1125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:53,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-10 20:02:53,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-10 20:02:53,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.2866643332166607) internal successors, (3676), 2859 states have internal predecessors, (3676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3676 transitions. [2022-01-10 20:02:53,444 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3676 transitions. Word has length 99 [2022-01-10 20:02:53,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:53,444 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3676 transitions. [2022-01-10 20:02:53,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3676 transitions. [2022-01-10 20:02:53,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:53,446 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:53,446 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:53,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 20:02:53,447 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:53,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:53,447 INFO L85 PathProgramCache]: Analyzing trace with hash 207145121, now seen corresponding path program 1 times [2022-01-10 20:02:53,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:53,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071185718] [2022-01-10 20:02:53,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:53,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:53,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:53,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:53,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071185718] [2022-01-10 20:02:53,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071185718] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:53,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:53,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:53,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112026430] [2022-01-10 20:02:53,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:53,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:53,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:53,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:53,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:53,474 INFO L87 Difference]: Start difference. First operand 2860 states and 3676 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:53,686 INFO L93 Difference]: Finished difference Result 4070 states and 5340 transitions. [2022-01-10 20:02:53,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:53,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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 99 [2022-01-10 20:02:53,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:53,690 INFO L225 Difference]: With dead ends: 4070 [2022-01-10 20:02:53,690 INFO L226 Difference]: Without dead ends: 2860 [2022-01-10 20:02:53,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:53,692 INFO L933 BasicCegarLoop]: 1046 mSDtfsCounter, 968 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:53,692 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [968 Valid, 1110 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:53,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-10 20:02:53,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-10 20:02:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.2782639131956597) internal successors, (3652), 2859 states have internal predecessors, (3652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3652 transitions. [2022-01-10 20:02:53,925 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3652 transitions. Word has length 99 [2022-01-10 20:02:53,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:53,925 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3652 transitions. [2022-01-10 20:02:53,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:53,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3652 transitions. [2022-01-10 20:02:53,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:53,927 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:53,927 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:53,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 20:02:53,928 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:53,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:53,928 INFO L85 PathProgramCache]: Analyzing trace with hash -318630144, now seen corresponding path program 1 times [2022-01-10 20:02:53,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:53,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842892079] [2022-01-10 20:02:53,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:53,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:53,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:53,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842892079] [2022-01-10 20:02:53,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842892079] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:53,952 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:53,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:53,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311343] [2022-01-10 20:02:53,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:53,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:53,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:53,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:53,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:53,953 INFO L87 Difference]: Start difference. First operand 2860 states and 3652 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:54,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:54,144 INFO L93 Difference]: Finished difference Result 4069 states and 5291 transitions. [2022-01-10 20:02:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:54,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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 99 [2022-01-10 20:02:54,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:54,149 INFO L225 Difference]: With dead ends: 4069 [2022-01-10 20:02:54,149 INFO L226 Difference]: Without dead ends: 2860 [2022-01-10 20:02:54,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:54,151 INFO L933 BasicCegarLoop]: 1032 mSDtfsCounter, 954 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:54,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [954 Valid, 1095 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:54,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-10 20:02:54,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-10 20:02:54,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.2698634931746586) internal successors, (3628), 2859 states have internal predecessors, (3628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3628 transitions. [2022-01-10 20:02:54,324 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3628 transitions. Word has length 99 [2022-01-10 20:02:54,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:54,325 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3628 transitions. [2022-01-10 20:02:54,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:54,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3628 transitions. [2022-01-10 20:02:54,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:54,326 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:54,326 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:54,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 20:02:54,327 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:54,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:54,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1829176609, now seen corresponding path program 1 times [2022-01-10 20:02:54,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:54,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405508107] [2022-01-10 20:02:54,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:54,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:54,347 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:54,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405508107] [2022-01-10 20:02:54,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405508107] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:54,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:54,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:54,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404913058] [2022-01-10 20:02:54,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:54,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:54,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:54,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:54,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:54,348 INFO L87 Difference]: Start difference. First operand 2860 states and 3628 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:54,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:54,571 INFO L93 Difference]: Finished difference Result 4068 states and 5242 transitions. [2022-01-10 20:02:54,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:54,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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 99 [2022-01-10 20:02:54,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:54,576 INFO L225 Difference]: With dead ends: 4068 [2022-01-10 20:02:54,576 INFO L226 Difference]: Without dead ends: 2860 [2022-01-10 20:02:54,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:54,579 INFO L933 BasicCegarLoop]: 1018 mSDtfsCounter, 940 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:54,580 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [940 Valid, 1080 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2860 states. [2022-01-10 20:02:54,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2860 to 2860. [2022-01-10 20:02:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2857 states have (on average 1.2614630731536576) internal successors, (3604), 2859 states have internal predecessors, (3604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 3604 transitions. [2022-01-10 20:02:54,761 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 3604 transitions. Word has length 99 [2022-01-10 20:02:54,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:54,761 INFO L470 AbstractCegarLoop]: Abstraction has 2860 states and 3604 transitions. [2022-01-10 20:02:54,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:54,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 3604 transitions. [2022-01-10 20:02:54,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:54,763 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:54,763 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:54,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 20:02:54,763 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:54,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:54,764 INFO L85 PathProgramCache]: Analyzing trace with hash 481232830, now seen corresponding path program 1 times [2022-01-10 20:02:54,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:54,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124335093] [2022-01-10 20:02:54,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:54,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:54,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:54,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124335093] [2022-01-10 20:02:54,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124335093] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:54,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:54,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:02:54,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958246727] [2022-01-10 20:02:54,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:54,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:02:54,803 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:54,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:02:54,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:02:54,804 INFO L87 Difference]: Start difference. First operand 2860 states and 3604 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 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-10 20:02:55,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:55,098 INFO L93 Difference]: Finished difference Result 4607 states and 5948 transitions. [2022-01-10 20:02:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:02:55,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 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 99 [2022-01-10 20:02:55,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:55,105 INFO L225 Difference]: With dead ends: 4607 [2022-01-10 20:02:55,105 INFO L226 Difference]: Without dead ends: 3406 [2022-01-10 20:02:55,107 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:02:55,108 INFO L933 BasicCegarLoop]: 1108 mSDtfsCounter, 2522 mSDsluCounter, 1514 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2522 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:55,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2522 Valid, 2622 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:02:55,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2022-01-10 20:02:55,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 2866. [2022-01-10 20:02:55,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2866 states, 2863 states have (on average 1.2553265805099545) internal successors, (3594), 2865 states have internal predecessors, (3594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:55,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 3594 transitions. [2022-01-10 20:02:55,341 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 3594 transitions. Word has length 99 [2022-01-10 20:02:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:55,341 INFO L470 AbstractCegarLoop]: Abstraction has 2866 states and 3594 transitions. [2022-01-10 20:02:55,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 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-10 20:02:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 3594 transitions. [2022-01-10 20:02:55,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:55,343 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:55,344 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:55,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 20:02:55,344 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:55,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:55,344 INFO L85 PathProgramCache]: Analyzing trace with hash -126844033, now seen corresponding path program 1 times [2022-01-10 20:02:55,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:55,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797431633] [2022-01-10 20:02:55,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:55,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:55,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:55,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797431633] [2022-01-10 20:02:55,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797431633] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:55,375 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:55,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:02:55,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059989328] [2022-01-10 20:02:55,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:55,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:02:55,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:55,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:02:55,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:02:55,376 INFO L87 Difference]: Start difference. First operand 2866 states and 3594 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 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-10 20:02:55,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:55,747 INFO L93 Difference]: Finished difference Result 4779 states and 6123 transitions. [2022-01-10 20:02:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:02:55,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 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 99 [2022-01-10 20:02:55,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:55,753 INFO L225 Difference]: With dead ends: 4779 [2022-01-10 20:02:55,753 INFO L226 Difference]: Without dead ends: 3586 [2022-01-10 20:02:55,755 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:02:55,755 INFO L933 BasicCegarLoop]: 1063 mSDtfsCounter, 2288 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 2988 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:55,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2288 Valid, 2988 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:02:55,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2022-01-10 20:02:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 2872. [2022-01-10 20:02:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2872 states, 2869 states have (on average 1.249215754618334) internal successors, (3584), 2871 states have internal predecessors, (3584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2872 states to 2872 states and 3584 transitions. [2022-01-10 20:02:56,021 INFO L78 Accepts]: Start accepts. Automaton has 2872 states and 3584 transitions. Word has length 99 [2022-01-10 20:02:56,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:56,021 INFO L470 AbstractCegarLoop]: Abstraction has 2872 states and 3584 transitions. [2022-01-10 20:02:56,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 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-10 20:02:56,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2872 states and 3584 transitions. [2022-01-10 20:02:56,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:56,023 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:56,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:56,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 20:02:56,023 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:56,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:56,024 INFO L85 PathProgramCache]: Analyzing trace with hash 566548672, now seen corresponding path program 1 times [2022-01-10 20:02:56,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:56,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198274484] [2022-01-10 20:02:56,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:56,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:56,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:56,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:56,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198274484] [2022-01-10 20:02:56,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198274484] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:56,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:56,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:02:56,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134843094] [2022-01-10 20:02:56,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:56,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:02:56,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:56,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:02:56,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:02:56,058 INFO L87 Difference]: Start difference. First operand 2872 states and 3584 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 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-10 20:02:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:56,384 INFO L93 Difference]: Finished difference Result 4874 states and 6197 transitions. [2022-01-10 20:02:56,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:02:56,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 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 99 [2022-01-10 20:02:56,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:56,390 INFO L225 Difference]: With dead ends: 4874 [2022-01-10 20:02:56,390 INFO L226 Difference]: Without dead ends: 3682 [2022-01-10 20:02:56,393 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:02:56,393 INFO L933 BasicCegarLoop]: 1036 mSDtfsCounter, 2163 mSDsluCounter, 2110 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2163 SdHoareTripleChecker+Valid, 3146 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:56,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2163 Valid, 3146 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:02:56,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3682 states. [2022-01-10 20:02:56,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3682 to 2878. [2022-01-10 20:02:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2878 states, 2875 states have (on average 1.2431304347826087) internal successors, (3574), 2877 states have internal predecessors, (3574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 3574 transitions. [2022-01-10 20:02:56,607 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 3574 transitions. Word has length 99 [2022-01-10 20:02:56,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:56,608 INFO L470 AbstractCegarLoop]: Abstraction has 2878 states and 3574 transitions. [2022-01-10 20:02:56,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 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-10 20:02:56,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 3574 transitions. [2022-01-10 20:02:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-10 20:02:56,609 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:56,609 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:56,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-10 20:02:56,609 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:56,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:56,610 INFO L85 PathProgramCache]: Analyzing trace with hash 558789313, now seen corresponding path program 1 times [2022-01-10 20:02:56,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:56,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028484636] [2022-01-10 20:02:56,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:56,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:56,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:56,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:56,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028484636] [2022-01-10 20:02:56,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028484636] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:56,640 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:56,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:56,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724408284] [2022-01-10 20:02:56,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:56,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:56,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:56,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:56,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:56,641 INFO L87 Difference]: Start difference. First operand 2878 states and 3574 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:57,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:57,047 INFO L93 Difference]: Finished difference Result 5219 states and 6557 transitions. [2022-01-10 20:02:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:57,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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 99 [2022-01-10 20:02:57,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:57,054 INFO L225 Difference]: With dead ends: 5219 [2022-01-10 20:02:57,054 INFO L226 Difference]: Without dead ends: 3995 [2022-01-10 20:02:57,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:57,057 INFO L933 BasicCegarLoop]: 992 mSDtfsCounter, 869 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:57,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [869 Valid, 1736 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:57,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3995 states. [2022-01-10 20:02:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3995 to 3899. [2022-01-10 20:02:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3899 states, 3896 states have (on average 1.2476899383983573) internal successors, (4861), 3898 states have internal predecessors, (4861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:57,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3899 states to 3899 states and 4861 transitions. [2022-01-10 20:02:57,412 INFO L78 Accepts]: Start accepts. Automaton has 3899 states and 4861 transitions. Word has length 99 [2022-01-10 20:02:57,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:57,412 INFO L470 AbstractCegarLoop]: Abstraction has 3899 states and 4861 transitions. [2022-01-10 20:02:57,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 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-10 20:02:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3899 states and 4861 transitions. [2022-01-10 20:02:57,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-10 20:02:57,414 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:57,414 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-10 20:02:57,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-10 20:02:57,414 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:57,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:57,415 INFO L85 PathProgramCache]: Analyzing trace with hash 228926803, now seen corresponding path program 1 times [2022-01-10 20:02:57,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:57,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888194986] [2022-01-10 20:02:57,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:57,415 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:57,434 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-10 20:02:57,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:57,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888194986] [2022-01-10 20:02:57,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888194986] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:57,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:57,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:57,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003577049] [2022-01-10 20:02:57,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:57,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:57,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:57,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:57,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:57,435 INFO L87 Difference]: Start difference. First operand 3899 states and 4861 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-10 20:02:57,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:57,784 INFO L93 Difference]: Finished difference Result 5543 states and 6965 transitions. [2022-01-10 20:02:57,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:57,784 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-10 20:02:57,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:57,788 INFO L225 Difference]: With dead ends: 5543 [2022-01-10 20:02:57,789 INFO L226 Difference]: Without dead ends: 4175 [2022-01-10 20:02:57,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:57,791 INFO L933 BasicCegarLoop]: 998 mSDtfsCounter, 978 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 1086 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-10 20:02:57,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [978 Valid, 1086 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:57,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4175 states. [2022-01-10 20:02:58,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4175 to 4136. [2022-01-10 20:02:58,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4136 states, 4133 states have (on average 1.2579240261311395) internal successors, (5199), 4135 states have internal predecessors, (5199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4136 states to 4136 states and 5199 transitions. [2022-01-10 20:02:58,100 INFO L78 Accepts]: Start accepts. Automaton has 4136 states and 5199 transitions. Word has length 100 [2022-01-10 20:02:58,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:58,100 INFO L470 AbstractCegarLoop]: Abstraction has 4136 states and 5199 transitions. [2022-01-10 20:02:58,100 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-10 20:02:58,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4136 states and 5199 transitions. [2022-01-10 20:02:58,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 20:02:58,102 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:58,102 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-10 20:02:58,102 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 20:02:58,102 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:58,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:58,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1263786758, now seen corresponding path program 1 times [2022-01-10 20:02:58,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:58,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725741674] [2022-01-10 20:02:58,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:58,103 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:58,132 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-10 20:02:58,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:58,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725741674] [2022-01-10 20:02:58,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725741674] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:58,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:58,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:58,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668952077] [2022-01-10 20:02:58,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:58,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:58,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:58,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:58,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:58,133 INFO L87 Difference]: Start difference. First operand 4136 states and 5199 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-10 20:02:58,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:58,433 INFO L93 Difference]: Finished difference Result 5745 states and 7244 transitions. [2022-01-10 20:02:58,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:58,433 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-10 20:02:58,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:58,438 INFO L225 Difference]: With dead ends: 5745 [2022-01-10 20:02:58,438 INFO L226 Difference]: Without dead ends: 4144 [2022-01-10 20:02:58,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:58,441 INFO L933 BasicCegarLoop]: 986 mSDtfsCounter, 69 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1862 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-10 20:02:58,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 1862 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4144 states. [2022-01-10 20:02:58,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4144 to 4144. [2022-01-10 20:02:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4141 states have (on average 1.2511470659261048) internal successors, (5181), 4143 states have internal predecessors, (5181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:58,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5181 transitions. [2022-01-10 20:02:58,781 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5181 transitions. Word has length 110 [2022-01-10 20:02:58,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:58,781 INFO L470 AbstractCegarLoop]: Abstraction has 4144 states and 5181 transitions. [2022-01-10 20:02:58,781 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-10 20:02:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5181 transitions. [2022-01-10 20:02:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 20:02:58,783 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:58,783 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-10 20:02:58,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 20:02:58,783 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:58,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:58,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1023246629, now seen corresponding path program 1 times [2022-01-10 20:02:58,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:58,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689351669] [2022-01-10 20:02:58,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:58,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:58,815 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-10 20:02:58,815 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:58,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689351669] [2022-01-10 20:02:58,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689351669] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:58,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:58,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:58,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709602776] [2022-01-10 20:02:58,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:58,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:58,816 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:58,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:58,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:58,816 INFO L87 Difference]: Start difference. First operand 4144 states and 5181 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-10 20:02:59,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:59,071 INFO L93 Difference]: Finished difference Result 4907 states and 6139 transitions. [2022-01-10 20:02:59,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:59,072 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-10 20:02:59,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:59,076 INFO L225 Difference]: With dead ends: 4907 [2022-01-10 20:02:59,076 INFO L226 Difference]: Without dead ends: 3298 [2022-01-10 20:02:59,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:59,078 INFO L933 BasicCegarLoop]: 989 mSDtfsCounter, 951 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 1010 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-10 20:02:59,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [951 Valid, 1010 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:59,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2022-01-10 20:02:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3298. [2022-01-10 20:02:59,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3298 states, 3295 states have (on average 1.243702579666161) internal successors, (4098), 3297 states have internal predecessors, (4098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 3298 states and 4098 transitions. [2022-01-10 20:02:59,332 INFO L78 Accepts]: Start accepts. Automaton has 3298 states and 4098 transitions. Word has length 110 [2022-01-10 20:02:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:59,333 INFO L470 AbstractCegarLoop]: Abstraction has 3298 states and 4098 transitions. [2022-01-10 20:02:59,333 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-10 20:02:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3298 states and 4098 transitions. [2022-01-10 20:02:59,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 20:02:59,334 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:59,334 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-10 20:02:59,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-10 20:02:59,334 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:59,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:59,335 INFO L85 PathProgramCache]: Analyzing trace with hash -697741496, now seen corresponding path program 1 times [2022-01-10 20:02:59,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:59,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456760747] [2022-01-10 20:02:59,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:59,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:59,368 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-10 20:02:59,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:59,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456760747] [2022-01-10 20:02:59,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456760747] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:59,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:59,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:59,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682068919] [2022-01-10 20:02:59,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:59,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:59,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:59,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:59,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:59,370 INFO L87 Difference]: Start difference. First operand 3298 states and 4098 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-10 20:02:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:59,652 INFO L93 Difference]: Finished difference Result 4070 states and 5042 transitions. [2022-01-10 20:02:59,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:59,652 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-10 20:02:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:59,656 INFO L225 Difference]: With dead ends: 4070 [2022-01-10 20:02:59,656 INFO L226 Difference]: Without dead ends: 3307 [2022-01-10 20:02:59,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:59,657 INFO L933 BasicCegarLoop]: 988 mSDtfsCounter, 60 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1866 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-10 20:02:59,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 1866 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:59,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3307 states. [2022-01-10 20:02:59,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3307 to 3307. [2022-01-10 20:02:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3307 states, 3304 states have (on average 1.2388014527845037) internal successors, (4093), 3306 states have internal predecessors, (4093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:59,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 4093 transitions. [2022-01-10 20:02:59,915 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 4093 transitions. Word has length 113 [2022-01-10 20:02:59,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:59,915 INFO L470 AbstractCegarLoop]: Abstraction has 3307 states and 4093 transitions. [2022-01-10 20:02:59,915 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-10 20:02:59,915 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 4093 transitions. [2022-01-10 20:02:59,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 20:02:59,917 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:59,917 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-10 20:02:59,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-10 20:02:59,917 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:02:59,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:59,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1146438135, now seen corresponding path program 1 times [2022-01-10 20:02:59,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:59,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953663018] [2022-01-10 20:02:59,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:59,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:59,948 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-10 20:02:59,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:59,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953663018] [2022-01-10 20:02:59,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953663018] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:59,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:59,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:59,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053793874] [2022-01-10 20:02:59,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:59,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:59,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:59,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:59,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:59,950 INFO L87 Difference]: Start difference. First operand 3307 states and 4093 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-10 20:03:00,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:00,182 INFO L93 Difference]: Finished difference Result 3702 states and 4556 transitions. [2022-01-10 20:03:00,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:00,182 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-10 20:03:00,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:00,185 INFO L225 Difference]: With dead ends: 3702 [2022-01-10 20:03:00,185 INFO L226 Difference]: Without dead ends: 2274 [2022-01-10 20:03:00,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:00,187 INFO L933 BasicCegarLoop]: 985 mSDtfsCounter, 936 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1003 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-10 20:03:00,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [936 Valid, 1003 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:00,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2022-01-10 20:03:00,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2274. [2022-01-10 20:03:00,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 2272 states have (on average 1.2680457746478873) internal successors, (2881), 2273 states have internal predecessors, (2881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 2881 transitions. [2022-01-10 20:03:00,354 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 2881 transitions. Word has length 113 [2022-01-10 20:03:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:00,355 INFO L470 AbstractCegarLoop]: Abstraction has 2274 states and 2881 transitions. [2022-01-10 20:03:00,355 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-10 20:03:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 2881 transitions. [2022-01-10 20:03:00,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 20:03:00,356 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:00,356 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:00,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-10 20:03:00,357 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:00,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:00,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1973880116, now seen corresponding path program 1 times [2022-01-10 20:03:00,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:00,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368348589] [2022-01-10 20:03:00,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:00,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:00,390 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:00,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:00,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368348589] [2022-01-10 20:03:00,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368348589] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:00,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:00,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:00,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101275651] [2022-01-10 20:03:00,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:00,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:00,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:00,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:00,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:00,392 INFO L87 Difference]: Start difference. First operand 2274 states and 2881 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:00,731 INFO L93 Difference]: Finished difference Result 6625 states and 8415 transitions. [2022-01-10 20:03:00,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:00,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2022-01-10 20:03:00,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:00,736 INFO L225 Difference]: With dead ends: 6625 [2022-01-10 20:03:00,736 INFO L226 Difference]: Without dead ends: 4386 [2022-01-10 20:03:00,738 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:00,739 INFO L933 BasicCegarLoop]: 860 mSDtfsCounter, 769 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:00,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [769 Valid, 1604 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:00,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4386 states. [2022-01-10 20:03:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4386 to 4198. [2022-01-10 20:03:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4198 states, 4196 states have (on average 1.2662059103908485) internal successors, (5313), 4197 states have internal predecessors, (5313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4198 states to 4198 states and 5313 transitions. [2022-01-10 20:03:01,030 INFO L78 Accepts]: Start accepts. Automaton has 4198 states and 5313 transitions. Word has length 160 [2022-01-10 20:03:01,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:01,030 INFO L470 AbstractCegarLoop]: Abstraction has 4198 states and 5313 transitions. [2022-01-10 20:03:01,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 4198 states and 5313 transitions. [2022-01-10 20:03:01,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 20:03:01,032 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:01,032 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:01,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-10 20:03:01,032 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:01,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:01,033 INFO L85 PathProgramCache]: Analyzing trace with hash -566757331, now seen corresponding path program 1 times [2022-01-10 20:03:01,033 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:01,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644897962] [2022-01-10 20:03:01,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:01,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:01,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:01,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:01,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644897962] [2022-01-10 20:03:01,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644897962] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:01,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:01,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:01,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360765615] [2022-01-10 20:03:01,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:01,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:01,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:01,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:01,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:01,067 INFO L87 Difference]: Start difference. First operand 4198 states and 5313 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:01,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:01,678 INFO L93 Difference]: Finished difference Result 12295 states and 15473 transitions. [2022-01-10 20:03:01,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:01,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2022-01-10 20:03:01,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:01,686 INFO L225 Difference]: With dead ends: 12295 [2022-01-10 20:03:01,686 INFO L226 Difference]: Without dead ends: 8187 [2022-01-10 20:03:01,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:01,691 INFO L933 BasicCegarLoop]: 1038 mSDtfsCounter, 769 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1880 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:01,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [769 Valid, 1880 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:01,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8187 states. [2022-01-10 20:03:02,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8187 to 8015. [2022-01-10 20:03:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8015 states, 8013 states have (on average 1.2508423811306626) internal successors, (10023), 8014 states have internal predecessors, (10023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:02,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8015 states to 8015 states and 10023 transitions. [2022-01-10 20:03:02,263 INFO L78 Accepts]: Start accepts. Automaton has 8015 states and 10023 transitions. Word has length 160 [2022-01-10 20:03:02,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:02,263 INFO L470 AbstractCegarLoop]: Abstraction has 8015 states and 10023 transitions. [2022-01-10 20:03:02,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:02,264 INFO L276 IsEmpty]: Start isEmpty. Operand 8015 states and 10023 transitions. [2022-01-10 20:03:02,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 20:03:02,267 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:02,267 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:02,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-10 20:03:02,267 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:02,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:02,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1019057354, now seen corresponding path program 1 times [2022-01-10 20:03:02,268 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:02,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224120647] [2022-01-10 20:03:02,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:02,268 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 20:03:02,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:02,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224120647] [2022-01-10 20:03:02,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224120647] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:02,322 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:02,322 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:02,322 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298432821] [2022-01-10 20:03:02,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:02,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:02,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:02,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:02,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:02,323 INFO L87 Difference]: Start difference. First operand 8015 states and 10023 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:02,883 INFO L93 Difference]: Finished difference Result 15908 states and 19904 transitions. [2022-01-10 20:03:02,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:02,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 160 [2022-01-10 20:03:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:02,892 INFO L225 Difference]: With dead ends: 15908 [2022-01-10 20:03:02,893 INFO L226 Difference]: Without dead ends: 7932 [2022-01-10 20:03:02,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:02,901 INFO L933 BasicCegarLoop]: 870 mSDtfsCounter, 865 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:02,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [865 Valid, 871 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7932 states. [2022-01-10 20:03:03,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7932 to 7932. [2022-01-10 20:03:03,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7932 states, 7930 states have (on average 1.2517023959646911) internal successors, (9926), 7931 states have internal predecessors, (9926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7932 states to 7932 states and 9926 transitions. [2022-01-10 20:03:03,570 INFO L78 Accepts]: Start accepts. Automaton has 7932 states and 9926 transitions. Word has length 160 [2022-01-10 20:03:03,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:03,570 INFO L470 AbstractCegarLoop]: Abstraction has 7932 states and 9926 transitions. [2022-01-10 20:03:03,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 7932 states and 9926 transitions. [2022-01-10 20:03:03,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-10 20:03:03,574 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:03,574 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:03,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-10 20:03:03,574 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:03,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:03,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1917694776, now seen corresponding path program 1 times [2022-01-10 20:03:03,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:03,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827562133] [2022-01-10 20:03:03,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:03,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:03,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:03,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827562133] [2022-01-10 20:03:03,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827562133] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:03,614 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:03,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:03,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258340004] [2022-01-10 20:03:03,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:03,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:03,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:03,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:03,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:03,615 INFO L87 Difference]: Start difference. First operand 7932 states and 9926 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:04,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:04,698 INFO L93 Difference]: Finished difference Result 22658 states and 28288 transitions. [2022-01-10 20:03:04,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:04,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2022-01-10 20:03:04,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:04,716 INFO L225 Difference]: With dead ends: 22658 [2022-01-10 20:03:04,716 INFO L226 Difference]: Without dead ends: 14816 [2022-01-10 20:03:04,725 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:04,726 INFO L933 BasicCegarLoop]: 1229 mSDtfsCounter, 628 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:04,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [628 Valid, 2078 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14816 states. [2022-01-10 20:03:05,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14816 to 14812. [2022-01-10 20:03:05,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14812 states, 14810 states have (on average 1.2440243079000675) internal successors, (18424), 14811 states have internal predecessors, (18424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:05,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14812 states to 14812 states and 18424 transitions. [2022-01-10 20:03:05,884 INFO L78 Accepts]: Start accepts. Automaton has 14812 states and 18424 transitions. Word has length 161 [2022-01-10 20:03:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:05,884 INFO L470 AbstractCegarLoop]: Abstraction has 14812 states and 18424 transitions. [2022-01-10 20:03:05,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 14812 states and 18424 transitions. [2022-01-10 20:03:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-10 20:03:05,891 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:05,891 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:05,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-10 20:03:05,891 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:05,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:05,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2071637991, now seen corresponding path program 1 times [2022-01-10 20:03:05,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:05,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291865552] [2022-01-10 20:03:05,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:05,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 20:03:05,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:05,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291865552] [2022-01-10 20:03:05,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291865552] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:05,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:05,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:05,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60853952] [2022-01-10 20:03:05,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:05,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:05,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:05,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:05,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:05,926 INFO L87 Difference]: Start difference. First operand 14812 states and 18424 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:07,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:07,093 INFO L93 Difference]: Finished difference Result 29452 states and 36650 transitions. [2022-01-10 20:03:07,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:07,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 161 [2022-01-10 20:03:07,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:07,112 INFO L225 Difference]: With dead ends: 29452 [2022-01-10 20:03:07,113 INFO L226 Difference]: Without dead ends: 14730 [2022-01-10 20:03:07,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:07,129 INFO L933 BasicCegarLoop]: 869 mSDtfsCounter, 863 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:07,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [863 Valid, 870 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:07,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14730 states. [2022-01-10 20:03:08,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14730 to 14730. [2022-01-10 20:03:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14730 states, 14728 states have (on average 1.2445002715915263) internal successors, (18329), 14729 states have internal predecessors, (18329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14730 states to 14730 states and 18329 transitions. [2022-01-10 20:03:08,435 INFO L78 Accepts]: Start accepts. Automaton has 14730 states and 18329 transitions. Word has length 161 [2022-01-10 20:03:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:08,435 INFO L470 AbstractCegarLoop]: Abstraction has 14730 states and 18329 transitions. [2022-01-10 20:03:08,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 14730 states and 18329 transitions. [2022-01-10 20:03:08,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 20:03:08,441 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:08,441 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:08,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-10 20:03:08,441 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:08,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:08,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2019497338, now seen corresponding path program 1 times [2022-01-10 20:03:08,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:08,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464070666] [2022-01-10 20:03:08,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:08,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:08,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:08,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:08,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464070666] [2022-01-10 20:03:08,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464070666] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:08,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:08,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:08,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937431657] [2022-01-10 20:03:08,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:08,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:08,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:08,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:08,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:08,545 INFO L87 Difference]: Start difference. First operand 14730 states and 18329 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:10,728 INFO L93 Difference]: Finished difference Result 42227 states and 52489 transitions. [2022-01-10 20:03:10,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:10,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2022-01-10 20:03:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:10,772 INFO L225 Difference]: With dead ends: 42227 [2022-01-10 20:03:10,773 INFO L226 Difference]: Without dead ends: 27587 [2022-01-10 20:03:10,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:10,790 INFO L933 BasicCegarLoop]: 1198 mSDtfsCounter, 633 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 2045 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:10,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [633 Valid, 2045 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:10,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27587 states. [2022-01-10 20:03:13,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27587 to 27583. [2022-01-10 20:03:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27583 states, 27581 states have (on average 1.2401653312062653) internal successors, (34205), 27582 states have internal predecessors, (34205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27583 states to 27583 states and 34205 transitions. [2022-01-10 20:03:13,232 INFO L78 Accepts]: Start accepts. Automaton has 27583 states and 34205 transitions. Word has length 162 [2022-01-10 20:03:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:13,233 INFO L470 AbstractCegarLoop]: Abstraction has 27583 states and 34205 transitions. [2022-01-10 20:03:13,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 27583 states and 34205 transitions. [2022-01-10 20:03:13,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 20:03:13,244 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:13,244 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:13,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-10 20:03:13,244 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:13,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:13,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1713862809, now seen corresponding path program 1 times [2022-01-10 20:03:13,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:13,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217579866] [2022-01-10 20:03:13,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:13,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:13,273 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 20:03:13,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:13,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217579866] [2022-01-10 20:03:13,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217579866] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:13,274 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:13,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:13,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991818183] [2022-01-10 20:03:13,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:13,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:13,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:13,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:13,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:13,275 INFO L87 Difference]: Start difference. First operand 27583 states and 34205 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:15,659 INFO L93 Difference]: Finished difference Result 54995 states and 68215 transitions. [2022-01-10 20:03:15,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:15,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 162 [2022-01-10 20:03:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:15,697 INFO L225 Difference]: With dead ends: 54995 [2022-01-10 20:03:15,698 INFO L226 Difference]: Without dead ends: 27502 [2022-01-10 20:03:15,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:15,720 INFO L933 BasicCegarLoop]: 868 mSDtfsCounter, 861 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:15,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [861 Valid, 869 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:15,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27502 states. [2022-01-10 20:03:18,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27502 to 27502. [2022-01-10 20:03:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27502 states, 27500 states have (on average 1.2404363636363636) internal successors, (34112), 27501 states have internal predecessors, (34112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27502 states to 27502 states and 34112 transitions. [2022-01-10 20:03:18,289 INFO L78 Accepts]: Start accepts. Automaton has 27502 states and 34112 transitions. Word has length 162 [2022-01-10 20:03:18,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:18,289 INFO L470 AbstractCegarLoop]: Abstraction has 27502 states and 34112 transitions. [2022-01-10 20:03:18,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 27502 states and 34112 transitions. [2022-01-10 20:03:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-10 20:03:18,300 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:18,300 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:18,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-10 20:03:18,301 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:18,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:18,302 INFO L85 PathProgramCache]: Analyzing trace with hash 806560569, now seen corresponding path program 1 times [2022-01-10 20:03:18,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:18,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306029922] [2022-01-10 20:03:18,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:18,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:18,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-10 20:03:18,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:18,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306029922] [2022-01-10 20:03:18,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306029922] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:18,339 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:18,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:18,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994794938] [2022-01-10 20:03:18,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:18,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:18,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:18,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:18,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:18,340 INFO L87 Difference]: Start difference. First operand 27502 states and 34112 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:22,660 INFO L93 Difference]: Finished difference Result 79926 states and 99118 transitions. [2022-01-10 20:03:22,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:22,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2022-01-10 20:03:22,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:22,740 INFO L225 Difference]: With dead ends: 79926 [2022-01-10 20:03:22,741 INFO L226 Difference]: Without dead ends: 52514 [2022-01-10 20:03:22,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:22,768 INFO L933 BasicCegarLoop]: 1053 mSDtfsCounter, 770 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1889 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:22,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 1889 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:03:22,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52514 states. [2022-01-10 20:03:27,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52514 to 51358. [2022-01-10 20:03:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51358 states, 51356 states have (on average 1.2373627229535011) internal successors, (63546), 51357 states have internal predecessors, (63546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51358 states to 51358 states and 63546 transitions. [2022-01-10 20:03:27,584 INFO L78 Accepts]: Start accepts. Automaton has 51358 states and 63546 transitions. Word has length 163 [2022-01-10 20:03:27,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:27,585 INFO L470 AbstractCegarLoop]: Abstraction has 51358 states and 63546 transitions. [2022-01-10 20:03:27,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 51358 states and 63546 transitions. [2022-01-10 20:03:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-01-10 20:03:27,601 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:27,605 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:27,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-10 20:03:27,606 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:27,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:27,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1907245210, now seen corresponding path program 1 times [2022-01-10 20:03:27,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:27,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531992054] [2022-01-10 20:03:27,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:27,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 20:03:27,679 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:27,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531992054] [2022-01-10 20:03:27,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531992054] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:27,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:27,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:27,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40668576] [2022-01-10 20:03:27,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:27,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:27,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:27,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:27,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:27,680 INFO L87 Difference]: Start difference. First operand 51358 states and 63546 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-10 20:03:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:32,288 INFO L93 Difference]: Finished difference Result 102576 states and 126934 transitions. [2022-01-10 20:03:32,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:32,289 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 163 [2022-01-10 20:03:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:32,378 INFO L225 Difference]: With dead ends: 102576 [2022-01-10 20:03:32,378 INFO L226 Difference]: Without dead ends: 51278 [2022-01-10 20:03:32,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:32,431 INFO L933 BasicCegarLoop]: 867 mSDtfsCounter, 859 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:32,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [859 Valid, 868 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:32,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51278 states. [2022-01-10 20:03:37,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51278 to 51278. [2022-01-10 20:03:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51278 states, 51276 states have (on average 1.237518527186208) internal successors, (63455), 51277 states have internal predecessors, (63455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51278 states to 51278 states and 63455 transitions. [2022-01-10 20:03:37,338 INFO L78 Accepts]: Start accepts. Automaton has 51278 states and 63455 transitions. Word has length 163 [2022-01-10 20:03:37,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:37,338 INFO L470 AbstractCegarLoop]: Abstraction has 51278 states and 63455 transitions. [2022-01-10 20:03:37,340 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-10 20:03:37,340 INFO L276 IsEmpty]: Start isEmpty. Operand 51278 states and 63455 transitions. [2022-01-10 20:03:37,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-01-10 20:03:37,354 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:37,354 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:03:37,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-10 20:03:37,354 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-01-10 20:03:37,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:37,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1505700274, now seen corresponding path program 1 times [2022-01-10 20:03:37,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:37,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706330618] [2022-01-10 20:03:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:37,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:37,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:37,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706330618] [2022-01-10 20:03:37,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706330618] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:37,421 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:37,421 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:37,421 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589236936] [2022-01-10 20:03:37,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:37,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:37,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:37,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:37,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:37,422 INFO L87 Difference]: Start difference. First operand 51278 states and 63455 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:46,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:46,205 INFO L93 Difference]: Finished difference Result 147870 states and 182947 transitions. [2022-01-10 20:03:46,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:46,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2022-01-10 20:03:46,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:46,464 INFO L225 Difference]: With dead ends: 147870 [2022-01-10 20:03:46,464 INFO L226 Difference]: Without dead ends: 96682 [2022-01-10 20:03:46,511 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:46,512 INFO L933 BasicCegarLoop]: 866 mSDtfsCounter, 772 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:46,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [772 Valid, 1613 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96682 states.