/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 01:50:50,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 01:50:50,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 01:50:50,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 01:50:50,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 01:50:50,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 01:50:50,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 01:50:50,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 01:50:50,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 01:50:50,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 01:50:50,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 01:50:50,524 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 01:50:50,524 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 01:50:50,524 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 01:50:50,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 01:50:50,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 01:50:50,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 01:50:50,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 01:50:50,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 01:50:50,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 01:50:50,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 01:50:50,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 01:50:50,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 01:50:50,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 01:50:50,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 01:50:50,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 01:50:50,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 01:50:50,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 01:50:50,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 01:50:50,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 01:50:50,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 01:50:50,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 01:50:50,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 01:50:50,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 01:50:50,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 01:50:50,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 01:50:50,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 01:50:50,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 01:50:50,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 01:50:50,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 01:50:50,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 01:50:50,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-11 01:50:50,564 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 01:50:50,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 01:50:50,565 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 01:50:50,565 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 01:50:50,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 01:50:50,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 01:50:50,566 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 01:50:50,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 01:50:50,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 01:50:50,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 01:50:50,566 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 01:50:50,566 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 01:50:50,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 01:50:50,567 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 01:50:50,567 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 01:50:50,567 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 01:50:50,567 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 01:50:50,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 01:50:50,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 01:50:50,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 01:50:50,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 01:50:50,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:50:50,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 01:50:50,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 01:50:50,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 01:50:50,568 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 01:50:50,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 01:50:50,568 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 01:50:50,568 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 01:50:50,568 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 01:50:50,568 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 01:50:50,568 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 01:50:50,569 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 01:50:50,569 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 01:50:50,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 01:50:50,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 01:50:50,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 01:50:50,771 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 01:50:50,772 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 01:50:50,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c [2022-01-11 01:50:50,819 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a78c7add8/ddf0df19c6004017bbb533a2425669f7/FLAGbd98ac906 [2022-01-11 01:50:51,190 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 01:50:51,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_3.cil+token_ring.03.cil-2.c [2022-01-11 01:50:51,204 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a78c7add8/ddf0df19c6004017bbb533a2425669f7/FLAGbd98ac906 [2022-01-11 01:50:51,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a78c7add8/ddf0df19c6004017bbb533a2425669f7 [2022-01-11 01:50:51,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 01:50:51,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 01:50:51,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 01:50:51,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 01:50:51,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 01:50:51,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:50:51" (1/1) ... [2022-01-11 01:50:51,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e2e7df8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:51, skipping insertion in model container [2022-01-11 01:50:51,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:50:51" (1/1) ... [2022-01-11 01:50:51,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 01:50:51,614 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 01:50:51,731 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_3.cil+token_ring.03.cil-2.c[911,924] [2022-01-11 01:50:51,767 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_3.cil+token_ring.03.cil-2.c[8416,8429] [2022-01-11 01:50:51,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:50:51,800 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 01:50:51,807 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_3.cil+token_ring.03.cil-2.c[911,924] [2022-01-11 01:50:51,821 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_3.cil+token_ring.03.cil-2.c[8416,8429] [2022-01-11 01:50:51,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 01:50:51,851 INFO L208 MainTranslator]: Completed translation [2022-01-11 01:50:51,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:51 WrapperNode [2022-01-11 01:50:51,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 01:50:51,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 01:50:51,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 01:50:51,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 01:50:51,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:51" (1/1) ... [2022-01-11 01:50:51,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:51" (1/1) ... [2022-01-11 01:50:51,914 INFO L137 Inliner]: procedures = 62, calls = 70, calls flagged for inlining = 65, calls inlined = 95, statements flattened = 1217 [2022-01-11 01:50:51,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 01:50:51,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 01:50:51,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 01:50:51,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 01:50:51,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:51" (1/1) ... [2022-01-11 01:50:51,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:51" (1/1) ... [2022-01-11 01:50:51,924 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:51" (1/1) ... [2022-01-11 01:50:51,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:51" (1/1) ... [2022-01-11 01:50:51,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:51" (1/1) ... [2022-01-11 01:50:51,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:51" (1/1) ... [2022-01-11 01:50:51,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:51" (1/1) ... [2022-01-11 01:50:51,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 01:50:51,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 01:50:51,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 01:50:51,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 01:50:51,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:51" (1/1) ... [2022-01-11 01:50:51,955 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 01:50:51,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 01:50:51,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 01:50:51,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 01:50:52,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 01:50:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 01:50:52,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 01:50:52,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 01:50:52,069 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 01:50:52,070 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 01:50:52,761 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##107: assume !(1bv32 == ~q_free~0); [2022-01-11 01:50:52,762 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume 1bv32 == ~q_free~0;~c_dr_st~0 := 2bv32;~c_dr_pc~0 := 2bv32;~a_t~0 := do_read_c_~a~0#1; [2022-01-11 01:50:52,762 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 01:50:52,769 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 01:50:52,769 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-01-11 01:50:52,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:50:52 BoogieIcfgContainer [2022-01-11 01:50:52,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 01:50:52,772 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 01:50:52,772 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 01:50:52,772 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 01:50:52,774 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:50:52" (1/1) ... [2022-01-11 01:50:52,947 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:50:52 BasicIcfg [2022-01-11 01:50:52,948 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 01:50:52,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 01:50:52,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 01:50:52,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 01:50:52,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 01:50:51" (1/4) ... [2022-01-11 01:50:52,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24846bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:50:52, skipping insertion in model container [2022-01-11 01:50:52,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:50:51" (2/4) ... [2022-01-11 01:50:52,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24846bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:50:52, skipping insertion in model container [2022-01-11 01:50:52,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:50:52" (3/4) ... [2022-01-11 01:50:52,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24846bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 01:50:52, skipping insertion in model container [2022-01-11 01:50:52,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 01:50:52" (4/4) ... [2022-01-11 01:50:52,952 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.03.cil-2.cTransformedIcfg [2022-01-11 01:50:52,956 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 01:50:52,956 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-11 01:50:52,984 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 01:50:52,988 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 01:50:52,988 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-11 01:50:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 467 states, 463 states have (on average 1.5529157667386608) internal successors, (719), 466 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:53,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:50:53,006 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:53,006 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:53,006 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:53,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:53,010 INFO L85 PathProgramCache]: Analyzing trace with hash -750293995, now seen corresponding path program 1 times [2022-01-11 01:50:53,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:53,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779916012] [2022-01-11 01:50:53,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:53,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:53,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:53,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:53,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779916012] [2022-01-11 01:50:53,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779916012] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:53,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:53,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:53,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020667687] [2022-01-11 01:50:53,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:53,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:53,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:53,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:53,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:53,305 INFO L87 Difference]: Start difference. First operand has 467 states, 463 states have (on average 1.5529157667386608) internal successors, (719), 466 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:53,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:53,494 INFO L93 Difference]: Finished difference Result 1002 states and 1543 transitions. [2022-01-11 01:50:53,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:53,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-11 01:50:53,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:53,512 INFO L225 Difference]: With dead ends: 1002 [2022-01-11 01:50:53,512 INFO L226 Difference]: Without dead ends: 590 [2022-01-11 01:50:53,519 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:53,522 INFO L933 BasicCegarLoop]: 685 mSDtfsCounter, 185 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:53,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 1340 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:50:53,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-01-11 01:50:53,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 586. [2022-01-11 01:50:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 583 states have (on average 1.4888507718696398) internal successors, (868), 585 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 868 transitions. [2022-01-11 01:50:53,590 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 868 transitions. Word has length 44 [2022-01-11 01:50:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:53,590 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 868 transitions. [2022-01-11 01:50:53,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:53,591 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 868 transitions. [2022-01-11 01:50:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-11 01:50:53,592 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:53,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:53,592 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 01:50:53,592 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:53,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:53,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1591854676, now seen corresponding path program 1 times [2022-01-11 01:50:53,593 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:53,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244164310] [2022-01-11 01:50:53,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:53,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:53,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:53,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244164310] [2022-01-11 01:50:53,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244164310] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:53,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:53,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:53,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30829296] [2022-01-11 01:50:53,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:53,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:53,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:53,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:53,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:53,643 INFO L87 Difference]: Start difference. First operand 586 states and 868 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:53,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:53,753 INFO L93 Difference]: Finished difference Result 1004 states and 1473 transitions. [2022-01-11 01:50:53,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:53,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-11 01:50:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:53,757 INFO L225 Difference]: With dead ends: 1004 [2022-01-11 01:50:53,757 INFO L226 Difference]: Without dead ends: 764 [2022-01-11 01:50:53,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:53,758 INFO L933 BasicCegarLoop]: 672 mSDtfsCounter, 646 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:53,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [646 Valid, 807 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-01-11 01:50:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 756. [2022-01-11 01:50:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 753 states have (on average 1.4648074369189907) internal successors, (1103), 755 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:53,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1103 transitions. [2022-01-11 01:50:53,800 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1103 transitions. Word has length 44 [2022-01-11 01:50:53,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:53,801 INFO L470 AbstractCegarLoop]: Abstraction has 756 states and 1103 transitions. [2022-01-11 01:50:53,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1103 transitions. [2022-01-11 01:50:53,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-11 01:50:53,812 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:53,812 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:53,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 01:50:53,812 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:53,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:53,814 INFO L85 PathProgramCache]: Analyzing trace with hash 537158233, now seen corresponding path program 1 times [2022-01-11 01:50:53,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:53,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390007778] [2022-01-11 01:50:53,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:53,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:53,883 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:53,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390007778] [2022-01-11 01:50:53,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390007778] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:53,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:53,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:53,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585389346] [2022-01-11 01:50:53,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:53,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:53,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:53,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:53,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:53,886 INFO L87 Difference]: Start difference. First operand 756 states and 1103 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:53,940 INFO L93 Difference]: Finished difference Result 1478 states and 2137 transitions. [2022-01-11 01:50:53,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:53,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-11 01:50:53,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:53,944 INFO L225 Difference]: With dead ends: 1478 [2022-01-11 01:50:53,944 INFO L226 Difference]: Without dead ends: 1082 [2022-01-11 01:50:53,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:53,949 INFO L933 BasicCegarLoop]: 666 mSDtfsCounter, 630 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:53,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 804 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:53,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2022-01-11 01:50:53,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1074. [2022-01-11 01:50:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 1071 states have (on average 1.4341736694677871) internal successors, (1536), 1073 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1536 transitions. [2022-01-11 01:50:53,980 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1536 transitions. Word has length 45 [2022-01-11 01:50:53,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:53,981 INFO L470 AbstractCegarLoop]: Abstraction has 1074 states and 1536 transitions. [2022-01-11 01:50:53,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1536 transitions. [2022-01-11 01:50:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-11 01:50:53,982 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:53,982 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:53,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 01:50:53,982 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:53,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:53,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1762030591, now seen corresponding path program 1 times [2022-01-11 01:50:53,983 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:53,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784199340] [2022-01-11 01:50:53,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:53,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:54,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 01:50:54,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:54,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784199340] [2022-01-11 01:50:54,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784199340] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:54,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:54,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:54,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611364879] [2022-01-11 01:50:54,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:54,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:54,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:54,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:54,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:54,074 INFO L87 Difference]: Start difference. First operand 1074 states and 1536 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:54,136 INFO L93 Difference]: Finished difference Result 2442 states and 3438 transitions. [2022-01-11 01:50:54,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:54,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 59 [2022-01-11 01:50:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:54,141 INFO L225 Difference]: With dead ends: 2442 [2022-01-11 01:50:54,142 INFO L226 Difference]: Without dead ends: 1746 [2022-01-11 01:50:54,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:54,150 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 625 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:54,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [625 Valid, 834 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:54,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2022-01-11 01:50:54,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1742. [2022-01-11 01:50:54,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1742 states, 1739 states have (on average 1.3927544565842438) internal successors, (2422), 1741 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 2422 transitions. [2022-01-11 01:50:54,198 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 2422 transitions. Word has length 59 [2022-01-11 01:50:54,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:54,200 INFO L470 AbstractCegarLoop]: Abstraction has 1742 states and 2422 transitions. [2022-01-11 01:50:54,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 2422 transitions. [2022-01-11 01:50:54,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-11 01:50:54,202 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:54,202 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, 1] [2022-01-11 01:50:54,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 01:50:54,203 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:54,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:54,205 INFO L85 PathProgramCache]: Analyzing trace with hash -2076908643, now seen corresponding path program 1 times [2022-01-11 01:50:54,205 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:54,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724265854] [2022-01-11 01:50:54,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:54,206 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:54,300 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:54,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:54,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724265854] [2022-01-11 01:50:54,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724265854] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:54,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:54,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:54,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388785548] [2022-01-11 01:50:54,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:54,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:54,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:54,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:54,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:54,302 INFO L87 Difference]: Start difference. First operand 1742 states and 2422 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:54,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:54,409 INFO L93 Difference]: Finished difference Result 4366 states and 6004 transitions. [2022-01-11 01:50:54,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:54,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2022-01-11 01:50:54,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:54,417 INFO L225 Difference]: With dead ends: 4366 [2022-01-11 01:50:54,417 INFO L226 Difference]: Without dead ends: 3046 [2022-01-11 01:50:54,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:54,419 INFO L933 BasicCegarLoop]: 820 mSDtfsCounter, 146 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:54,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 1476 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:54,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3046 states. [2022-01-11 01:50:54,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3046 to 3046. [2022-01-11 01:50:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3046 states, 3043 states have (on average 1.3637857377587908) internal successors, (4150), 3045 states have internal predecessors, (4150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:54,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 4150 transitions. [2022-01-11 01:50:54,501 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 4150 transitions. Word has length 61 [2022-01-11 01:50:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:54,503 INFO L470 AbstractCegarLoop]: Abstraction has 3046 states and 4150 transitions. [2022-01-11 01:50:54,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:54,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 4150 transitions. [2022-01-11 01:50:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:50:54,506 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:54,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:54,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 01:50:54,507 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:54,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:54,507 INFO L85 PathProgramCache]: Analyzing trace with hash -602574848, now seen corresponding path program 1 times [2022-01-11 01:50:54,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:54,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130620807] [2022-01-11 01:50:54,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:54,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:54,554 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:54,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130620807] [2022-01-11 01:50:54,554 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130620807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:54,554 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:54,554 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:54,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239502480] [2022-01-11 01:50:54,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:54,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:54,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:54,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:54,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:54,555 INFO L87 Difference]: Start difference. First operand 3046 states and 4150 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:54,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:54,625 INFO L93 Difference]: Finished difference Result 3361 states and 4623 transitions. [2022-01-11 01:50:54,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:54,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 01:50:54,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:54,632 INFO L225 Difference]: With dead ends: 3361 [2022-01-11 01:50:54,632 INFO L226 Difference]: Without dead ends: 3046 [2022-01-11 01:50:54,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:54,674 INFO L933 BasicCegarLoop]: 671 mSDtfsCounter, 474 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:54,674 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [474 Valid, 865 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:54,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3046 states. [2022-01-11 01:50:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3046 to 3046. [2022-01-11 01:50:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3046 states, 3043 states have (on average 1.3634571146894512) internal successors, (4149), 3045 states have internal predecessors, (4149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3046 states to 3046 states and 4149 transitions. [2022-01-11 01:50:54,751 INFO L78 Accepts]: Start accepts. Automaton has 3046 states and 4149 transitions. Word has length 66 [2022-01-11 01:50:54,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:54,751 INFO L470 AbstractCegarLoop]: Abstraction has 3046 states and 4149 transitions. [2022-01-11 01:50:54,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3046 states and 4149 transitions. [2022-01-11 01:50:54,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:50:54,753 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:54,753 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:54,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 01:50:54,753 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:54,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:54,754 INFO L85 PathProgramCache]: Analyzing trace with hash 564121471, now seen corresponding path program 1 times [2022-01-11 01:50:54,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:54,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167775089] [2022-01-11 01:50:54,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:54,754 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:54,786 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:54,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167775089] [2022-01-11 01:50:54,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167775089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:54,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:54,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:54,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931082476] [2022-01-11 01:50:54,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:54,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:54,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:54,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:54,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:54,788 INFO L87 Difference]: Start difference. First operand 3046 states and 4149 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:54,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:54,879 INFO L93 Difference]: Finished difference Result 3591 states and 4962 transitions. [2022-01-11 01:50:54,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:54,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 01:50:54,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:54,890 INFO L225 Difference]: With dead ends: 3591 [2022-01-11 01:50:54,890 INFO L226 Difference]: Without dead ends: 3281 [2022-01-11 01:50:54,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:54,892 INFO L933 BasicCegarLoop]: 666 mSDtfsCounter, 614 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:54,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [614 Valid, 1051 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:54,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3281 states. [2022-01-11 01:50:55,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3281 to 3279. [2022-01-11 01:50:55,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3279 states, 3276 states have (on average 1.3714896214896215) internal successors, (4493), 3278 states have internal predecessors, (4493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 4493 transitions. [2022-01-11 01:50:55,025 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 4493 transitions. Word has length 66 [2022-01-11 01:50:55,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:55,026 INFO L470 AbstractCegarLoop]: Abstraction has 3279 states and 4493 transitions. [2022-01-11 01:50:55,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:55,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 4493 transitions. [2022-01-11 01:50:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:50:55,028 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:55,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:55,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 01:50:55,028 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:55,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:55,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1829223327, now seen corresponding path program 1 times [2022-01-11 01:50:55,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:55,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752425000] [2022-01-11 01:50:55,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:55,029 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:55,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-11 01:50:55,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:55,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752425000] [2022-01-11 01:50:55,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752425000] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:55,065 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:55,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:55,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830893002] [2022-01-11 01:50:55,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:55,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:55,066 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:55,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:55,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:55,067 INFO L87 Difference]: Start difference. First operand 3279 states and 4493 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:55,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:55,168 INFO L93 Difference]: Finished difference Result 3821 states and 5300 transitions. [2022-01-11 01:50:55,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:55,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 01:50:55,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:55,176 INFO L225 Difference]: With dead ends: 3821 [2022-01-11 01:50:55,176 INFO L226 Difference]: Without dead ends: 3279 [2022-01-11 01:50:55,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:55,178 INFO L933 BasicCegarLoop]: 660 mSDtfsCounter, 654 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:55,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [654 Valid, 660 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:55,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2022-01-11 01:50:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3279. [2022-01-11 01:50:55,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3279 states, 3276 states have (on average 1.369047619047619) internal successors, (4485), 3278 states have internal predecessors, (4485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:55,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 4485 transitions. [2022-01-11 01:50:55,278 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 4485 transitions. Word has length 66 [2022-01-11 01:50:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:55,278 INFO L470 AbstractCegarLoop]: Abstraction has 3279 states and 4485 transitions. [2022-01-11 01:50:55,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 4485 transitions. [2022-01-11 01:50:55,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:50:55,280 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:55,280 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:55,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 01:50:55,280 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:55,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:55,280 INFO L85 PathProgramCache]: Analyzing trace with hash 484559743, now seen corresponding path program 1 times [2022-01-11 01:50:55,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:55,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930008355] [2022-01-11 01:50:55,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:55,281 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:55,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:55,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930008355] [2022-01-11 01:50:55,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930008355] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:55,318 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:55,318 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:55,318 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295043643] [2022-01-11 01:50:55,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:55,319 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:55,319 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:55,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:55,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:55,320 INFO L87 Difference]: Start difference. First operand 3279 states and 4485 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:55,416 INFO L93 Difference]: Finished difference Result 3820 states and 5283 transitions. [2022-01-11 01:50:55,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:55,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 01:50:55,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:55,424 INFO L225 Difference]: With dead ends: 3820 [2022-01-11 01:50:55,424 INFO L226 Difference]: Without dead ends: 3279 [2022-01-11 01:50:55,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:55,427 INFO L933 BasicCegarLoop]: 655 mSDtfsCounter, 648 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:55,427 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [648 Valid, 655 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2022-01-11 01:50:55,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3279. [2022-01-11 01:50:55,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3279 states, 3276 states have (on average 1.3666056166056166) internal successors, (4477), 3278 states have internal predecessors, (4477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 4477 transitions. [2022-01-11 01:50:55,518 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 4477 transitions. Word has length 66 [2022-01-11 01:50:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:55,518 INFO L470 AbstractCegarLoop]: Abstraction has 3279 states and 4477 transitions. [2022-01-11 01:50:55,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:55,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 4477 transitions. [2022-01-11 01:50:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:50:55,523 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:55,523 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:55,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 01:50:55,523 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:55,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:55,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1133920159, now seen corresponding path program 1 times [2022-01-11 01:50:55,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:55,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376359373] [2022-01-11 01:50:55,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:55,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:55,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:55,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:55,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376359373] [2022-01-11 01:50:55,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376359373] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:55,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:55,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:55,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675838750] [2022-01-11 01:50:55,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:55,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:55,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:55,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:55,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:55,544 INFO L87 Difference]: Start difference. First operand 3279 states and 4477 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:55,629 INFO L93 Difference]: Finished difference Result 3819 states and 5266 transitions. [2022-01-11 01:50:55,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:55,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 01:50:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:55,637 INFO L225 Difference]: With dead ends: 3819 [2022-01-11 01:50:55,637 INFO L226 Difference]: Without dead ends: 3279 [2022-01-11 01:50:55,638 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:55,639 INFO L933 BasicCegarLoop]: 650 mSDtfsCounter, 642 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:55,639 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [642 Valid, 650 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:55,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2022-01-11 01:50:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3279. [2022-01-11 01:50:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3279 states, 3276 states have (on average 1.3641636141636142) internal successors, (4469), 3278 states have internal predecessors, (4469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:55,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 4469 transitions. [2022-01-11 01:50:55,736 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 4469 transitions. Word has length 66 [2022-01-11 01:50:55,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:55,736 INFO L470 AbstractCegarLoop]: Abstraction has 3279 states and 4469 transitions. [2022-01-11 01:50:55,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:55,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 4469 transitions. [2022-01-11 01:50:55,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:50:55,738 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:55,738 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:55,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 01:50:55,739 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:55,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:55,739 INFO L85 PathProgramCache]: Analyzing trace with hash -791613152, now seen corresponding path program 1 times [2022-01-11 01:50:55,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:55,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272427362] [2022-01-11 01:50:55,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:55,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:55,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:55,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:55,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272427362] [2022-01-11 01:50:55,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272427362] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:55,762 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:55,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:55,762 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862588754] [2022-01-11 01:50:55,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:55,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:55,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:55,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:55,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:55,763 INFO L87 Difference]: Start difference. First operand 3279 states and 4469 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:55,860 INFO L93 Difference]: Finished difference Result 3818 states and 5249 transitions. [2022-01-11 01:50:55,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:55,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 01:50:55,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:55,879 INFO L225 Difference]: With dead ends: 3818 [2022-01-11 01:50:55,879 INFO L226 Difference]: Without dead ends: 3279 [2022-01-11 01:50:55,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:55,881 INFO L933 BasicCegarLoop]: 633 mSDtfsCounter, 588 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:55,881 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [588 Valid, 671 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:55,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2022-01-11 01:50:55,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3279. [2022-01-11 01:50:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3279 states, 3276 states have (on average 1.3586691086691087) internal successors, (4451), 3278 states have internal predecessors, (4451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:56,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 4451 transitions. [2022-01-11 01:50:56,014 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 4451 transitions. Word has length 66 [2022-01-11 01:50:56,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:56,018 INFO L470 AbstractCegarLoop]: Abstraction has 3279 states and 4451 transitions. [2022-01-11 01:50:56,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:56,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 4451 transitions. [2022-01-11 01:50:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:50:56,021 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:56,021 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:56,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 01:50:56,021 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:56,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:56,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1262670145, now seen corresponding path program 1 times [2022-01-11 01:50:56,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:56,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221362495] [2022-01-11 01:50:56,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:56,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:56,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:56,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:56,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221362495] [2022-01-11 01:50:56,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221362495] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:56,044 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:56,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:56,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473251852] [2022-01-11 01:50:56,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:56,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:56,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:56,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:56,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:56,045 INFO L87 Difference]: Start difference. First operand 3279 states and 4451 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:56,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:56,148 INFO L93 Difference]: Finished difference Result 3817 states and 5212 transitions. [2022-01-11 01:50:56,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:56,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 01:50:56,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:56,153 INFO L225 Difference]: With dead ends: 3817 [2022-01-11 01:50:56,154 INFO L226 Difference]: Without dead ends: 3279 [2022-01-11 01:50:56,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:56,155 INFO L933 BasicCegarLoop]: 622 mSDtfsCounter, 577 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:56,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [577 Valid, 659 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:56,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2022-01-11 01:50:56,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3279. [2022-01-11 01:50:56,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3279 states, 3276 states have (on average 1.3531746031746033) internal successors, (4433), 3278 states have internal predecessors, (4433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 4433 transitions. [2022-01-11 01:50:56,276 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 4433 transitions. Word has length 66 [2022-01-11 01:50:56,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:56,276 INFO L470 AbstractCegarLoop]: Abstraction has 3279 states and 4433 transitions. [2022-01-11 01:50:56,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 4433 transitions. [2022-01-11 01:50:56,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:50:56,278 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:56,278 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:56,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 01:50:56,278 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:56,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash -139052194, now seen corresponding path program 1 times [2022-01-11 01:50:56,279 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:56,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967418030] [2022-01-11 01:50:56,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:56,279 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:56,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:56,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967418030] [2022-01-11 01:50:56,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967418030] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:56,305 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:56,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:56,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963759239] [2022-01-11 01:50:56,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:56,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:56,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:56,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:56,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:56,307 INFO L87 Difference]: Start difference. First operand 3279 states and 4433 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:56,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:56,441 INFO L93 Difference]: Finished difference Result 3815 states and 5173 transitions. [2022-01-11 01:50:56,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:56,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 01:50:56,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:56,447 INFO L225 Difference]: With dead ends: 3815 [2022-01-11 01:50:56,447 INFO L226 Difference]: Without dead ends: 3279 [2022-01-11 01:50:56,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:56,450 INFO L933 BasicCegarLoop]: 611 mSDtfsCounter, 565 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:56,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 647 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:56,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2022-01-11 01:50:56,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3279. [2022-01-11 01:50:56,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3279 states, 3276 states have (on average 1.3476800976800978) internal successors, (4415), 3278 states have internal predecessors, (4415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 4415 transitions. [2022-01-11 01:50:56,554 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 4415 transitions. Word has length 66 [2022-01-11 01:50:56,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:56,555 INFO L470 AbstractCegarLoop]: Abstraction has 3279 states and 4415 transitions. [2022-01-11 01:50:56,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:56,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 4415 transitions. [2022-01-11 01:50:56,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:50:56,556 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:56,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:56,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 01:50:56,557 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:56,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:56,557 INFO L85 PathProgramCache]: Analyzing trace with hash -473717123, now seen corresponding path program 1 times [2022-01-11 01:50:56,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:56,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146290536] [2022-01-11 01:50:56,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:56,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:56,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:56,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:56,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146290536] [2022-01-11 01:50:56,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146290536] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:56,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:56,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:50:56,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760713378] [2022-01-11 01:50:56,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:56,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:50:56,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:56,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:50:56,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:50:56,603 INFO L87 Difference]: Start difference. First operand 3279 states and 4415 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:56,782 INFO L93 Difference]: Finished difference Result 4114 states and 5557 transitions. [2022-01-11 01:50:56,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:50:56,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 01:50:56,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:56,788 INFO L225 Difference]: With dead ends: 4114 [2022-01-11 01:50:56,788 INFO L226 Difference]: Without dead ends: 3585 [2022-01-11 01:50:56,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:50:56,789 INFO L933 BasicCegarLoop]: 658 mSDtfsCounter, 1141 mSDsluCounter, 1235 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 1893 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:56,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1141 Valid, 1893 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:56,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3585 states. [2022-01-11 01:50:56,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3585 to 3285. [2022-01-11 01:50:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3285 states, 3282 states have (on average 1.3439975624619134) internal successors, (4411), 3284 states have internal predecessors, (4411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 3285 states and 4411 transitions. [2022-01-11 01:50:56,900 INFO L78 Accepts]: Start accepts. Automaton has 3285 states and 4411 transitions. Word has length 66 [2022-01-11 01:50:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:56,901 INFO L470 AbstractCegarLoop]: Abstraction has 3285 states and 4411 transitions. [2022-01-11 01:50:56,901 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 4411 transitions. [2022-01-11 01:50:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:50:56,904 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:56,904 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:56,904 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 01:50:56,905 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:56,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:56,906 INFO L85 PathProgramCache]: Analyzing trace with hash -922413762, now seen corresponding path program 1 times [2022-01-11 01:50:56,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:56,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063054232] [2022-01-11 01:50:56,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:56,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:56,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:56,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:56,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:56,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063054232] [2022-01-11 01:50:56,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063054232] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:56,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:56,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:56,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727159145] [2022-01-11 01:50:56,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:56,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:56,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:56,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:56,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:56,932 INFO L87 Difference]: Start difference. First operand 3285 states and 4411 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:57,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:57,083 INFO L93 Difference]: Finished difference Result 4241 states and 5678 transitions. [2022-01-11 01:50:57,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:57,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 01:50:57,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:57,089 INFO L225 Difference]: With dead ends: 4241 [2022-01-11 01:50:57,089 INFO L226 Difference]: Without dead ends: 3715 [2022-01-11 01:50:57,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:57,093 INFO L933 BasicCegarLoop]: 606 mSDtfsCounter, 523 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:57,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 943 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:57,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3715 states. [2022-01-11 01:50:57,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3715 to 3709. [2022-01-11 01:50:57,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3709 states, 3706 states have (on average 1.3389098758769562) internal successors, (4962), 3708 states have internal predecessors, (4962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3709 states to 3709 states and 4962 transitions. [2022-01-11 01:50:57,223 INFO L78 Accepts]: Start accepts. Automaton has 3709 states and 4962 transitions. Word has length 66 [2022-01-11 01:50:57,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:57,224 INFO L470 AbstractCegarLoop]: Abstraction has 3709 states and 4962 transitions. [2022-01-11 01:50:57,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:57,224 INFO L276 IsEmpty]: Start isEmpty. Operand 3709 states and 4962 transitions. [2022-01-11 01:50:57,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:50:57,226 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:57,226 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:57,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 01:50:57,226 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:57,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:57,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1440916163, now seen corresponding path program 1 times [2022-01-11 01:50:57,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:57,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080713296] [2022-01-11 01:50:57,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:57,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:57,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:57,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080713296] [2022-01-11 01:50:57,263 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080713296] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:57,263 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:57,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:50:57,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302847728] [2022-01-11 01:50:57,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:57,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:50:57,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:57,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:50:57,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:50:57,264 INFO L87 Difference]: Start difference. First operand 3709 states and 4962 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:57,487 INFO L93 Difference]: Finished difference Result 5404 states and 7199 transitions. [2022-01-11 01:50:57,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:50:57,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 01:50:57,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:57,493 INFO L225 Difference]: With dead ends: 5404 [2022-01-11 01:50:57,493 INFO L226 Difference]: Without dead ends: 4458 [2022-01-11 01:50:57,495 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:50:57,495 INFO L933 BasicCegarLoop]: 606 mSDtfsCounter, 1055 mSDsluCounter, 2052 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:57,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1055 Valid, 2658 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 01:50:57,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4458 states. [2022-01-11 01:50:57,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4458 to 3742. [2022-01-11 01:50:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3739 states have (on average 1.3332441829366142) internal successors, (4985), 3741 states have internal predecessors, (4985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4985 transitions. [2022-01-11 01:50:57,622 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4985 transitions. Word has length 66 [2022-01-11 01:50:57,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:57,622 INFO L470 AbstractCegarLoop]: Abstraction has 3742 states and 4985 transitions. [2022-01-11 01:50:57,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:57,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4985 transitions. [2022-01-11 01:50:57,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:50:57,624 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:57,624 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:57,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 01:50:57,625 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:57,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:57,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1090116226, now seen corresponding path program 1 times [2022-01-11 01:50:57,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:57,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622176959] [2022-01-11 01:50:57,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:57,625 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:57,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:57,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:57,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622176959] [2022-01-11 01:50:57,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622176959] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:57,661 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:57,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:57,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429084914] [2022-01-11 01:50:57,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:57,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:57,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:57,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:57,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:57,662 INFO L87 Difference]: Start difference. First operand 3742 states and 4985 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:57,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:57,821 INFO L93 Difference]: Finished difference Result 4715 states and 6243 transitions. [2022-01-11 01:50:57,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:57,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 01:50:57,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:57,826 INFO L225 Difference]: With dead ends: 4715 [2022-01-11 01:50:57,827 INFO L226 Difference]: Without dead ends: 3715 [2022-01-11 01:50:57,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:57,828 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 510 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:57,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [510 Valid, 621 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3715 states. [2022-01-11 01:50:57,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3715 to 3715. [2022-01-11 01:50:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3715 states, 3712 states have (on average 1.3270474137931034) internal successors, (4926), 3714 states have internal predecessors, (4926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3715 states to 3715 states and 4926 transitions. [2022-01-11 01:50:58,000 INFO L78 Accepts]: Start accepts. Automaton has 3715 states and 4926 transitions. Word has length 66 [2022-01-11 01:50:58,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:58,000 INFO L470 AbstractCegarLoop]: Abstraction has 3715 states and 4926 transitions. [2022-01-11 01:50:58,000 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:58,001 INFO L276 IsEmpty]: Start isEmpty. Operand 3715 states and 4926 transitions. [2022-01-11 01:50:58,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-11 01:50:58,002 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:58,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:58,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 01:50:58,002 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:58,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:58,003 INFO L85 PathProgramCache]: Analyzing trace with hash 263193471, now seen corresponding path program 1 times [2022-01-11 01:50:58,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:58,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784438469] [2022-01-11 01:50:58,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:58,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:58,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:58,027 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:58,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784438469] [2022-01-11 01:50:58,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784438469] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:58,027 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:58,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:50:58,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424094579] [2022-01-11 01:50:58,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:58,027 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:58,027 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:58,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:58,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:58,028 INFO L87 Difference]: Start difference. First operand 3715 states and 4926 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:58,198 INFO L93 Difference]: Finished difference Result 5573 states and 7289 transitions. [2022-01-11 01:50:58,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:58,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-01-11 01:50:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:58,206 INFO L225 Difference]: With dead ends: 5573 [2022-01-11 01:50:58,206 INFO L226 Difference]: Without dead ends: 4603 [2022-01-11 01:50:58,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:58,209 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 511 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:58,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [511 Valid, 911 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4603 states. [2022-01-11 01:50:58,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4603 to 4497. [2022-01-11 01:50:58,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4497 states, 4494 states have (on average 1.3137516688918558) internal successors, (5904), 4496 states have internal predecessors, (5904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:58,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4497 states to 4497 states and 5904 transitions. [2022-01-11 01:50:58,412 INFO L78 Accepts]: Start accepts. Automaton has 4497 states and 5904 transitions. Word has length 66 [2022-01-11 01:50:58,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:58,412 INFO L470 AbstractCegarLoop]: Abstraction has 4497 states and 5904 transitions. [2022-01-11 01:50:58,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:58,412 INFO L276 IsEmpty]: Start isEmpty. Operand 4497 states and 5904 transitions. [2022-01-11 01:50:58,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-01-11 01:50:58,416 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:58,417 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, 1, 1, 1] [2022-01-11 01:50:58,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 01:50:58,417 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:58,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:58,417 INFO L85 PathProgramCache]: Analyzing trace with hash 40253627, now seen corresponding path program 1 times [2022-01-11 01:50:58,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:58,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063309039] [2022-01-11 01:50:58,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:58,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-11 01:50:58,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:58,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063309039] [2022-01-11 01:50:58,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063309039] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:58,447 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:58,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:58,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818396650] [2022-01-11 01:50:58,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:58,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:58,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:58,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:58,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:58,448 INFO L87 Difference]: Start difference. First operand 4497 states and 5904 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:58,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:58,677 INFO L93 Difference]: Finished difference Result 9577 states and 12788 transitions. [2022-01-11 01:50:58,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:58,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-01-11 01:50:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:58,687 INFO L225 Difference]: With dead ends: 9577 [2022-01-11 01:50:58,687 INFO L226 Difference]: Without dead ends: 7037 [2022-01-11 01:50:58,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-11 01:50:58,690 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 131 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:58,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 1137 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:58,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7037 states. [2022-01-11 01:50:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7037 to 7033. [2022-01-11 01:50:58,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7033 states, 7030 states have (on average 1.3200568990042674) internal successors, (9280), 7032 states have internal predecessors, (9280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:58,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7033 states to 7033 states and 9280 transitions. [2022-01-11 01:50:58,922 INFO L78 Accepts]: Start accepts. Automaton has 7033 states and 9280 transitions. Word has length 103 [2022-01-11 01:50:58,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:58,922 INFO L470 AbstractCegarLoop]: Abstraction has 7033 states and 9280 transitions. [2022-01-11 01:50:58,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:58,923 INFO L276 IsEmpty]: Start isEmpty. Operand 7033 states and 9280 transitions. [2022-01-11 01:50:58,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-11 01:50:58,929 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:58,929 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, 1, 1, 1, 1] [2022-01-11 01:50:58,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 01:50:58,929 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:58,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:58,929 INFO L85 PathProgramCache]: Analyzing trace with hash 229973990, now seen corresponding path program 1 times [2022-01-11 01:50:58,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:58,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981557213] [2022-01-11 01:50:58,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:58,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:58,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:58,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:58,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981557213] [2022-01-11 01:50:58,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981557213] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:58,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:58,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:58,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492334875] [2022-01-11 01:50:58,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:58,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:58,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:58,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:58,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:58,959 INFO L87 Difference]: Start difference. First operand 7033 states and 9280 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:59,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:59,203 INFO L93 Difference]: Finished difference Result 9601 states and 12784 transitions. [2022-01-11 01:50:59,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:59,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2022-01-11 01:50:59,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:59,207 INFO L225 Difference]: With dead ends: 9601 [2022-01-11 01:50:59,207 INFO L226 Difference]: Without dead ends: 1772 [2022-01-11 01:50:59,214 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:59,214 INFO L933 BasicCegarLoop]: 698 mSDtfsCounter, 112 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:59,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 1259 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:59,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2022-01-11 01:50:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1772. [2022-01-11 01:50:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1771 states have (on average 1.261434217955957) internal successors, (2234), 1771 states have internal predecessors, (2234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2234 transitions. [2022-01-11 01:50:59,282 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2234 transitions. Word has length 104 [2022-01-11 01:50:59,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:59,282 INFO L470 AbstractCegarLoop]: Abstraction has 1772 states and 2234 transitions. [2022-01-11 01:50:59,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2234 transitions. [2022-01-11 01:50:59,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-11 01:50:59,283 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:59,283 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:59,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 01:50:59,283 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:59,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:59,284 INFO L85 PathProgramCache]: Analyzing trace with hash 2060026617, now seen corresponding path program 1 times [2022-01-11 01:50:59,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:59,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305725004] [2022-01-11 01:50:59,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:59,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:59,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:59,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305725004] [2022-01-11 01:50:59,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305725004] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:59,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:59,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:59,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571113450] [2022-01-11 01:50:59,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:59,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:59,311 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:59,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:59,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:59,312 INFO L87 Difference]: Start difference. First operand 1772 states and 2234 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:59,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:50:59,524 INFO L93 Difference]: Finished difference Result 5123 states and 6482 transitions. [2022-01-11 01:50:59,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:50:59,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-01-11 01:50:59,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:50:59,529 INFO L225 Difference]: With dead ends: 5123 [2022-01-11 01:50:59,529 INFO L226 Difference]: Without dead ends: 3377 [2022-01-11 01:50:59,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:59,532 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 327 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:50:59,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 715 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:50:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3377 states. [2022-01-11 01:50:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3377 to 3191. [2022-01-11 01:50:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3191 states, 3190 states have (on average 1.2601880877742946) internal successors, (4020), 3190 states have internal predecessors, (4020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4020 transitions. [2022-01-11 01:50:59,706 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4020 transitions. Word has length 106 [2022-01-11 01:50:59,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:50:59,706 INFO L470 AbstractCegarLoop]: Abstraction has 3191 states and 4020 transitions. [2022-01-11 01:50:59,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:50:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4020 transitions. [2022-01-11 01:50:59,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-11 01:50:59,708 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:50:59,708 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:50:59,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 01:50:59,708 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:50:59,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:50:59,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1541524216, now seen corresponding path program 1 times [2022-01-11 01:50:59,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:50:59,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521209436] [2022-01-11 01:50:59,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:50:59,709 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:50:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:50:59,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:50:59,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:50:59,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521209436] [2022-01-11 01:50:59,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521209436] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:50:59,739 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:50:59,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:50:59,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231285932] [2022-01-11 01:50:59,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:50:59,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:50:59,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:50:59,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:50:59,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:50:59,741 INFO L87 Difference]: Start difference. First operand 3191 states and 4020 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:00,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:00,056 INFO L93 Difference]: Finished difference Result 9253 states and 11577 transitions. [2022-01-11 01:51:00,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:00,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-01-11 01:51:00,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:00,065 INFO L225 Difference]: With dead ends: 9253 [2022-01-11 01:51:00,065 INFO L226 Difference]: Without dead ends: 6115 [2022-01-11 01:51:00,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:00,069 INFO L933 BasicCegarLoop]: 471 mSDtfsCounter, 336 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:00,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 845 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:00,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6115 states. [2022-01-11 01:51:00,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6115 to 5961. [2022-01-11 01:51:00,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5961 states, 5960 states have (on average 1.236744966442953) internal successors, (7371), 5960 states have internal predecessors, (7371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:00,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5961 states to 5961 states and 7371 transitions. [2022-01-11 01:51:00,329 INFO L78 Accepts]: Start accepts. Automaton has 5961 states and 7371 transitions. Word has length 106 [2022-01-11 01:51:00,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:00,329 INFO L470 AbstractCegarLoop]: Abstraction has 5961 states and 7371 transitions. [2022-01-11 01:51:00,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:00,330 INFO L276 IsEmpty]: Start isEmpty. Operand 5961 states and 7371 transitions. [2022-01-11 01:51:00,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-11 01:51:00,332 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:00,332 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:00,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 01:51:00,332 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:00,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash 707121689, now seen corresponding path program 1 times [2022-01-11 01:51:00,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:00,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712399996] [2022-01-11 01:51:00,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:00,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:51:00,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:00,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712399996] [2022-01-11 01:51:00,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712399996] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:00,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:00,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:00,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143427481] [2022-01-11 01:51:00,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:00,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:00,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:00,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:00,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:00,355 INFO L87 Difference]: Start difference. First operand 5961 states and 7371 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:00,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:00,583 INFO L93 Difference]: Finished difference Result 11846 states and 14657 transitions. [2022-01-11 01:51:00,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:00,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-01-11 01:51:00,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:00,592 INFO L225 Difference]: With dead ends: 11846 [2022-01-11 01:51:00,592 INFO L226 Difference]: Without dead ends: 5915 [2022-01-11 01:51:00,599 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:00,599 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 393 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:00,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 399 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:00,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5915 states. [2022-01-11 01:51:00,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5915 to 5915. [2022-01-11 01:51:00,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5915 states, 5914 states have (on average 1.2375718633750423) internal successors, (7319), 5914 states have internal predecessors, (7319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:00,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 7319 transitions. [2022-01-11 01:51:00,869 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 7319 transitions. Word has length 106 [2022-01-11 01:51:00,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:00,869 INFO L470 AbstractCegarLoop]: Abstraction has 5915 states and 7319 transitions. [2022-01-11 01:51:00,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 7319 transitions. [2022-01-11 01:51:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-11 01:51:00,874 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:00,874 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:00,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 01:51:00,874 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:00,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:00,875 INFO L85 PathProgramCache]: Analyzing trace with hash -143007274, now seen corresponding path program 1 times [2022-01-11 01:51:00,875 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:00,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136181932] [2022-01-11 01:51:00,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:00,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:00,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:00,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136181932] [2022-01-11 01:51:00,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136181932] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:00,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:00,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:00,906 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336265388] [2022-01-11 01:51:00,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:00,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:00,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:00,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:00,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:00,907 INFO L87 Difference]: Start difference. First operand 5915 states and 7319 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:01,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:01,333 INFO L93 Difference]: Finished difference Result 17044 states and 21042 transitions. [2022-01-11 01:51:01,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:01,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-01-11 01:51:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:01,352 INFO L225 Difference]: With dead ends: 17044 [2022-01-11 01:51:01,352 INFO L226 Difference]: Without dead ends: 11182 [2022-01-11 01:51:01,362 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:01,363 INFO L933 BasicCegarLoop]: 515 mSDtfsCounter, 252 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:01,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [252 Valid, 893 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:01,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11182 states. [2022-01-11 01:51:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11182 to 11180. [2022-01-11 01:51:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11180 states, 11179 states have (on average 1.2255121209410502) internal successors, (13700), 11179 states have internal predecessors, (13700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:01,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11180 states to 11180 states and 13700 transitions. [2022-01-11 01:51:01,853 INFO L78 Accepts]: Start accepts. Automaton has 11180 states and 13700 transitions. Word has length 107 [2022-01-11 01:51:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:01,854 INFO L470 AbstractCegarLoop]: Abstraction has 11180 states and 13700 transitions. [2022-01-11 01:51:01,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:01,854 INFO L276 IsEmpty]: Start isEmpty. Operand 11180 states and 13700 transitions. [2022-01-11 01:51:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-11 01:51:01,857 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:01,857 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:01,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 01:51:01,858 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:01,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:01,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1341742539, now seen corresponding path program 1 times [2022-01-11 01:51:01,858 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:01,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723125772] [2022-01-11 01:51:01,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:01,858 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:51:01,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:01,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723125772] [2022-01-11 01:51:01,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723125772] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:01,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:01,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:01,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163430907] [2022-01-11 01:51:01,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:01,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:01,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:01,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:01,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:01,880 INFO L87 Difference]: Start difference. First operand 11180 states and 13700 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:02,365 INFO L93 Difference]: Finished difference Result 19660 states and 24101 transitions. [2022-01-11 01:51:02,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:02,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-01-11 01:51:02,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:02,376 INFO L225 Difference]: With dead ends: 19660 [2022-01-11 01:51:02,376 INFO L226 Difference]: Without dead ends: 8533 [2022-01-11 01:51:02,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:02,385 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 391 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:02,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 398 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:02,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8533 states. [2022-01-11 01:51:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8533 to 8533. [2022-01-11 01:51:02,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8533 states, 8532 states have (on average 1.2257383966244726) internal successors, (10458), 8532 states have internal predecessors, (10458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8533 states to 8533 states and 10458 transitions. [2022-01-11 01:51:02,889 INFO L78 Accepts]: Start accepts. Automaton has 8533 states and 10458 transitions. Word has length 107 [2022-01-11 01:51:02,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:02,889 INFO L470 AbstractCegarLoop]: Abstraction has 8533 states and 10458 transitions. [2022-01-11 01:51:02,889 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:02,889 INFO L276 IsEmpty]: Start isEmpty. Operand 8533 states and 10458 transitions. [2022-01-11 01:51:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-11 01:51:02,892 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:02,892 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:02,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 01:51:02,892 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:02,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:02,893 INFO L85 PathProgramCache]: Analyzing trace with hash -2104153109, now seen corresponding path program 1 times [2022-01-11 01:51:02,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:02,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841663016] [2022-01-11 01:51:02,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:02,893 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:02,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:02,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:02,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841663016] [2022-01-11 01:51:02,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841663016] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:02,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:02,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:02,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812244730] [2022-01-11 01:51:02,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:02,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:02,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:02,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:02,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:02,925 INFO L87 Difference]: Start difference. First operand 8533 states and 10458 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:03,684 INFO L93 Difference]: Finished difference Result 23993 states and 29347 transitions. [2022-01-11 01:51:03,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:03,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-01-11 01:51:03,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:03,713 INFO L225 Difference]: With dead ends: 23993 [2022-01-11 01:51:03,714 INFO L226 Difference]: Without dead ends: 15513 [2022-01-11 01:51:03,723 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:03,726 INFO L933 BasicCegarLoop]: 496 mSDtfsCounter, 255 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:03,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 866 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:03,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15513 states. [2022-01-11 01:51:04,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15513 to 15319. [2022-01-11 01:51:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15319 states, 15318 states have (on average 1.2195456325891108) internal successors, (18681), 15318 states have internal predecessors, (18681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15319 states to 15319 states and 18681 transitions. [2022-01-11 01:51:04,394 INFO L78 Accepts]: Start accepts. Automaton has 15319 states and 18681 transitions. Word has length 108 [2022-01-11 01:51:04,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:04,394 INFO L470 AbstractCegarLoop]: Abstraction has 15319 states and 18681 transitions. [2022-01-11 01:51:04,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand 15319 states and 18681 transitions. [2022-01-11 01:51:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-11 01:51:04,398 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:04,398 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:04,398 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 01:51:04,399 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:04,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:04,399 INFO L85 PathProgramCache]: Analyzing trace with hash 992078922, now seen corresponding path program 1 times [2022-01-11 01:51:04,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:04,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546212141] [2022-01-11 01:51:04,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:04,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-11 01:51:04,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:04,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546212141] [2022-01-11 01:51:04,425 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546212141] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:04,425 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:04,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:04,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267054217] [2022-01-11 01:51:04,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:04,425 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:04,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:04,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:04,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:04,426 INFO L87 Difference]: Start difference. First operand 15319 states and 18681 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:05,152 INFO L93 Difference]: Finished difference Result 30551 states and 37268 transitions. [2022-01-11 01:51:05,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:05,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2022-01-11 01:51:05,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:05,170 INFO L225 Difference]: With dead ends: 30551 [2022-01-11 01:51:05,171 INFO L226 Difference]: Without dead ends: 15275 [2022-01-11 01:51:05,184 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:05,184 INFO L933 BasicCegarLoop]: 396 mSDtfsCounter, 389 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:05,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 397 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:05,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15275 states. [2022-01-11 01:51:05,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15275 to 15275. [2022-01-11 01:51:05,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15275 states, 15274 states have (on average 1.2199161974597355) internal successors, (18633), 15274 states have internal predecessors, (18633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15275 states to 15275 states and 18633 transitions. [2022-01-11 01:51:05,967 INFO L78 Accepts]: Start accepts. Automaton has 15275 states and 18633 transitions. Word has length 108 [2022-01-11 01:51:05,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:05,967 INFO L470 AbstractCegarLoop]: Abstraction has 15275 states and 18633 transitions. [2022-01-11 01:51:05,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:05,968 INFO L276 IsEmpty]: Start isEmpty. Operand 15275 states and 18633 transitions. [2022-01-11 01:51:05,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-11 01:51:05,974 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:05,974 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:05,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 01:51:05,974 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:05,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:05,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1247138793, now seen corresponding path program 1 times [2022-01-11 01:51:05,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:05,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140797137] [2022-01-11 01:51:05,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:05,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:06,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:06,000 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:06,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140797137] [2022-01-11 01:51:06,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140797137] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:06,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:06,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:06,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451554483] [2022-01-11 01:51:06,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:06,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:06,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:06,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:06,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:06,001 INFO L87 Difference]: Start difference. First operand 15275 states and 18633 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:07,118 INFO L93 Difference]: Finished difference Result 30597 states and 37434 transitions. [2022-01-11 01:51:07,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:07,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-01-11 01:51:07,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:07,144 INFO L225 Difference]: With dead ends: 30597 [2022-01-11 01:51:07,144 INFO L226 Difference]: Without dead ends: 22019 [2022-01-11 01:51:07,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:07,155 INFO L933 BasicCegarLoop]: 670 mSDtfsCounter, 280 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:07,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 1053 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:07,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22019 states. [2022-01-11 01:51:08,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22019 to 22019. [2022-01-11 01:51:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22019 states, 22018 states have (on average 1.2123262784994095) internal successors, (26693), 22018 states have internal predecessors, (26693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22019 states to 22019 states and 26693 transitions. [2022-01-11 01:51:08,375 INFO L78 Accepts]: Start accepts. Automaton has 22019 states and 26693 transitions. Word has length 109 [2022-01-11 01:51:08,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:08,376 INFO L470 AbstractCegarLoop]: Abstraction has 22019 states and 26693 transitions. [2022-01-11 01:51:08,376 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:08,376 INFO L276 IsEmpty]: Start isEmpty. Operand 22019 states and 26693 transitions. [2022-01-11 01:51:08,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-01-11 01:51:08,384 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:08,384 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:08,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 01:51:08,384 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:08,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:08,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1219241560, now seen corresponding path program 1 times [2022-01-11 01:51:08,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:08,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123078446] [2022-01-11 01:51:08,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:08,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:08,413 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:08,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123078446] [2022-01-11 01:51:08,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123078446] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:08,413 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:08,413 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 01:51:08,413 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17615688] [2022-01-11 01:51:08,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:08,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:08,414 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:08,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:08,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:08,414 INFO L87 Difference]: Start difference. First operand 22019 states and 26693 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:09,696 INFO L93 Difference]: Finished difference Result 50665 states and 61309 transitions. [2022-01-11 01:51:09,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:09,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2022-01-11 01:51:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:09,733 INFO L225 Difference]: With dead ends: 50665 [2022-01-11 01:51:09,733 INFO L226 Difference]: Without dead ends: 28684 [2022-01-11 01:51:09,754 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:09,754 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 232 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:09,755 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 712 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:09,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28684 states. [2022-01-11 01:51:11,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28684 to 28540. [2022-01-11 01:51:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28540 states, 28539 states have (on average 1.2032306668068258) internal successors, (34339), 28539 states have internal predecessors, (34339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28540 states to 28540 states and 34339 transitions. [2022-01-11 01:51:11,133 INFO L78 Accepts]: Start accepts. Automaton has 28540 states and 34339 transitions. Word has length 140 [2022-01-11 01:51:11,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:11,133 INFO L470 AbstractCegarLoop]: Abstraction has 28540 states and 34339 transitions. [2022-01-11 01:51:11,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 28540 states and 34339 transitions. [2022-01-11 01:51:11,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-11 01:51:11,146 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:11,146 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:11,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 01:51:11,146 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:11,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:11,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1287570392, now seen corresponding path program 1 times [2022-01-11 01:51:11,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:11,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207101989] [2022-01-11 01:51:11,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:11,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-01-11 01:51:11,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:11,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207101989] [2022-01-11 01:51:11,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207101989] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:11,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:11,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:11,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427866127] [2022-01-11 01:51:11,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:11,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:11,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:11,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:11,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:11,172 INFO L87 Difference]: Start difference. First operand 28540 states and 34339 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:12,605 INFO L93 Difference]: Finished difference Result 56428 states and 67760 transitions. [2022-01-11 01:51:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:12,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-01-11 01:51:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:12,641 INFO L225 Difference]: With dead ends: 56428 [2022-01-11 01:51:12,641 INFO L226 Difference]: Without dead ends: 27940 [2022-01-11 01:51:12,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:12,662 INFO L933 BasicCegarLoop]: 403 mSDtfsCounter, 269 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:12,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [269 Valid, 732 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:12,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27940 states. [2022-01-11 01:51:14,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27940 to 27940. [2022-01-11 01:51:14,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27940 states, 27939 states have (on average 1.1809656752210171) internal successors, (32995), 27939 states have internal predecessors, (32995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:14,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27940 states to 27940 states and 32995 transitions. [2022-01-11 01:51:14,355 INFO L78 Accepts]: Start accepts. Automaton has 27940 states and 32995 transitions. Word has length 157 [2022-01-11 01:51:14,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:14,355 INFO L470 AbstractCegarLoop]: Abstraction has 27940 states and 32995 transitions. [2022-01-11 01:51:14,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 27940 states and 32995 transitions. [2022-01-11 01:51:14,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-11 01:51:14,368 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:14,369 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:14,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 01:51:14,369 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:14,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:14,369 INFO L85 PathProgramCache]: Analyzing trace with hash 777697533, now seen corresponding path program 1 times [2022-01-11 01:51:14,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:14,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88275333] [2022-01-11 01:51:14,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:14,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:14,409 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:14,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88275333] [2022-01-11 01:51:14,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88275333] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:14,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:14,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:14,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285815422] [2022-01-11 01:51:14,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:14,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:14,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:14,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:14,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:14,410 INFO L87 Difference]: Start difference. First operand 27940 states and 32995 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:15,911 INFO L93 Difference]: Finished difference Result 49428 states and 58553 transitions. [2022-01-11 01:51:15,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:15,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2022-01-11 01:51:15,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:15,950 INFO L225 Difference]: With dead ends: 49428 [2022-01-11 01:51:15,950 INFO L226 Difference]: Without dead ends: 27942 [2022-01-11 01:51:15,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:15,972 INFO L933 BasicCegarLoop]: 660 mSDtfsCounter, 273 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:15,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 1035 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27942 states. [2022-01-11 01:51:17,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27942 to 27940. [2022-01-11 01:51:17,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27940 states, 27939 states have (on average 1.1779591252371238) internal successors, (32911), 27939 states have internal predecessors, (32911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:17,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27940 states to 27940 states and 32911 transitions. [2022-01-11 01:51:17,398 INFO L78 Accepts]: Start accepts. Automaton has 27940 states and 32911 transitions. Word has length 158 [2022-01-11 01:51:17,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:17,398 INFO L470 AbstractCegarLoop]: Abstraction has 27940 states and 32911 transitions. [2022-01-11 01:51:17,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 27940 states and 32911 transitions. [2022-01-11 01:51:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-11 01:51:17,410 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:17,410 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:17,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 01:51:17,410 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:17,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:17,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1842433166, now seen corresponding path program 1 times [2022-01-11 01:51:17,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:17,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232139656] [2022-01-11 01:51:17,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:17,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:17,441 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:17,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:17,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232139656] [2022-01-11 01:51:17,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232139656] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:17,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:17,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:17,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132500259] [2022-01-11 01:51:17,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:17,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:17,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:17,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:17,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:17,442 INFO L87 Difference]: Start difference. First operand 27940 states and 32911 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:18,883 INFO L93 Difference]: Finished difference Result 49522 states and 58480 transitions. [2022-01-11 01:51:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:18,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2022-01-11 01:51:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:18,923 INFO L225 Difference]: With dead ends: 49522 [2022-01-11 01:51:18,923 INFO L226 Difference]: Without dead ends: 28036 [2022-01-11 01:51:18,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:18,941 INFO L933 BasicCegarLoop]: 655 mSDtfsCounter, 302 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:18,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 976 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:18,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28036 states. [2022-01-11 01:51:20,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28036 to 27940. [2022-01-11 01:51:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27940 states, 27939 states have (on average 1.1577722896309819) internal successors, (32347), 27939 states have internal predecessors, (32347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27940 states to 27940 states and 32347 transitions. [2022-01-11 01:51:20,583 INFO L78 Accepts]: Start accepts. Automaton has 27940 states and 32347 transitions. Word has length 158 [2022-01-11 01:51:20,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:20,583 INFO L470 AbstractCegarLoop]: Abstraction has 27940 states and 32347 transitions. [2022-01-11 01:51:20,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 27940 states and 32347 transitions. [2022-01-11 01:51:20,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-11 01:51:20,595 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:20,595 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:20,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 01:51:20,595 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:20,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:20,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1499693135, now seen corresponding path program 1 times [2022-01-11 01:51:20,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:20,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461332478] [2022-01-11 01:51:20,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:20,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-11 01:51:20,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:20,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461332478] [2022-01-11 01:51:20,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461332478] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:20,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:20,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:51:20,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605418002] [2022-01-11 01:51:20,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:20,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:51:20,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:20,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:51:20,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:51:20,642 INFO L87 Difference]: Start difference. First operand 27940 states and 32347 transitions. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:22,569 INFO L93 Difference]: Finished difference Result 61632 states and 71880 transitions. [2022-01-11 01:51:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:51:22,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 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-11 01:51:22,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:22,612 INFO L225 Difference]: With dead ends: 61632 [2022-01-11 01:51:22,613 INFO L226 Difference]: Without dead ends: 33734 [2022-01-11 01:51:22,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:51:22,629 INFO L933 BasicCegarLoop]: 396 mSDtfsCounter, 839 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:22,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [839 Valid, 1247 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:22,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33734 states. [2022-01-11 01:51:24,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33734 to 23526. [2022-01-11 01:51:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23526 states, 23525 states have (on average 1.1413390010626994) internal successors, (26850), 23525 states have internal predecessors, (26850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:24,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23526 states to 23526 states and 26850 transitions. [2022-01-11 01:51:24,200 INFO L78 Accepts]: Start accepts. Automaton has 23526 states and 26850 transitions. Word has length 160 [2022-01-11 01:51:24,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:24,200 INFO L470 AbstractCegarLoop]: Abstraction has 23526 states and 26850 transitions. [2022-01-11 01:51:24,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:24,201 INFO L276 IsEmpty]: Start isEmpty. Operand 23526 states and 26850 transitions. [2022-01-11 01:51:24,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-01-11 01:51:24,212 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:24,212 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:24,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 01:51:24,213 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:24,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:24,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1146587284, now seen corresponding path program 1 times [2022-01-11 01:51:24,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:24,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601029512] [2022-01-11 01:51:24,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:24,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:24,248 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:24,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:24,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601029512] [2022-01-11 01:51:24,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601029512] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:24,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:24,249 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:24,249 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901342539] [2022-01-11 01:51:24,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:24,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:24,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:24,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:24,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:24,250 INFO L87 Difference]: Start difference. First operand 23526 states and 26850 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:25,770 INFO L93 Difference]: Finished difference Result 43074 states and 49284 transitions. [2022-01-11 01:51:25,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:25,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 194 [2022-01-11 01:51:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:25,799 INFO L225 Difference]: With dead ends: 43074 [2022-01-11 01:51:25,799 INFO L226 Difference]: Without dead ends: 23528 [2022-01-11 01:51:25,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:25,812 INFO L933 BasicCegarLoop]: 601 mSDtfsCounter, 267 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:25,812 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 968 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:25,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23528 states. [2022-01-11 01:51:27,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23528 to 23526. [2022-01-11 01:51:27,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23526 states, 23525 states have (on average 1.1370882040382573) internal successors, (26750), 23525 states have internal predecessors, (26750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:27,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23526 states to 23526 states and 26750 transitions. [2022-01-11 01:51:27,202 INFO L78 Accepts]: Start accepts. Automaton has 23526 states and 26750 transitions. Word has length 194 [2022-01-11 01:51:27,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:27,203 INFO L470 AbstractCegarLoop]: Abstraction has 23526 states and 26750 transitions. [2022-01-11 01:51:27,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 23526 states and 26750 transitions. [2022-01-11 01:51:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2022-01-11 01:51:27,215 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:27,215 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:27,215 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 01:51:27,215 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:27,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:27,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1030930227, now seen corresponding path program 1 times [2022-01-11 01:51:27,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:27,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265247995] [2022-01-11 01:51:27,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:27,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-11 01:51:27,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:27,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265247995] [2022-01-11 01:51:27,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265247995] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:27,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:27,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:27,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403313214] [2022-01-11 01:51:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:27,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:27,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:27,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:27,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:27,252 INFO L87 Difference]: Start difference. First operand 23526 states and 26750 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:28,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:28,776 INFO L93 Difference]: Finished difference Result 47002 states and 53448 transitions. [2022-01-11 01:51:28,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:28,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 230 [2022-01-11 01:51:28,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:28,900 INFO L225 Difference]: With dead ends: 47002 [2022-01-11 01:51:28,900 INFO L226 Difference]: Without dead ends: 23528 [2022-01-11 01:51:28,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:28,915 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 264 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:28,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 981 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:28,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23528 states. [2022-01-11 01:51:30,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23528 to 23526. [2022-01-11 01:51:30,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23526 states, 23525 states have (on average 1.1296068012752392) internal successors, (26574), 23525 states have internal predecessors, (26574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:30,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23526 states to 23526 states and 26574 transitions. [2022-01-11 01:51:30,365 INFO L78 Accepts]: Start accepts. Automaton has 23526 states and 26574 transitions. Word has length 230 [2022-01-11 01:51:30,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:30,365 INFO L470 AbstractCegarLoop]: Abstraction has 23526 states and 26574 transitions. [2022-01-11 01:51:30,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:30,366 INFO L276 IsEmpty]: Start isEmpty. Operand 23526 states and 26574 transitions. [2022-01-11 01:51:30,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-01-11 01:51:30,377 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:30,377 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:30,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-11 01:51:30,377 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:30,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:30,378 INFO L85 PathProgramCache]: Analyzing trace with hash -2086615424, now seen corresponding path program 1 times [2022-01-11 01:51:30,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:30,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100257806] [2022-01-11 01:51:30,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:30,378 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:30,410 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:30,411 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:30,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100257806] [2022-01-11 01:51:30,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100257806] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:30,411 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:30,411 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:30,411 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366477911] [2022-01-11 01:51:30,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:30,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:30,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:30,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:30,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:30,412 INFO L87 Difference]: Start difference. First operand 23526 states and 26574 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:31,818 INFO L93 Difference]: Finished difference Result 43136 states and 48835 transitions. [2022-01-11 01:51:31,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:31,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2022-01-11 01:51:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:31,848 INFO L225 Difference]: With dead ends: 43136 [2022-01-11 01:51:31,848 INFO L226 Difference]: Without dead ends: 23590 [2022-01-11 01:51:31,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:31,871 INFO L933 BasicCegarLoop]: 598 mSDtfsCounter, 295 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:31,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 870 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23590 states. [2022-01-11 01:51:33,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23590 to 23526. [2022-01-11 01:51:33,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23526 states, 23525 states have (on average 1.1078427205100956) internal successors, (26062), 23525 states have internal predecessors, (26062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23526 states to 23526 states and 26062 transitions. [2022-01-11 01:51:33,373 INFO L78 Accepts]: Start accepts. Automaton has 23526 states and 26062 transitions. Word has length 231 [2022-01-11 01:51:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:33,373 INFO L470 AbstractCegarLoop]: Abstraction has 23526 states and 26062 transitions. [2022-01-11 01:51:33,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:33,373 INFO L276 IsEmpty]: Start isEmpty. Operand 23526 states and 26062 transitions. [2022-01-11 01:51:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-01-11 01:51:33,383 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:33,384 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:33,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-11 01:51:33,384 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:33,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:33,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1864852364, now seen corresponding path program 1 times [2022-01-11 01:51:33,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:33,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316193198] [2022-01-11 01:51:33,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:33,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:33,418 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 01:51:33,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:33,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316193198] [2022-01-11 01:51:33,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316193198] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:33,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:33,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:33,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523464425] [2022-01-11 01:51:33,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:33,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:33,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:33,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:33,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:33,419 INFO L87 Difference]: Start difference. First operand 23526 states and 26062 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:34,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:34,940 INFO L93 Difference]: Finished difference Result 38750 states and 43017 transitions. [2022-01-11 01:51:34,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:34,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 234 [2022-01-11 01:51:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:34,965 INFO L225 Difference]: With dead ends: 38750 [2022-01-11 01:51:34,965 INFO L226 Difference]: Without dead ends: 24374 [2022-01-11 01:51:34,974 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:34,974 INFO L933 BasicCegarLoop]: 552 mSDtfsCounter, 314 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:34,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 883 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:34,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24374 states. [2022-01-11 01:51:36,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24374 to 23526. [2022-01-11 01:51:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23526 states, 23525 states have (on average 1.0935600425079703) internal successors, (25726), 23525 states have internal predecessors, (25726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23526 states to 23526 states and 25726 transitions. [2022-01-11 01:51:36,421 INFO L78 Accepts]: Start accepts. Automaton has 23526 states and 25726 transitions. Word has length 234 [2022-01-11 01:51:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:36,421 INFO L470 AbstractCegarLoop]: Abstraction has 23526 states and 25726 transitions. [2022-01-11 01:51:36,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 23526 states and 25726 transitions. [2022-01-11 01:51:36,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-01-11 01:51:36,430 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:36,430 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:36,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-11 01:51:36,431 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:36,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:36,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1135725642, now seen corresponding path program 1 times [2022-01-11 01:51:36,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:36,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923238492] [2022-01-11 01:51:36,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:36,431 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:36,476 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 01:51:36,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:36,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923238492] [2022-01-11 01:51:36,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923238492] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:36,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:36,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 01:51:36,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55777622] [2022-01-11 01:51:36,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:36,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 01:51:36,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:36,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 01:51:36,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:36,478 INFO L87 Difference]: Start difference. First operand 23526 states and 25726 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:37,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:37,348 INFO L93 Difference]: Finished difference Result 37950 states and 41621 transitions. [2022-01-11 01:51:37,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 01:51:37,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2022-01-11 01:51:37,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:37,365 INFO L225 Difference]: With dead ends: 37950 [2022-01-11 01:51:37,366 INFO L226 Difference]: Without dead ends: 14476 [2022-01-11 01:51:37,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 01:51:37,383 INFO L933 BasicCegarLoop]: 553 mSDtfsCounter, 257 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:37,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 783 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14476 states. [2022-01-11 01:51:38,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14476 to 14444. [2022-01-11 01:51:38,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14444 states, 14443 states have (on average 1.0792771584850793) internal successors, (15588), 14443 states have internal predecessors, (15588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14444 states to 14444 states and 15588 transitions. [2022-01-11 01:51:38,292 INFO L78 Accepts]: Start accepts. Automaton has 14444 states and 15588 transitions. Word has length 236 [2022-01-11 01:51:38,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:38,292 INFO L470 AbstractCegarLoop]: Abstraction has 14444 states and 15588 transitions. [2022-01-11 01:51:38,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 14444 states and 15588 transitions. [2022-01-11 01:51:38,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-01-11 01:51:38,300 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:38,300 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:38,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-11 01:51:38,300 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:38,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:38,300 INFO L85 PathProgramCache]: Analyzing trace with hash -327822334, now seen corresponding path program 1 times [2022-01-11 01:51:38,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:38,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365621134] [2022-01-11 01:51:38,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:38,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-01-11 01:51:38,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:38,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365621134] [2022-01-11 01:51:38,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365621134] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:38,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:38,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 01:51:38,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400021426] [2022-01-11 01:51:38,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:38,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 01:51:38,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:38,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 01:51:38,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 01:51:38,359 INFO L87 Difference]: Start difference. First operand 14444 states and 15588 transitions. Second operand has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:38,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:38,878 INFO L93 Difference]: Finished difference Result 21401 states and 23052 transitions. [2022-01-11 01:51:38,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:51:38,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 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 239 [2022-01-11 01:51:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:38,883 INFO L225 Difference]: With dead ends: 21401 [2022-01-11 01:51:38,883 INFO L226 Difference]: Without dead ends: 4139 [2022-01-11 01:51:38,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 01:51:38,892 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 937 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:38,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [937 Valid, 846 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:38,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4139 states. [2022-01-11 01:51:39,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4139 to 3819. [2022-01-11 01:51:39,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3819 states, 3818 states have (on average 1.0539549502357255) internal successors, (4024), 3818 states have internal predecessors, (4024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3819 states to 3819 states and 4024 transitions. [2022-01-11 01:51:39,185 INFO L78 Accepts]: Start accepts. Automaton has 3819 states and 4024 transitions. Word has length 239 [2022-01-11 01:51:39,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:39,185 INFO L470 AbstractCegarLoop]: Abstraction has 3819 states and 4024 transitions. [2022-01-11 01:51:39,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.8) internal successors, (209), 5 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3819 states and 4024 transitions. [2022-01-11 01:51:39,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-01-11 01:51:39,188 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 01:51:39,188 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 01:51:39,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-11 01:51:39,188 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 01:51:39,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 01:51:39,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1442740482, now seen corresponding path program 1 times [2022-01-11 01:51:39,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 01:51:39,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630445915] [2022-01-11 01:51:39,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 01:51:39,189 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 01:51:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 01:51:39,359 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-11 01:51:39,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 01:51:39,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630445915] [2022-01-11 01:51:39,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630445915] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 01:51:39,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 01:51:39,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 01:51:39,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765653110] [2022-01-11 01:51:39,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 01:51:39,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 01:51:39,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 01:51:39,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 01:51:39,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-11 01:51:39,361 INFO L87 Difference]: Start difference. First operand 3819 states and 4024 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 01:51:39,766 INFO L93 Difference]: Finished difference Result 3819 states and 4024 transitions. [2022-01-11 01:51:39,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 01:51:39,767 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 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 239 [2022-01-11 01:51:39,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 01:51:39,767 INFO L225 Difference]: With dead ends: 3819 [2022-01-11 01:51:39,767 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 01:51:39,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-11 01:51:39,770 INFO L933 BasicCegarLoop]: 724 mSDtfsCounter, 579 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 2887 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 01:51:39,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 2887 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 01:51:39,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 01:51:39,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 01:51:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 01:51:39,770 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 239 [2022-01-11 01:51:39,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 01:51:39,770 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 01:51:39,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 01:51:39,770 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 01:51:39,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 01:51:39,772 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-01-11 01:51:39,773 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-01-11 01:51:39,773 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-01-11 01:51:39,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-11 01:51:39,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.