/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 20:02:23,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 20:02:23,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 20:02:23,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 20:02:23,726 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 20:02:23,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 20:02:23,732 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 20:02:23,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 20:02:23,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 20:02:23,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 20:02:23,739 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 20:02:23,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 20:02:23,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 20:02:23,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 20:02:23,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 20:02:23,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 20:02:23,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 20:02:23,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 20:02:23,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 20:02:23,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 20:02:23,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 20:02:23,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 20:02:23,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 20:02:23,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 20:02:23,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 20:02:23,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 20:02:23,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 20:02:23,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 20:02:23,762 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 20:02:23,762 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 20:02:23,762 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 20:02:23,763 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 20:02:23,764 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 20:02:23,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 20:02:23,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 20:02:23,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 20:02:23,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 20:02:23,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 20:02:23,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 20:02:23,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 20:02:23,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 20:02:23,768 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 20:02:23,793 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 20:02:23,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 20:02:23,793 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 20:02:23,793 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 20:02:23,795 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 20:02:23,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 20:02:23,795 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 20:02:23,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 20:02:23,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 20:02:23,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 20:02:23,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 20:02:23,795 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 20:02:23,795 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 20:02:23,796 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 20:02:23,796 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 20:02:23,796 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 20:02:23,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 20:02:23,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 20:02:23,796 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 20:02:23,796 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 20:02:23,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 20:02:23,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:02:23,797 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 20:02:23,797 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 20:02:23,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 20:02:23,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 20:02:23,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 20:02:23,798 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 20:02:23,798 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 20:02:23,798 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 20:02:23,798 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 20:02:23,798 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 20:02:23,799 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 20:02:23,799 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 20:02:24,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 20:02:24,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 20:02:24,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 20:02:24,030 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 20:02:24,031 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 20:02:24,032 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2022-01-10 20:02:24,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de58b38e/33e1ec662c0f462bb4b066e968b76246/FLAG90f04f6c0 [2022-01-10 20:02:24,537 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 20:02:24,537 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c [2022-01-10 20:02:24,559 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de58b38e/33e1ec662c0f462bb4b066e968b76246/FLAG90f04f6c0 [2022-01-10 20:02:24,919 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4de58b38e/33e1ec662c0f462bb4b066e968b76246 [2022-01-10 20:02:24,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 20:02:24,923 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 20:02:24,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 20:02:24,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 20:02:24,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 20:02:24,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:02:24" (1/1) ... [2022-01-10 20:02:24,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6941cea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:24, skipping insertion in model container [2022-01-10 20:02:24,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 08:02:24" (1/1) ... [2022-01-10 20:02:24,935 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 20:02:24,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 20:02:25,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[914,927] [2022-01-10 20:02:25,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[7115,7128] [2022-01-10 20:02:25,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:02:25,198 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 20:02:25,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[914,927] [2022-01-10 20:02:25,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pc_sfifo_2.cil-1+token_ring.03.cil-2.c[7115,7128] [2022-01-10 20:02:25,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 20:02:25,285 INFO L208 MainTranslator]: Completed translation [2022-01-10 20:02:25,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:25 WrapperNode [2022-01-10 20:02:25,286 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 20:02:25,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 20:02:25,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 20:02:25,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 20:02:25,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:25" (1/1) ... [2022-01-10 20:02:25,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:25" (1/1) ... [2022-01-10 20:02:25,348 INFO L137 Inliner]: procedures = 60, calls = 66, calls flagged for inlining = 61, calls inlined = 89, statements flattened = 1114 [2022-01-10 20:02:25,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 20:02:25,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 20:02:25,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 20:02:25,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 20:02:25,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:25" (1/1) ... [2022-01-10 20:02:25,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:25" (1/1) ... [2022-01-10 20:02:25,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:25" (1/1) ... [2022-01-10 20:02:25,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:25" (1/1) ... [2022-01-10 20:02:25,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:25" (1/1) ... [2022-01-10 20:02:25,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:25" (1/1) ... [2022-01-10 20:02:25,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:25" (1/1) ... [2022-01-10 20:02:25,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 20:02:25,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 20:02:25,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 20:02:25,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 20:02:25,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:25" (1/1) ... [2022-01-10 20:02:25,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 20:02:25,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:02:25,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 20:02:25,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 20:02:25,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 20:02:25,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 20:02:25,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 20:02:25,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 20:02:25,593 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 20:02:25,595 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 20:02:26,248 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 20:02:26,261 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 20:02:26,262 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-01-10 20:02:26,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:02:26 BoogieIcfgContainer [2022-01-10 20:02:26,264 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 20:02:26,265 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 20:02:26,265 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 20:02:26,266 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 20:02:26,268 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:02:26" (1/1) ... [2022-01-10 20:02:26,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:02:26 BasicIcfg [2022-01-10 20:02:26,447 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 20:02:26,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 20:02:26,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 20:02:26,451 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 20:02:26,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 08:02:24" (1/4) ... [2022-01-10 20:02:26,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0f38e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:02:26, skipping insertion in model container [2022-01-10 20:02:26,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 08:02:25" (2/4) ... [2022-01-10 20:02:26,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0f38e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 08:02:26, skipping insertion in model container [2022-01-10 20:02:26,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 08:02:26" (3/4) ... [2022-01-10 20:02:26,452 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c0f38e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 08:02:26, skipping insertion in model container [2022-01-10 20:02:26,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 08:02:26" (4/4) ... [2022-01-10 20:02:26,453 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.03.cil-2.cTransformedIcfg [2022-01-10 20:02:26,458 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 20:02:26,458 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-10 20:02:26,496 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 20:02:26,503 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 20:02:26,503 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-10 20:02:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand has 428 states, 424 states have (on average 1.5471698113207548) internal successors, (656), 427 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:26,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:02:26,527 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:26,527 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:26,527 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:26,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:26,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1947266229, now seen corresponding path program 1 times [2022-01-10 20:02:26,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:26,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192217091] [2022-01-10 20:02:26,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:26,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:26,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:26,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192217091] [2022-01-10 20:02:26,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192217091] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:26,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:26,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:26,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978629584] [2022-01-10 20:02:26,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:26,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:26,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:26,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:26,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:26,784 INFO L87 Difference]: Start difference. First operand has 428 states, 424 states have (on average 1.5471698113207548) internal successors, (656), 427 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:26,910 INFO L93 Difference]: Finished difference Result 885 states and 1354 transitions. [2022-01-10 20:02:26,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:26,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 20:02:26,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:26,928 INFO L225 Difference]: With dead ends: 885 [2022-01-10 20:02:26,928 INFO L226 Difference]: Without dead ends: 512 [2022-01-10 20:02:26,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:26,935 INFO L933 BasicCegarLoop]: 626 mSDtfsCounter, 124 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:26,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 1222 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:02:26,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2022-01-10 20:02:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 508. [2022-01-10 20:02:27,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 505 states have (on average 1.4732673267326732) internal successors, (744), 507 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:27,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 744 transitions. [2022-01-10 20:02:27,009 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 744 transitions. Word has length 44 [2022-01-10 20:02:27,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:27,009 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 744 transitions. [2022-01-10 20:02:27,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 744 transitions. [2022-01-10 20:02:27,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 20:02:27,013 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:27,013 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:27,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 20:02:27,014 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:27,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1586524979, now seen corresponding path program 1 times [2022-01-10 20:02:27,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:27,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99196735] [2022-01-10 20:02:27,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:27,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:27,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:27,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99196735] [2022-01-10 20:02:27,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99196735] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:27,105 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:27,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:27,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789810121] [2022-01-10 20:02:27,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:27,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:27,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:27,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:27,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:27,107 INFO L87 Difference]: Start difference. First operand 508 states and 744 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:27,139 INFO L93 Difference]: Finished difference Result 794 states and 1142 transitions. [2022-01-10 20:02:27,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:27,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-01-10 20:02:27,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:27,141 INFO L225 Difference]: With dead ends: 794 [2022-01-10 20:02:27,141 INFO L226 Difference]: Without dead ends: 664 [2022-01-10 20:02:27,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:27,142 INFO L933 BasicCegarLoop]: 619 mSDtfsCounter, 582 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:27,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [582 Valid, 737 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:27,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-01-10 20:02:27,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 660. [2022-01-10 20:02:27,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 657 states have (on average 1.4459665144596652) internal successors, (950), 659 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:27,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 950 transitions. [2022-01-10 20:02:27,195 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 950 transitions. Word has length 44 [2022-01-10 20:02:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:27,195 INFO L470 AbstractCegarLoop]: Abstraction has 660 states and 950 transitions. [2022-01-10 20:02:27,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:27,196 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 950 transitions. [2022-01-10 20:02:27,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 20:02:27,197 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:27,197 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:27,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 20:02:27,198 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:27,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:27,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1627410396, now seen corresponding path program 1 times [2022-01-10 20:02:27,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:27,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136188239] [2022-01-10 20:02:27,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:27,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:27,296 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:27,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136188239] [2022-01-10 20:02:27,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136188239] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:27,297 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:27,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:27,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900235622] [2022-01-10 20:02:27,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:27,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:27,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:27,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:27,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:27,299 INFO L87 Difference]: Start difference. First operand 660 states and 950 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:27,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:27,350 INFO L93 Difference]: Finished difference Result 1208 states and 1710 transitions. [2022-01-10 20:02:27,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:27,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-10 20:02:27,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:27,355 INFO L225 Difference]: With dead ends: 1208 [2022-01-10 20:02:27,355 INFO L226 Difference]: Without dead ends: 873 [2022-01-10 20:02:27,359 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:27,361 INFO L933 BasicCegarLoop]: 614 mSDtfsCounter, 94 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:27,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 1172 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-01-10 20:02:27,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 859. [2022-01-10 20:02:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 856 states have (on average 1.4228971962616823) internal successors, (1218), 858 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1218 transitions. [2022-01-10 20:02:27,388 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1218 transitions. Word has length 45 [2022-01-10 20:02:27,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:27,389 INFO L470 AbstractCegarLoop]: Abstraction has 859 states and 1218 transitions. [2022-01-10 20:02:27,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1218 transitions. [2022-01-10 20:02:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-10 20:02:27,395 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:27,396 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:27,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 20:02:27,396 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:27,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:27,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1597827933, now seen corresponding path program 1 times [2022-01-10 20:02:27,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:27,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396897202] [2022-01-10 20:02:27,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:27,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:27,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:27,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:27,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396897202] [2022-01-10 20:02:27,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396897202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:27,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:27,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:27,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160223262] [2022-01-10 20:02:27,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:27,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:27,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:27,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:27,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:27,451 INFO L87 Difference]: Start difference. First operand 859 states and 1218 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:27,492 INFO L93 Difference]: Finished difference Result 1747 states and 2430 transitions. [2022-01-10 20:02:27,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:27,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-01-10 20:02:27,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:27,497 INFO L225 Difference]: With dead ends: 1747 [2022-01-10 20:02:27,497 INFO L226 Difference]: Without dead ends: 1271 [2022-01-10 20:02:27,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:27,505 INFO L933 BasicCegarLoop]: 614 mSDtfsCounter, 570 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:27,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [570 Valid, 703 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:27,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2022-01-10 20:02:27,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1239. [2022-01-10 20:02:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1239 states, 1236 states have (on average 1.389967637540453) internal successors, (1718), 1238 states have internal predecessors, (1718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:27,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1718 transitions. [2022-01-10 20:02:27,536 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1718 transitions. Word has length 45 [2022-01-10 20:02:27,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:27,536 INFO L470 AbstractCegarLoop]: Abstraction has 1239 states and 1718 transitions. [2022-01-10 20:02:27,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1718 transitions. [2022-01-10 20:02:27,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 20:02:27,537 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:27,537 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:27,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 20:02:27,538 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:27,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:27,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1153767199, now seen corresponding path program 1 times [2022-01-10 20:02:27,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:27,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965672571] [2022-01-10 20:02:27,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:27,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:27,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:27,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:27,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965672571] [2022-01-10 20:02:27,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965672571] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:27,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:27,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:27,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408590695] [2022-01-10 20:02:27,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:27,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:27,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:27,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:27,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:27,611 INFO L87 Difference]: Start difference. First operand 1239 states and 1718 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:27,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:27,684 INFO L93 Difference]: Finished difference Result 2442 states and 3331 transitions. [2022-01-10 20:02:27,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:27,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-01-10 20:02:27,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:27,689 INFO L225 Difference]: With dead ends: 2442 [2022-01-10 20:02:27,689 INFO L226 Difference]: Without dead ends: 1558 [2022-01-10 20:02:27,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:27,690 INFO L933 BasicCegarLoop]: 618 mSDtfsCounter, 567 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:27,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [567 Valid, 707 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:27,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2022-01-10 20:02:27,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1536. [2022-01-10 20:02:27,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1533 states have (on average 1.3718199608610568) internal successors, (2103), 1535 states have internal predecessors, (2103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:27,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 2103 transitions. [2022-01-10 20:02:27,774 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 2103 transitions. Word has length 51 [2022-01-10 20:02:27,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:27,776 INFO L470 AbstractCegarLoop]: Abstraction has 1536 states and 2103 transitions. [2022-01-10 20:02:27,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 2103 transitions. [2022-01-10 20:02:27,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 20:02:27,780 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:27,780 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:27,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 20:02:27,780 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:27,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:27,781 INFO L85 PathProgramCache]: Analyzing trace with hash 717599730, now seen corresponding path program 1 times [2022-01-10 20:02:27,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:27,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926412013] [2022-01-10 20:02:27,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:27,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 20:02:27,867 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:27,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926412013] [2022-01-10 20:02:27,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926412013] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:27,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:27,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:02:27,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942358713] [2022-01-10 20:02:27,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:27,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:02:27,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:27,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:02:27,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:02:27,869 INFO L87 Difference]: Start difference. First operand 1536 states and 2103 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:27,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:27,977 INFO L93 Difference]: Finished difference Result 3162 states and 4307 transitions. [2022-01-10 20:02:27,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:02:27,978 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-10 20:02:27,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:27,983 INFO L225 Difference]: With dead ends: 3162 [2022-01-10 20:02:27,983 INFO L226 Difference]: Without dead ends: 2211 [2022-01-10 20:02:27,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:02:27,985 INFO L933 BasicCegarLoop]: 607 mSDtfsCounter, 395 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:27,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 2537 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2211 states. [2022-01-10 20:02:28,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2211 to 1560. [2022-01-10 20:02:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1557 states have (on average 1.3545279383429671) internal successors, (2109), 1559 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:28,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2109 transitions. [2022-01-10 20:02:28,047 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2109 transitions. Word has length 52 [2022-01-10 20:02:28,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:28,047 INFO L470 AbstractCegarLoop]: Abstraction has 1560 states and 2109 transitions. [2022-01-10 20:02:28,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2109 transitions. [2022-01-10 20:02:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 20:02:28,048 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:28,048 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:28,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 20:02:28,049 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:28,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:28,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1627067311, now seen corresponding path program 1 times [2022-01-10 20:02:28,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:28,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373981622] [2022-01-10 20:02:28,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:28,049 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:28,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 20:02:28,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:28,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373981622] [2022-01-10 20:02:28,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373981622] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:28,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:28,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:02:28,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373497288] [2022-01-10 20:02:28,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:28,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:02:28,086 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:28,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:02:28,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:02:28,087 INFO L87 Difference]: Start difference. First operand 1560 states and 2109 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:28,226 INFO L93 Difference]: Finished difference Result 3315 states and 4458 transitions. [2022-01-10 20:02:28,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:02:28,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-10 20:02:28,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:28,232 INFO L225 Difference]: With dead ends: 3315 [2022-01-10 20:02:28,232 INFO L226 Difference]: Without dead ends: 2150 [2022-01-10 20:02:28,234 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:02:28,234 INFO L933 BasicCegarLoop]: 606 mSDtfsCounter, 354 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:28,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 2553 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:28,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2150 states. [2022-01-10 20:02:28,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2150 to 1578. [2022-01-10 20:02:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1575 states have (on average 1.3377777777777777) internal successors, (2107), 1577 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2107 transitions. [2022-01-10 20:02:28,317 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2107 transitions. Word has length 52 [2022-01-10 20:02:28,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:28,317 INFO L470 AbstractCegarLoop]: Abstraction has 1578 states and 2107 transitions. [2022-01-10 20:02:28,318 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2107 transitions. [2022-01-10 20:02:28,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-10 20:02:28,318 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:28,318 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:28,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 20:02:28,319 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:28,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:28,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1615751184, now seen corresponding path program 1 times [2022-01-10 20:02:28,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:28,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526387181] [2022-01-10 20:02:28,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:28,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:28,367 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:28,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526387181] [2022-01-10 20:02:28,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526387181] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:28,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:28,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 20:02:28,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579375054] [2022-01-10 20:02:28,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:28,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 20:02:28,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:28,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 20:02:28,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 20:02:28,368 INFO L87 Difference]: Start difference. First operand 1578 states and 2107 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:28,518 INFO L93 Difference]: Finished difference Result 1810 states and 2407 transitions. [2022-01-10 20:02:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 20:02:28,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-01-10 20:02:28,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:28,523 INFO L225 Difference]: With dead ends: 1810 [2022-01-10 20:02:28,523 INFO L226 Difference]: Without dead ends: 1808 [2022-01-10 20:02:28,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:02:28,524 INFO L933 BasicCegarLoop]: 615 mSDtfsCounter, 1273 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:28,524 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1273 Valid, 703 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2022-01-10 20:02:28,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1576. [2022-01-10 20:02:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1574 states have (on average 1.3329097839898347) internal successors, (2098), 1575 states have internal predecessors, (2098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2098 transitions. [2022-01-10 20:02:28,645 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2098 transitions. Word has length 52 [2022-01-10 20:02:28,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:28,645 INFO L470 AbstractCegarLoop]: Abstraction has 1576 states and 2098 transitions. [2022-01-10 20:02:28,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2098 transitions. [2022-01-10 20:02:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-10 20:02:28,646 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:28,646 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:28,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 20:02:28,646 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:28,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:28,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1451321727, now seen corresponding path program 1 times [2022-01-10 20:02:28,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:28,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604599406] [2022-01-10 20:02:28,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:28,647 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:28,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:28,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:28,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604599406] [2022-01-10 20:02:28,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604599406] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 20:02:28,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940397900] [2022-01-10 20:02:28,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:28,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:02:28,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 20:02:28,863 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 20:02:28,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 20:02:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:28,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 20:02:28,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 20:02:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:29,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 20:02:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:29,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940397900] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 20:02:29,487 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 20:02:29,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-01-10 20:02:29,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548756414] [2022-01-10 20:02:29,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 20:02:29,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 20:02:29,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:29,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 20:02:29,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:02:29,489 INFO L87 Difference]: Start difference. First operand 1576 states and 2098 transitions. Second operand has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:29,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:29,824 INFO L93 Difference]: Finished difference Result 3933 states and 5198 transitions. [2022-01-10 20:02:29,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 20:02:29,825 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-01-10 20:02:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:29,835 INFO L225 Difference]: With dead ends: 3933 [2022-01-10 20:02:29,835 INFO L226 Difference]: Without dead ends: 3931 [2022-01-10 20:02:29,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 20:02:29,837 INFO L933 BasicCegarLoop]: 766 mSDtfsCounter, 1230 mSDsluCounter, 1898 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 2664 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:29,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1230 Valid, 2664 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:29,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2022-01-10 20:02:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 2551. [2022-01-10 20:02:30,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2551 states, 2549 states have (on average 1.3256178893683797) internal successors, (3379), 2550 states have internal predecessors, (3379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:30,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2551 states to 2551 states and 3379 transitions. [2022-01-10 20:02:30,035 INFO L78 Accepts]: Start accepts. Automaton has 2551 states and 3379 transitions. Word has length 53 [2022-01-10 20:02:30,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:30,035 INFO L470 AbstractCegarLoop]: Abstraction has 2551 states and 3379 transitions. [2022-01-10 20:02:30,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.1) internal successors, (151), 10 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:30,036 INFO L276 IsEmpty]: Start isEmpty. Operand 2551 states and 3379 transitions. [2022-01-10 20:02:30,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 20:02:30,037 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:30,037 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:30,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 20:02:30,279 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 20:02:30,280 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:30,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:30,280 INFO L85 PathProgramCache]: Analyzing trace with hash -608300638, now seen corresponding path program 2 times [2022-01-10 20:02:30,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:30,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606932570] [2022-01-10 20:02:30,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:30,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:30,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:30,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:30,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606932570] [2022-01-10 20:02:30,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606932570] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:30,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:30,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:30,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795330482] [2022-01-10 20:02:30,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:30,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:30,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:30,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:30,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:30,307 INFO L87 Difference]: Start difference. First operand 2551 states and 3379 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:30,432 INFO L93 Difference]: Finished difference Result 3645 states and 4824 transitions. [2022-01-10 20:02:30,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:30,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-10 20:02:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:30,437 INFO L225 Difference]: With dead ends: 3645 [2022-01-10 20:02:30,437 INFO L226 Difference]: Without dead ends: 1905 [2022-01-10 20:02:30,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:30,440 INFO L933 BasicCegarLoop]: 678 mSDtfsCounter, 561 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:30,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [561 Valid, 794 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:30,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2022-01-10 20:02:30,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1889. [2022-01-10 20:02:30,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1889 states, 1887 states have (on average 1.3116057233704292) internal successors, (2475), 1888 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 2475 transitions. [2022-01-10 20:02:30,578 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 2475 transitions. Word has length 56 [2022-01-10 20:02:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:30,578 INFO L470 AbstractCegarLoop]: Abstraction has 1889 states and 2475 transitions. [2022-01-10 20:02:30,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 2475 transitions. [2022-01-10 20:02:30,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-10 20:02:30,579 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:30,579 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:30,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 20:02:30,580 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:30,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:30,580 INFO L85 PathProgramCache]: Analyzing trace with hash 354334303, now seen corresponding path program 1 times [2022-01-10 20:02:30,580 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:30,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653877394] [2022-01-10 20:02:30,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:30,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:30,605 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:30,605 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:30,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653877394] [2022-01-10 20:02:30,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653877394] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:30,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:30,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:30,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007047406] [2022-01-10 20:02:30,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:30,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:30,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:30,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:30,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:30,607 INFO L87 Difference]: Start difference. First operand 1889 states and 2475 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:30,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:30,790 INFO L93 Difference]: Finished difference Result 4376 states and 5623 transitions. [2022-01-10 20:02:30,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:30,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-01-10 20:02:30,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:30,797 INFO L225 Difference]: With dead ends: 4376 [2022-01-10 20:02:30,797 INFO L226 Difference]: Without dead ends: 2274 [2022-01-10 20:02:30,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:30,800 INFO L933 BasicCegarLoop]: 701 mSDtfsCounter, 89 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:30,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 1298 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:30,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2274 states. [2022-01-10 20:02:30,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2274 to 2274. [2022-01-10 20:02:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2274 states, 2272 states have (on average 1.2913732394366197) internal successors, (2934), 2273 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2274 states to 2274 states and 2934 transitions. [2022-01-10 20:02:30,947 INFO L78 Accepts]: Start accepts. Automaton has 2274 states and 2934 transitions. Word has length 60 [2022-01-10 20:02:30,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:30,947 INFO L470 AbstractCegarLoop]: Abstraction has 2274 states and 2934 transitions. [2022-01-10 20:02:30,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2274 states and 2934 transitions. [2022-01-10 20:02:30,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 20:02:30,950 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:30,950 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-10 20:02:30,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 20:02:30,950 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:30,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:30,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1360571065, now seen corresponding path program 1 times [2022-01-10 20:02:30,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:30,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474138871] [2022-01-10 20:02:30,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:30,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:30,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:30,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474138871] [2022-01-10 20:02:30,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474138871] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:30,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:30,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:30,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283516512] [2022-01-10 20:02:30,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:30,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:30,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:30,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:30,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:30,984 INFO L87 Difference]: Start difference. First operand 2274 states and 2934 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:31,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:31,120 INFO L93 Difference]: Finished difference Result 2819 states and 3747 transitions. [2022-01-10 20:02:31,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:31,121 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-10 20:02:31,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:31,127 INFO L225 Difference]: With dead ends: 2819 [2022-01-10 20:02:31,127 INFO L226 Difference]: Without dead ends: 2509 [2022-01-10 20:02:31,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:31,129 INFO L933 BasicCegarLoop]: 618 mSDtfsCounter, 551 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:31,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 1003 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:31,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2022-01-10 20:02:31,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 2507. [2022-01-10 20:02:31,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2505 states have (on average 1.3085828343313373) internal successors, (3278), 2506 states have internal predecessors, (3278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3278 transitions. [2022-01-10 20:02:31,281 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3278 transitions. Word has length 66 [2022-01-10 20:02:31,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:31,281 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3278 transitions. [2022-01-10 20:02:31,281 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-10 20:02:31,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3278 transitions. [2022-01-10 20:02:31,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 20:02:31,282 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:31,282 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-10 20:02:31,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 20:02:31,283 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:31,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:31,283 INFO L85 PathProgramCache]: Analyzing trace with hash -95469209, now seen corresponding path program 1 times [2022-01-10 20:02:31,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:31,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664819469] [2022-01-10 20:02:31,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:31,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:31,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:31,300 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:31,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664819469] [2022-01-10 20:02:31,300 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664819469] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:31,300 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:31,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:31,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238050797] [2022-01-10 20:02:31,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:31,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:31,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:31,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:31,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:31,301 INFO L87 Difference]: Start difference. First operand 2507 states and 3278 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:31,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:31,446 INFO L93 Difference]: Finished difference Result 3049 states and 4085 transitions. [2022-01-10 20:02:31,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:31,447 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-10 20:02:31,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:31,453 INFO L225 Difference]: With dead ends: 3049 [2022-01-10 20:02:31,453 INFO L226 Difference]: Without dead ends: 2507 [2022-01-10 20:02:31,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:31,454 INFO L933 BasicCegarLoop]: 597 mSDtfsCounter, 591 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:31,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [591 Valid, 597 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:31,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-10 20:02:31,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-10 20:02:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2505 states have (on average 1.3053892215568863) internal successors, (3270), 2506 states have internal predecessors, (3270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:31,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3270 transitions. [2022-01-10 20:02:31,583 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3270 transitions. Word has length 66 [2022-01-10 20:02:31,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:31,583 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3270 transitions. [2022-01-10 20:02:31,583 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-10 20:02:31,583 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3270 transitions. [2022-01-10 20:02:31,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 20:02:31,584 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:31,584 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-10 20:02:31,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 20:02:31,585 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:31,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:31,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1440132793, now seen corresponding path program 1 times [2022-01-10 20:02:31,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:31,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698555318] [2022-01-10 20:02:31,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:31,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:31,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-10 20:02:31,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:31,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698555318] [2022-01-10 20:02:31,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698555318] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:31,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:31,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:31,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992148896] [2022-01-10 20:02:31,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:31,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:31,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:31,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:31,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:31,604 INFO L87 Difference]: Start difference. First operand 2507 states and 3270 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:31,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:31,786 INFO L93 Difference]: Finished difference Result 3048 states and 4068 transitions. [2022-01-10 20:02:31,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:31,787 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-10 20:02:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:31,793 INFO L225 Difference]: With dead ends: 3048 [2022-01-10 20:02:31,793 INFO L226 Difference]: Without dead ends: 2507 [2022-01-10 20:02:31,794 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:31,794 INFO L933 BasicCegarLoop]: 592 mSDtfsCounter, 585 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:31,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [585 Valid, 592 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:31,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-10 20:02:31,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-10 20:02:31,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2505 states have (on average 1.3021956087824351) internal successors, (3262), 2506 states have internal predecessors, (3262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3262 transitions. [2022-01-10 20:02:31,922 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3262 transitions. Word has length 66 [2022-01-10 20:02:31,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:31,922 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3262 transitions. [2022-01-10 20:02:31,922 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-10 20:02:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3262 transitions. [2022-01-10 20:02:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 20:02:31,924 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:31,924 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-10 20:02:31,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 20:02:31,924 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:31,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:31,924 INFO L85 PathProgramCache]: Analyzing trace with hash -790772377, now seen corresponding path program 1 times [2022-01-10 20:02:31,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:31,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305732923] [2022-01-10 20:02:31,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:31,924 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:31,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:31,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305732923] [2022-01-10 20:02:31,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305732923] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:31,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:31,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:31,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438819297] [2022-01-10 20:02:31,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:31,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:31,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:31,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:31,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:31,942 INFO L87 Difference]: Start difference. First operand 2507 states and 3262 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:32,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:32,091 INFO L93 Difference]: Finished difference Result 3047 states and 4051 transitions. [2022-01-10 20:02:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:32,091 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-10 20:02:32,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:32,094 INFO L225 Difference]: With dead ends: 3047 [2022-01-10 20:02:32,095 INFO L226 Difference]: Without dead ends: 2507 [2022-01-10 20:02:32,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:32,096 INFO L933 BasicCegarLoop]: 587 mSDtfsCounter, 579 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:32,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 587 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-10 20:02:32,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-10 20:02:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2505 states have (on average 1.299001996007984) internal successors, (3254), 2506 states have internal predecessors, (3254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:32,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3254 transitions. [2022-01-10 20:02:32,225 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3254 transitions. Word has length 66 [2022-01-10 20:02:32,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:32,225 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3254 transitions. [2022-01-10 20:02:32,226 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-10 20:02:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3254 transitions. [2022-01-10 20:02:32,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 20:02:32,227 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:32,227 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-10 20:02:32,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 20:02:32,227 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:32,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:32,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1169837383, now seen corresponding path program 1 times [2022-01-10 20:02:32,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:32,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906945093] [2022-01-10 20:02:32,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:32,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:32,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:32,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906945093] [2022-01-10 20:02:32,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906945093] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:32,257 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:32,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:32,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723747881] [2022-01-10 20:02:32,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:32,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:32,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:32,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:32,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:32,258 INFO L87 Difference]: Start difference. First operand 2507 states and 3254 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:32,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:32,405 INFO L93 Difference]: Finished difference Result 3046 states and 4034 transitions. [2022-01-10 20:02:32,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:32,406 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-10 20:02:32,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:32,409 INFO L225 Difference]: With dead ends: 3046 [2022-01-10 20:02:32,409 INFO L226 Difference]: Without dead ends: 2507 [2022-01-10 20:02:32,410 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:32,411 INFO L933 BasicCegarLoop]: 570 mSDtfsCounter, 525 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:32,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 608 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:32,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-10 20:02:32,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-10 20:02:32,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2505 states have (on average 1.291816367265469) internal successors, (3236), 2506 states have internal predecessors, (3236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3236 transitions. [2022-01-10 20:02:32,562 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3236 transitions. Word has length 66 [2022-01-10 20:02:32,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:32,562 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3236 transitions. [2022-01-10 20:02:32,562 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-10 20:02:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3236 transitions. [2022-01-10 20:02:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 20:02:32,563 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:32,563 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-10 20:02:32,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 20:02:32,564 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:32,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:32,564 INFO L85 PathProgramCache]: Analyzing trace with hash 698780390, now seen corresponding path program 1 times [2022-01-10 20:02:32,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:32,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260930540] [2022-01-10 20:02:32,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:32,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:32,581 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:32,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260930540] [2022-01-10 20:02:32,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260930540] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:32,581 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:32,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:32,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972284384] [2022-01-10 20:02:32,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:32,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:32,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:32,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:32,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:32,582 INFO L87 Difference]: Start difference. First operand 2507 states and 3236 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:32,738 INFO L93 Difference]: Finished difference Result 3045 states and 3997 transitions. [2022-01-10 20:02:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:32,738 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-10 20:02:32,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:32,741 INFO L225 Difference]: With dead ends: 3045 [2022-01-10 20:02:32,741 INFO L226 Difference]: Without dead ends: 2507 [2022-01-10 20:02:32,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:32,743 INFO L933 BasicCegarLoop]: 559 mSDtfsCounter, 514 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:32,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [514 Valid, 596 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:32,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-10 20:02:32,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-10 20:02:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2505 states have (on average 1.284630738522954) internal successors, (3218), 2506 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:32,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3218 transitions. [2022-01-10 20:02:32,938 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3218 transitions. Word has length 66 [2022-01-10 20:02:32,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:32,938 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3218 transitions. [2022-01-10 20:02:32,938 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-10 20:02:32,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3218 transitions. [2022-01-10 20:02:32,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 20:02:32,939 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:32,939 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-10 20:02:32,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 20:02:32,940 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:32,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:32,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1822398341, now seen corresponding path program 1 times [2022-01-10 20:02:32,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:32,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662513782] [2022-01-10 20:02:32,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:32,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:32,963 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:32,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662513782] [2022-01-10 20:02:32,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662513782] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:32,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:32,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:32,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230872987] [2022-01-10 20:02:32,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:32,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:32,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:32,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:32,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:32,965 INFO L87 Difference]: Start difference. First operand 2507 states and 3218 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:33,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:33,144 INFO L93 Difference]: Finished difference Result 3044 states and 3960 transitions. [2022-01-10 20:02:33,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:33,144 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-10 20:02:33,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:33,147 INFO L225 Difference]: With dead ends: 3044 [2022-01-10 20:02:33,147 INFO L226 Difference]: Without dead ends: 2507 [2022-01-10 20:02:33,148 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:33,148 INFO L933 BasicCegarLoop]: 548 mSDtfsCounter, 503 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:33,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [503 Valid, 584 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-10 20:02:33,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-10 20:02:33,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2505 states have (on average 1.2774451097804391) internal successors, (3200), 2506 states have internal predecessors, (3200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:33,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3200 transitions. [2022-01-10 20:02:33,315 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3200 transitions. Word has length 66 [2022-01-10 20:02:33,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:33,315 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3200 transitions. [2022-01-10 20:02:33,315 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-10 20:02:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3200 transitions. [2022-01-10 20:02:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 20:02:33,316 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:33,316 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-10 20:02:33,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 20:02:33,317 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:33,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:33,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1878301788, now seen corresponding path program 1 times [2022-01-10 20:02:33,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:33,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754740639] [2022-01-10 20:02:33,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:33,317 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:33,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:33,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:33,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754740639] [2022-01-10 20:02:33,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754740639] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:33,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:33,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:33,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276396656] [2022-01-10 20:02:33,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:33,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:33,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:33,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:33,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:33,334 INFO L87 Difference]: Start difference. First operand 2507 states and 3200 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:33,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:33,488 INFO L93 Difference]: Finished difference Result 3043 states and 3923 transitions. [2022-01-10 20:02:33,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:33,489 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-10 20:02:33,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:33,492 INFO L225 Difference]: With dead ends: 3043 [2022-01-10 20:02:33,492 INFO L226 Difference]: Without dead ends: 2507 [2022-01-10 20:02:33,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:33,493 INFO L933 BasicCegarLoop]: 537 mSDtfsCounter, 492 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:33,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [492 Valid, 572 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:33,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-01-10 20:02:33,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 2507. [2022-01-10 20:02:33,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2507 states, 2505 states have (on average 1.2702594810379242) internal successors, (3182), 2506 states have internal predecessors, (3182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:33,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2507 states to 2507 states and 3182 transitions. [2022-01-10 20:02:33,668 INFO L78 Accepts]: Start accepts. Automaton has 2507 states and 3182 transitions. Word has length 66 [2022-01-10 20:02:33,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:33,669 INFO L470 AbstractCegarLoop]: Abstraction has 2507 states and 3182 transitions. [2022-01-10 20:02:33,669 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-10 20:02:33,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 3182 transitions. [2022-01-10 20:02:33,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 20:02:33,670 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:33,670 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-10 20:02:33,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 20:02:33,670 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:33,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:33,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2082000579, now seen corresponding path program 1 times [2022-01-10 20:02:33,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:33,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133497596] [2022-01-10 20:02:33,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:33,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:33,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:33,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133497596] [2022-01-10 20:02:33,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133497596] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:33,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:33,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:02:33,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616302168] [2022-01-10 20:02:33,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:33,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:02:33,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:33,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:02:33,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:02:33,700 INFO L87 Difference]: Start difference. First operand 2507 states and 3182 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:33,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:33,919 INFO L93 Difference]: Finished difference Result 3412 states and 4393 transitions. [2022-01-10 20:02:33,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:02:33,919 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-10 20:02:33,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:33,923 INFO L225 Difference]: With dead ends: 3412 [2022-01-10 20:02:33,923 INFO L226 Difference]: Without dead ends: 2897 [2022-01-10 20:02:33,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:02:33,925 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 946 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 1847 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:33,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [946 Valid, 1847 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:02:33,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2022-01-10 20:02:34,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 2513. [2022-01-10 20:02:34,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2513 states, 2511 states have (on average 1.26563122262047) internal successors, (3178), 2512 states have internal predecessors, (3178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 3178 transitions. [2022-01-10 20:02:34,083 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 3178 transitions. Word has length 66 [2022-01-10 20:02:34,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:34,083 INFO L470 AbstractCegarLoop]: Abstraction has 2513 states and 3178 transitions. [2022-01-10 20:02:34,083 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-10 20:02:34,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 3178 transitions. [2022-01-10 20:02:34,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 20:02:34,085 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:34,085 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-10 20:02:34,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 20:02:34,085 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:34,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:34,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1862166780, now seen corresponding path program 1 times [2022-01-10 20:02:34,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:34,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582243307] [2022-01-10 20:02:34,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:34,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:34,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:34,138 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:34,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582243307] [2022-01-10 20:02:34,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582243307] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:34,138 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:34,138 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 20:02:34,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068497612] [2022-01-10 20:02:34,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:34,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 20:02:34,140 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:34,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 20:02:34,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-10 20:02:34,140 INFO L87 Difference]: Start difference. First operand 2513 states and 3178 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:34,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:34,390 INFO L93 Difference]: Finished difference Result 3465 states and 4431 transitions. [2022-01-10 20:02:34,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 20:02:34,390 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-10 20:02:34,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:34,394 INFO L225 Difference]: With dead ends: 3465 [2022-01-10 20:02:34,394 INFO L226 Difference]: Without dead ends: 2951 [2022-01-10 20:02:34,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 20:02:34,395 INFO L933 BasicCegarLoop]: 522 mSDtfsCounter, 854 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1936 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:34,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [854 Valid, 1936 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 20:02:34,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2022-01-10 20:02:34,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2519. [2022-01-10 20:02:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2519 states, 2517 states have (on average 1.2610250297973777) internal successors, (3174), 2518 states have internal predecessors, (3174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2519 states to 2519 states and 3174 transitions. [2022-01-10 20:02:34,566 INFO L78 Accepts]: Start accepts. Automaton has 2519 states and 3174 transitions. Word has length 66 [2022-01-10 20:02:34,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:34,566 INFO L470 AbstractCegarLoop]: Abstraction has 2519 states and 3174 transitions. [2022-01-10 20:02:34,566 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-10 20:02:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2519 states and 3174 transitions. [2022-01-10 20:02:34,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-10 20:02:34,567 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:34,567 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-10 20:02:34,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 20:02:34,568 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:34,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:34,568 INFO L85 PathProgramCache]: Analyzing trace with hash 355591173, now seen corresponding path program 1 times [2022-01-10 20:02:34,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:34,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988900714] [2022-01-10 20:02:34,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:34,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:34,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:34,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988900714] [2022-01-10 20:02:34,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988900714] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:34,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:34,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:34,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882798363] [2022-01-10 20:02:34,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:34,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:34,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:34,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:34,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:34,608 INFO L87 Difference]: Start difference. First operand 2519 states and 3174 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 2 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:34,864 INFO L93 Difference]: Finished difference Result 3555 states and 4498 transitions. [2022-01-10 20:02:34,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:34,865 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-10 20:02:34,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:34,869 INFO L225 Difference]: With dead ends: 3555 [2022-01-10 20:02:34,870 INFO L226 Difference]: Without dead ends: 3009 [2022-01-10 20:02:34,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:34,873 INFO L933 BasicCegarLoop]: 526 mSDtfsCounter, 451 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:34,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [451 Valid, 850 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:34,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2022-01-10 20:02:35,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 2955. [2022-01-10 20:02:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2955 states, 2953 states have (on average 1.2607517778530308) internal successors, (3723), 2954 states have internal predecessors, (3723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:35,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 3723 transitions. [2022-01-10 20:02:35,128 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 3723 transitions. Word has length 66 [2022-01-10 20:02:35,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:35,128 INFO L470 AbstractCegarLoop]: Abstraction has 2955 states and 3723 transitions. [2022-01-10 20:02:35,128 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-10 20:02:35,128 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3723 transitions. [2022-01-10 20:02:35,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-10 20:02:35,130 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:35,130 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:35,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 20:02:35,130 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:35,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:35,130 INFO L85 PathProgramCache]: Analyzing trace with hash 540485178, now seen corresponding path program 1 times [2022-01-10 20:02:35,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:35,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068195958] [2022-01-10 20:02:35,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:35,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:35,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 20:02:35,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:35,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068195958] [2022-01-10 20:02:35,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068195958] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:35,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:35,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:35,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865834088] [2022-01-10 20:02:35,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:35,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:35,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:35,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:35,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:35,155 INFO L87 Difference]: Start difference. First operand 2955 states and 3723 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:35,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:35,386 INFO L93 Difference]: Finished difference Result 4818 states and 6075 transitions. [2022-01-10 20:02:35,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:35,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-01-10 20:02:35,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:35,390 INFO L225 Difference]: With dead ends: 4818 [2022-01-10 20:02:35,390 INFO L226 Difference]: Without dead ends: 2955 [2022-01-10 20:02:35,392 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:35,392 INFO L933 BasicCegarLoop]: 535 mSDtfsCounter, 478 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:35,393 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [478 Valid, 619 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:35,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-01-10 20:02:35,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2955. [2022-01-10 20:02:35,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2955 states, 2953 states have (on average 1.2472062309515746) internal successors, (3683), 2954 states have internal predecessors, (3683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:35,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 3683 transitions. [2022-01-10 20:02:35,583 INFO L78 Accepts]: Start accepts. Automaton has 2955 states and 3683 transitions. Word has length 68 [2022-01-10 20:02:35,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:35,583 INFO L470 AbstractCegarLoop]: Abstraction has 2955 states and 3683 transitions. [2022-01-10 20:02:35,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3683 transitions. [2022-01-10 20:02:35,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 20:02:35,585 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:35,585 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:35,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 20:02:35,585 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:35,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:35,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1416385341, now seen corresponding path program 1 times [2022-01-10 20:02:35,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:35,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425646472] [2022-01-10 20:02:35,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:35,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:35,606 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 20:02:35,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:35,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425646472] [2022-01-10 20:02:35,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425646472] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:35,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:35,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:35,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872546884] [2022-01-10 20:02:35,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:35,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:35,607 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:35,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:35,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:35,607 INFO L87 Difference]: Start difference. First operand 2955 states and 3683 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:35,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:35,767 INFO L93 Difference]: Finished difference Result 4254 states and 5317 transitions. [2022-01-10 20:02:35,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:35,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-01-10 20:02:35,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:35,770 INFO L225 Difference]: With dead ends: 4254 [2022-01-10 20:02:35,770 INFO L226 Difference]: Without dead ends: 2629 [2022-01-10 20:02:35,772 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:35,773 INFO L933 BasicCegarLoop]: 618 mSDtfsCounter, 99 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:35,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 1135 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:35,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2022-01-10 20:02:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2627. [2022-01-10 20:02:35,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2625 states have (on average 1.2377142857142858) internal successors, (3249), 2626 states have internal predecessors, (3249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 3249 transitions. [2022-01-10 20:02:35,927 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 3249 transitions. Word has length 69 [2022-01-10 20:02:35,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:35,927 INFO L470 AbstractCegarLoop]: Abstraction has 2627 states and 3249 transitions. [2022-01-10 20:02:35,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 3249 transitions. [2022-01-10 20:02:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-01-10 20:02:35,929 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:35,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] [2022-01-10 20:02:35,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 20:02:35,930 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:35,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:35,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1946897006, now seen corresponding path program 1 times [2022-01-10 20:02:35,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:35,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758422585] [2022-01-10 20:02:35,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:35,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-10 20:02:35,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:35,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758422585] [2022-01-10 20:02:35,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758422585] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:35,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:35,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:35,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093504809] [2022-01-10 20:02:35,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:35,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:35,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:35,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:35,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:35,948 INFO L87 Difference]: Start difference. First operand 2627 states and 3249 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:36,133 INFO L93 Difference]: Finished difference Result 4271 states and 5353 transitions. [2022-01-10 20:02:36,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:36,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-01-10 20:02:36,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:36,137 INFO L225 Difference]: With dead ends: 4271 [2022-01-10 20:02:36,137 INFO L226 Difference]: Without dead ends: 2903 [2022-01-10 20:02:36,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:36,139 INFO L933 BasicCegarLoop]: 529 mSDtfsCounter, 509 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:36,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 617 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:36,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2022-01-10 20:02:36,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2864. [2022-01-10 20:02:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2864 states, 2862 states have (on average 1.253319357092942) internal successors, (3587), 2863 states have internal predecessors, (3587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2864 states to 2864 states and 3587 transitions. [2022-01-10 20:02:36,328 INFO L78 Accepts]: Start accepts. Automaton has 2864 states and 3587 transitions. Word has length 100 [2022-01-10 20:02:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:36,328 INFO L470 AbstractCegarLoop]: Abstraction has 2864 states and 3587 transitions. [2022-01-10 20:02:36,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2864 states and 3587 transitions. [2022-01-10 20:02:36,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 20:02:36,330 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:36,330 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-10 20:02:36,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 20:02:36,331 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:36,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:36,331 INFO L85 PathProgramCache]: Analyzing trace with hash 329541292, now seen corresponding path program 1 times [2022-01-10 20:02:36,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:36,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954939576] [2022-01-10 20:02:36,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:36,331 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:36,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:36,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954939576] [2022-01-10 20:02:36,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954939576] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:36,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:36,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:36,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152077988] [2022-01-10 20:02:36,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:36,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:36,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:36,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:36,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:36,356 INFO L87 Difference]: Start difference. First operand 2864 states and 3587 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:36,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:36,593 INFO L93 Difference]: Finished difference Result 4728 states and 5958 transitions. [2022-01-10 20:02:36,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:36,594 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-10 20:02:36,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:36,598 INFO L225 Difference]: With dead ends: 4728 [2022-01-10 20:02:36,598 INFO L226 Difference]: Without dead ends: 3752 [2022-01-10 20:02:36,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:36,600 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 448 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:36,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [448 Valid, 837 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:36,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3752 states. [2022-01-10 20:02:36,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3752 to 3650. [2022-01-10 20:02:36,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 3648 states have (on average 1.2552083333333333) internal successors, (4579), 3649 states have internal predecessors, (4579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:36,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 4579 transitions. [2022-01-10 20:02:36,824 INFO L78 Accepts]: Start accepts. Automaton has 3650 states and 4579 transitions. Word has length 106 [2022-01-10 20:02:36,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:36,824 INFO L470 AbstractCegarLoop]: Abstraction has 3650 states and 4579 transitions. [2022-01-10 20:02:36,824 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-10 20:02:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 4579 transitions. [2022-01-10 20:02:36,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 20:02:36,826 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:36,826 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-10 20:02:36,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 20:02:36,826 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:36,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:36,827 INFO L85 PathProgramCache]: Analyzing trace with hash -188961109, now seen corresponding path program 1 times [2022-01-10 20:02:36,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:36,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278966995] [2022-01-10 20:02:36,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:36,827 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:36,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:36,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278966995] [2022-01-10 20:02:36,869 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278966995] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:36,869 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:36,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:36,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764222831] [2022-01-10 20:02:36,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:36,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:36,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:36,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:36,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:36,870 INFO L87 Difference]: Start difference. First operand 3650 states and 4579 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:37,186 INFO L93 Difference]: Finished difference Result 7035 states and 8818 transitions. [2022-01-10 20:02:37,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:37,186 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-10 20:02:37,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:37,194 INFO L225 Difference]: With dead ends: 7035 [2022-01-10 20:02:37,194 INFO L226 Difference]: Without dead ends: 5301 [2022-01-10 20:02:37,196 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:37,197 INFO L933 BasicCegarLoop]: 594 mSDtfsCounter, 457 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:37,197 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [457 Valid, 970 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2022-01-10 20:02:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 5215. [2022-01-10 20:02:37,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5215 states, 5213 states have (on average 1.2441971993094187) internal successors, (6486), 5214 states have internal predecessors, (6486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:37,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5215 states to 5215 states and 6486 transitions. [2022-01-10 20:02:37,505 INFO L78 Accepts]: Start accepts. Automaton has 5215 states and 6486 transitions. Word has length 106 [2022-01-10 20:02:37,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:37,505 INFO L470 AbstractCegarLoop]: Abstraction has 5215 states and 6486 transitions. [2022-01-10 20:02:37,505 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-10 20:02:37,505 INFO L276 IsEmpty]: Start isEmpty. Operand 5215 states and 6486 transitions. [2022-01-10 20:02:37,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-01-10 20:02:37,508 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:37,508 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-10 20:02:37,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 20:02:37,508 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:37,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:37,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1023363636, now seen corresponding path program 1 times [2022-01-10 20:02:37,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:37,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452631274] [2022-01-10 20:02:37,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:37,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:37,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 20:02:37,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:37,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452631274] [2022-01-10 20:02:37,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452631274] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:37,552 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:37,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:37,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052097829] [2022-01-10 20:02:37,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:37,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:37,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:37,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:37,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:37,553 INFO L87 Difference]: Start difference. First operand 5215 states and 6486 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:37,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:37,973 INFO L93 Difference]: Finished difference Result 8491 states and 10565 transitions. [2022-01-10 20:02:37,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:37,974 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-10 20:02:37,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:37,990 INFO L225 Difference]: With dead ends: 8491 [2022-01-10 20:02:37,990 INFO L226 Difference]: Without dead ends: 5168 [2022-01-10 20:02:37,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:37,995 INFO L933 BasicCegarLoop]: 520 mSDtfsCounter, 396 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:37,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 640 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:38,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5168 states. [2022-01-10 20:02:38,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5168 to 5168. [2022-01-10 20:02:38,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5168 states, 5166 states have (on average 1.2450638792102207) internal successors, (6432), 5167 states have internal predecessors, (6432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:38,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5168 states to 5168 states and 6432 transitions. [2022-01-10 20:02:38,301 INFO L78 Accepts]: Start accepts. Automaton has 5168 states and 6432 transitions. Word has length 106 [2022-01-10 20:02:38,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:38,301 INFO L470 AbstractCegarLoop]: Abstraction has 5168 states and 6432 transitions. [2022-01-10 20:02:38,301 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-10 20:02:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 5168 states and 6432 transitions. [2022-01-10 20:02:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 20:02:38,304 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:38,304 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-10 20:02:38,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 20:02:38,304 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:38,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:38,304 INFO L85 PathProgramCache]: Analyzing trace with hash 18795464, now seen corresponding path program 1 times [2022-01-10 20:02:38,304 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:38,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781642819] [2022-01-10 20:02:38,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:38,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:38,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:38,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:38,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781642819] [2022-01-10 20:02:38,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781642819] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:38,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:38,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:38,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86698847] [2022-01-10 20:02:38,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:38,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:38,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:38,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:38,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:38,333 INFO L87 Difference]: Start difference. First operand 5168 states and 6432 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:38,777 INFO L93 Difference]: Finished difference Result 11086 states and 13773 transitions. [2022-01-10 20:02:38,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:38,778 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-10 20:02:38,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:38,786 INFO L225 Difference]: With dead ends: 11086 [2022-01-10 20:02:38,787 INFO L226 Difference]: Without dead ends: 7834 [2022-01-10 20:02:38,791 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:38,791 INFO L933 BasicCegarLoop]: 620 mSDtfsCounter, 373 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:38,791 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 1000 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:38,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7834 states. [2022-01-10 20:02:39,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7834 to 7832. [2022-01-10 20:02:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7832 states, 7830 states have (on average 1.2361430395913156) internal successors, (9679), 7831 states have internal predecessors, (9679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:39,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7832 states to 7832 states and 9679 transitions. [2022-01-10 20:02:39,228 INFO L78 Accepts]: Start accepts. Automaton has 7832 states and 9679 transitions. Word has length 107 [2022-01-10 20:02:39,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:39,228 INFO L470 AbstractCegarLoop]: Abstraction has 7832 states and 9679 transitions. [2022-01-10 20:02:39,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 7832 states and 9679 transitions. [2022-01-10 20:02:39,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-01-10 20:02:39,232 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:39,232 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:39,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 20:02:39,232 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:39,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:39,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1179939801, now seen corresponding path program 1 times [2022-01-10 20:02:39,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:39,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256616633] [2022-01-10 20:02:39,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:39,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:39,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 20:02:39,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:39,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256616633] [2022-01-10 20:02:39,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256616633] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:39,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:39,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:39,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816150819] [2022-01-10 20:02:39,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:39,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:39,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:39,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:39,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:39,266 INFO L87 Difference]: Start difference. First operand 7832 states and 9679 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:39,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:39,715 INFO L93 Difference]: Finished difference Result 13702 states and 16928 transitions. [2022-01-10 20:02:39,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:39,716 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-10 20:02:39,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:39,723 INFO L225 Difference]: With dead ends: 13702 [2022-01-10 20:02:39,723 INFO L226 Difference]: Without dead ends: 7786 [2022-01-10 20:02:39,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:39,729 INFO L933 BasicCegarLoop]: 519 mSDtfsCounter, 394 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:39,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 639 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:39,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7786 states. [2022-01-10 20:02:40,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7786 to 7786. [2022-01-10 20:02:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7786 states, 7784 states have (on average 1.2367677286742036) internal successors, (9627), 7785 states have internal predecessors, (9627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7786 states to 7786 states and 9627 transitions. [2022-01-10 20:02:40,241 INFO L78 Accepts]: Start accepts. Automaton has 7786 states and 9627 transitions. Word has length 107 [2022-01-10 20:02:40,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:40,242 INFO L470 AbstractCegarLoop]: Abstraction has 7786 states and 9627 transitions. [2022-01-10 20:02:40,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:40,242 INFO L276 IsEmpty]: Start isEmpty. Operand 7786 states and 9627 transitions. [2022-01-10 20:02:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-10 20:02:40,245 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:40,245 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-10 20:02:40,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 20:02:40,245 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:40,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:40,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1895121984, now seen corresponding path program 1 times [2022-01-10 20:02:40,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:40,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708550874] [2022-01-10 20:02:40,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:40,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:40,332 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:40,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708550874] [2022-01-10 20:02:40,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708550874] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:40,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:40,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:40,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432751156] [2022-01-10 20:02:40,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:40,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:40,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:40,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:40,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:40,334 INFO L87 Difference]: Start difference. First operand 7786 states and 9627 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:41,023 INFO L93 Difference]: Finished difference Result 18451 states and 22782 transitions. [2022-01-10 20:02:41,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:41,024 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-10 20:02:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:41,040 INFO L225 Difference]: With dead ends: 18451 [2022-01-10 20:02:41,040 INFO L226 Difference]: Without dead ends: 12581 [2022-01-10 20:02:41,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:41,049 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 378 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:41,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 966 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:41,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12581 states. [2022-01-10 20:02:41,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12581 to 12579. [2022-01-10 20:02:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12579 states, 12577 states have (on average 1.2305001192653255) internal successors, (15476), 12578 states have internal predecessors, (15476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:41,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12579 states to 12579 states and 15476 transitions. [2022-01-10 20:02:41,783 INFO L78 Accepts]: Start accepts. Automaton has 12579 states and 15476 transitions. Word has length 108 [2022-01-10 20:02:41,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:41,784 INFO L470 AbstractCegarLoop]: Abstraction has 12579 states and 15476 transitions. [2022-01-10 20:02:41,784 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-10 20:02:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 12579 states and 15476 transitions. [2022-01-10 20:02:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-10 20:02:41,788 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:41,788 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-10 20:02:41,788 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-10 20:02:41,788 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:41,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:41,788 INFO L85 PathProgramCache]: Analyzing trace with hash 696386719, now seen corresponding path program 1 times [2022-01-10 20:02:41,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:41,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135560731] [2022-01-10 20:02:41,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:41,789 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-10 20:02:41,806 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:41,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135560731] [2022-01-10 20:02:41,806 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135560731] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:41,807 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:41,807 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:41,807 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054379382] [2022-01-10 20:02:41,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:41,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:41,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:41,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:41,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:41,807 INFO L87 Difference]: Start difference. First operand 12579 states and 15476 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:42,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:42,550 INFO L93 Difference]: Finished difference Result 23197 states and 28525 transitions. [2022-01-10 20:02:42,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:42,550 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-10 20:02:42,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:42,564 INFO L225 Difference]: With dead ends: 23197 [2022-01-10 20:02:42,564 INFO L226 Difference]: Without dead ends: 12534 [2022-01-10 20:02:42,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:42,576 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 392 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:42,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 638 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:42,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12534 states. [2022-01-10 20:02:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12534 to 12534. [2022-01-10 20:02:43,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12534 states, 12532 states have (on average 1.2309288222151293) internal successors, (15426), 12533 states have internal predecessors, (15426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12534 states to 12534 states and 15426 transitions. [2022-01-10 20:02:43,470 INFO L78 Accepts]: Start accepts. Automaton has 12534 states and 15426 transitions. Word has length 108 [2022-01-10 20:02:43,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:43,470 INFO L470 AbstractCegarLoop]: Abstraction has 12534 states and 15426 transitions. [2022-01-10 20:02:43,470 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-10 20:02:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 12534 states and 15426 transitions. [2022-01-10 20:02:43,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-01-10 20:02:43,474 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:43,474 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-10 20:02:43,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-10 20:02:43,474 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:43,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:43,475 INFO L85 PathProgramCache]: Analyzing trace with hash 827617335, now seen corresponding path program 1 times [2022-01-10 20:02:43,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:43,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977671239] [2022-01-10 20:02:43,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:43,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:43,501 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:43,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:43,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977671239] [2022-01-10 20:02:43,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977671239] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:43,501 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:43,501 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:43,501 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266423746] [2022-01-10 20:02:43,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:43,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:43,502 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:43,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:43,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:43,502 INFO L87 Difference]: Start difference. First operand 12534 states and 15426 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:44,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:44,874 INFO L93 Difference]: Finished difference Result 32520 states and 39927 transitions. [2022-01-10 20:02:44,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:44,875 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-10 20:02:44,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:44,912 INFO L225 Difference]: With dead ends: 32520 [2022-01-10 20:02:44,912 INFO L226 Difference]: Without dead ends: 21902 [2022-01-10 20:02:44,930 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:44,931 INFO L933 BasicCegarLoop]: 847 mSDtfsCounter, 327 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:44,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 1345 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:44,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21902 states. [2022-01-10 20:02:46,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21902 to 21902. [2022-01-10 20:02:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21902 states, 21900 states have (on average 1.2156164383561643) internal successors, (26622), 21901 states have internal predecessors, (26622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21902 states to 21902 states and 26622 transitions. [2022-01-10 20:02:46,370 INFO L78 Accepts]: Start accepts. Automaton has 21902 states and 26622 transitions. Word has length 109 [2022-01-10 20:02:46,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:46,370 INFO L470 AbstractCegarLoop]: Abstraction has 21902 states and 26622 transitions. [2022-01-10 20:02:46,370 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-10 20:02:46,370 INFO L276 IsEmpty]: Start isEmpty. Operand 21902 states and 26622 transitions. [2022-01-10 20:02:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 20:02:46,376 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:46,376 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:46,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 20:02:46,376 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:46,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:46,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1600075552, now seen corresponding path program 1 times [2022-01-10 20:02:46,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:46,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226910594] [2022-01-10 20:02:46,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:46,377 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 20:02:46,405 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:46,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226910594] [2022-01-10 20:02:46,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226910594] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:46,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:46,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:46,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044389433] [2022-01-10 20:02:46,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:46,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:46,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:46,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:46,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:46,406 INFO L87 Difference]: Start difference. First operand 21902 states and 26622 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:47,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:47,903 INFO L93 Difference]: Finished difference Result 24079 states and 29423 transitions. [2022-01-10 20:02:47,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:47,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-01-10 20:02:47,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:47,927 INFO L225 Difference]: With dead ends: 24079 [2022-01-10 20:02:47,927 INFO L226 Difference]: Without dead ends: 22478 [2022-01-10 20:02:47,933 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:47,934 INFO L933 BasicCegarLoop]: 513 mSDtfsCounter, 477 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:47,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 534 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:47,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22478 states. [2022-01-10 20:02:49,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22478 to 22478. [2022-01-10 20:02:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22478 states, 22476 states have (on average 1.2159636946075814) internal successors, (27330), 22477 states have internal predecessors, (27330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22478 states to 22478 states and 27330 transitions. [2022-01-10 20:02:49,433 INFO L78 Accepts]: Start accepts. Automaton has 22478 states and 27330 transitions. Word has length 110 [2022-01-10 20:02:49,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:49,433 INFO L470 AbstractCegarLoop]: Abstraction has 22478 states and 27330 transitions. [2022-01-10 20:02:49,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:49,433 INFO L276 IsEmpty]: Start isEmpty. Operand 22478 states and 27330 transitions. [2022-01-10 20:02:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-10 20:02:49,439 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:49,440 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:49,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-10 20:02:49,440 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:49,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:49,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1840615681, now seen corresponding path program 1 times [2022-01-10 20:02:49,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:49,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904542675] [2022-01-10 20:02:49,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:49,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 20:02:49,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:49,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904542675] [2022-01-10 20:02:49,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904542675] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:49,471 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:49,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:49,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878619752] [2022-01-10 20:02:49,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:49,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:49,472 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:49,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:49,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:49,472 INFO L87 Difference]: Start difference. First operand 22478 states and 27330 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:50,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:50,669 INFO L93 Difference]: Finished difference Result 23241 states and 28275 transitions. [2022-01-10 20:02:50,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:50,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-01-10 20:02:50,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:50,694 INFO L225 Difference]: With dead ends: 23241 [2022-01-10 20:02:50,694 INFO L226 Difference]: Without dead ends: 21064 [2022-01-10 20:02:50,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:50,703 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 69 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:50,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 914 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:50,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21064 states. [2022-01-10 20:02:51,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21064 to 21064. [2022-01-10 20:02:51,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21064 states, 21062 states have (on average 1.211708289811034) internal successors, (25521), 21063 states have internal predecessors, (25521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21064 states to 21064 states and 25521 transitions. [2022-01-10 20:02:51,985 INFO L78 Accepts]: Start accepts. Automaton has 21064 states and 25521 transitions. Word has length 110 [2022-01-10 20:02:51,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:51,985 INFO L470 AbstractCegarLoop]: Abstraction has 21064 states and 25521 transitions. [2022-01-10 20:02:51,985 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:51,985 INFO L276 IsEmpty]: Start isEmpty. Operand 21064 states and 25521 transitions. [2022-01-10 20:02:51,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 20:02:51,990 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:51,990 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:51,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-10 20:02:51,991 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:51,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:51,991 INFO L85 PathProgramCache]: Analyzing trace with hash -877727385, now seen corresponding path program 1 times [2022-01-10 20:02:51,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:51,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005937862] [2022-01-10 20:02:51,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:51,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 20:02:52,019 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:52,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005937862] [2022-01-10 20:02:52,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005937862] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:52,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:52,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:52,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090514198] [2022-01-10 20:02:52,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:52,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:52,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:52,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:52,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:52,020 INFO L87 Difference]: Start difference. First operand 21064 states and 25521 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:53,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:53,281 INFO L93 Difference]: Finished difference Result 21836 states and 26465 transitions. [2022-01-10 20:02:53,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:53,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-01-10 20:02:53,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:53,309 INFO L225 Difference]: With dead ends: 21836 [2022-01-10 20:02:53,309 INFO L226 Difference]: Without dead ends: 21073 [2022-01-10 20:02:53,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:53,318 INFO L933 BasicCegarLoop]: 514 mSDtfsCounter, 60 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:53,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 918 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:53,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21073 states. [2022-01-10 20:02:54,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21073 to 21073. [2022-01-10 20:02:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21073 states, 21071 states have (on average 1.210953443120877) internal successors, (25516), 21072 states have internal predecessors, (25516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:54,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21073 states to 21073 states and 25516 transitions. [2022-01-10 20:02:54,597 INFO L78 Accepts]: Start accepts. Automaton has 21073 states and 25516 transitions. Word has length 113 [2022-01-10 20:02:54,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:54,598 INFO L470 AbstractCegarLoop]: Abstraction has 21073 states and 25516 transitions. [2022-01-10 20:02:54,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 21073 states and 25516 transitions. [2022-01-10 20:02:54,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-10 20:02:54,603 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:54,604 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 20:02:54,604 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-10 20:02:54,604 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:54,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:54,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1326424024, now seen corresponding path program 1 times [2022-01-10 20:02:54,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:54,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659870868] [2022-01-10 20:02:54,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:54,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 20:02:54,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:54,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659870868] [2022-01-10 20:02:54,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659870868] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:54,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:54,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:02:54,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587707942] [2022-01-10 20:02:54,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:54,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:54,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:54,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:54,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:54,633 INFO L87 Difference]: Start difference. First operand 21073 states and 25516 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:55,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:55,843 INFO L93 Difference]: Finished difference Result 21468 states and 25979 transitions. [2022-01-10 20:02:55,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:55,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-01-10 20:02:55,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:55,867 INFO L225 Difference]: With dead ends: 21468 [2022-01-10 20:02:55,867 INFO L226 Difference]: Without dead ends: 20040 [2022-01-10 20:02:55,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:55,877 INFO L933 BasicCegarLoop]: 511 mSDtfsCounter, 462 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:55,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [462 Valid, 529 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:55,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20040 states. [2022-01-10 20:02:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20040 to 20040. [2022-01-10 20:02:57,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20040 states, 20039 states have (on average 1.2128349718049802) internal successors, (24304), 20039 states have internal predecessors, (24304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20040 states to 20040 states and 24304 transitions. [2022-01-10 20:02:57,113 INFO L78 Accepts]: Start accepts. Automaton has 20040 states and 24304 transitions. Word has length 113 [2022-01-10 20:02:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:02:57,113 INFO L470 AbstractCegarLoop]: Abstraction has 20040 states and 24304 transitions. [2022-01-10 20:02:57,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 20040 states and 24304 transitions. [2022-01-10 20:02:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-01-10 20:02:57,123 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:02:57,123 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-10 20:02:57,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-10 20:02:57,123 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:02:57,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:02:57,124 INFO L85 PathProgramCache]: Analyzing trace with hash 90985971, now seen corresponding path program 1 times [2022-01-10 20:02:57,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:02:57,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292018577] [2022-01-10 20:02:57,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:02:57,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:02:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:02:57,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:02:57,154 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:02:57,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292018577] [2022-01-10 20:02:57,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292018577] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:02:57,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:02:57,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:02:57,154 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489089664] [2022-01-10 20:02:57,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:02:57,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:02:57,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:02:57,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:02:57,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:57,155 INFO L87 Difference]: Start difference. First operand 20040 states and 24304 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:02:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:02:58,898 INFO L93 Difference]: Finished difference Result 48774 states and 59094 transitions. [2022-01-10 20:02:58,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:02:58,899 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-10 20:02:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:02:58,934 INFO L225 Difference]: With dead ends: 48774 [2022-01-10 20:02:58,935 INFO L226 Difference]: Without dead ends: 28792 [2022-01-10 20:02:58,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:02:58,949 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 238 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:02:58,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [238 Valid, 715 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:02:58,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28792 states. [2022-01-10 20:03:00,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28792 to 28662. [2022-01-10 20:03:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28662 states, 28661 states have (on average 1.2037263179930917) internal successors, (34500), 28661 states have internal predecessors, (34500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28662 states to 28662 states and 34500 transitions. [2022-01-10 20:03:00,780 INFO L78 Accepts]: Start accepts. Automaton has 28662 states and 34500 transitions. Word has length 140 [2022-01-10 20:03:00,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:00,780 INFO L470 AbstractCegarLoop]: Abstraction has 28662 states and 34500 transitions. [2022-01-10 20:03:00,780 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-10 20:03:00,780 INFO L276 IsEmpty]: Start isEmpty. Operand 28662 states and 34500 transitions. [2022-01-10 20:03:00,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-01-10 20:03:00,796 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:00,796 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-10 20:03:00,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-10 20:03:00,796 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:03:00,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash 859589611, now seen corresponding path program 1 times [2022-01-10 20:03:00,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:00,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519544594] [2022-01-10 20:03:00,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:00,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:00,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 20:03:00,836 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:00,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519544594] [2022-01-10 20:03:00,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519544594] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:00,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:00,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 20:03:00,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352381722] [2022-01-10 20:03:00,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:00,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:00,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:00,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:00,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:00,837 INFO L87 Difference]: Start difference. First operand 28662 states and 34500 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 2 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:03,430 INFO L93 Difference]: Finished difference Result 69934 states and 84182 transitions. [2022-01-10 20:03:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:03,431 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-10 20:03:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:03,488 INFO L225 Difference]: With dead ends: 69934 [2022-01-10 20:03:03,489 INFO L226 Difference]: Without dead ends: 41342 [2022-01-10 20:03:03,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:03,510 INFO L933 BasicCegarLoop]: 389 mSDtfsCounter, 241 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:03,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 713 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:03,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41342 states. [2022-01-10 20:03:06,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41342 to 41148. [2022-01-10 20:03:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41148 states, 41147 states have (on average 1.196782268452135) internal successors, (49244), 41147 states have internal predecessors, (49244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41148 states to 41148 states and 49244 transitions. [2022-01-10 20:03:06,263 INFO L78 Accepts]: Start accepts. Automaton has 41148 states and 49244 transitions. Word has length 140 [2022-01-10 20:03:06,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:06,263 INFO L470 AbstractCegarLoop]: Abstraction has 41148 states and 49244 transitions. [2022-01-10 20:03:06,264 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-10 20:03:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 41148 states and 49244 transitions. [2022-01-10 20:03:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-10 20:03:06,283 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:06,284 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-10 20:03:06,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-10 20:03:06,284 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:03:06,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:06,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1075156264, now seen corresponding path program 1 times [2022-01-10 20:03:06,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:06,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585881712] [2022-01-10 20:03:06,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:06,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:06,309 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-10 20:03:06,309 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:06,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585881712] [2022-01-10 20:03:06,309 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585881712] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:06,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:06,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:06,310 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107038403] [2022-01-10 20:03:06,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:06,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:06,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:06,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:06,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:06,310 INFO L87 Difference]: Start difference. First operand 41148 states and 49244 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:09,236 INFO L93 Difference]: Finished difference Result 73592 states and 88113 transitions. [2022-01-10 20:03:09,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:09,237 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-10 20:03:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:09,296 INFO L225 Difference]: With dead ends: 73592 [2022-01-10 20:03:09,296 INFO L226 Difference]: Without dead ends: 42000 [2022-01-10 20:03:09,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:09,330 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 291 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:09,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 772 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:09,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42000 states. [2022-01-10 20:03:11,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42000 to 40428. [2022-01-10 20:03:11,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40428 states, 40427 states have (on average 1.1783214188537363) internal successors, (47636), 40427 states have internal predecessors, (47636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40428 states to 40428 states and 47636 transitions. [2022-01-10 20:03:12,036 INFO L78 Accepts]: Start accepts. Automaton has 40428 states and 47636 transitions. Word has length 157 [2022-01-10 20:03:12,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:12,036 INFO L470 AbstractCegarLoop]: Abstraction has 40428 states and 47636 transitions. [2022-01-10 20:03:12,036 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-10 20:03:12,037 INFO L276 IsEmpty]: Start isEmpty. Operand 40428 states and 47636 transitions. [2022-01-10 20:03:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-10 20:03:12,057 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:12,057 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-10 20:03:12,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-10 20:03:12,058 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:03:12,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:12,058 INFO L85 PathProgramCache]: Analyzing trace with hash -835496368, now seen corresponding path program 1 times [2022-01-10 20:03:12,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:12,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945060931] [2022-01-10 20:03:12,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:12,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-10 20:03:12,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:12,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945060931] [2022-01-10 20:03:12,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945060931] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:12,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:12,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:12,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135410480] [2022-01-10 20:03:12,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:12,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:12,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:12,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:12,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:12,089 INFO L87 Difference]: Start difference. First operand 40428 states and 47636 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:15,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:15,639 INFO L93 Difference]: Finished difference Result 80760 states and 95170 transitions. [2022-01-10 20:03:15,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:15,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2022-01-10 20:03:15,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:15,690 INFO L225 Difference]: With dead ends: 80760 [2022-01-10 20:03:15,691 INFO L226 Difference]: Without dead ends: 40430 [2022-01-10 20:03:15,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:15,720 INFO L933 BasicCegarLoop]: 657 mSDtfsCounter, 278 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:15,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 1021 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:15,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40430 states. [2022-01-10 20:03:18,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40430 to 40428. [2022-01-10 20:03:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40428 states, 40427 states have (on average 1.1694164790857595) internal successors, (47276), 40427 states have internal predecessors, (47276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40428 states to 40428 states and 47276 transitions. [2022-01-10 20:03:18,647 INFO L78 Accepts]: Start accepts. Automaton has 40428 states and 47276 transitions. Word has length 158 [2022-01-10 20:03:18,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:18,647 INFO L470 AbstractCegarLoop]: Abstraction has 40428 states and 47276 transitions. [2022-01-10 20:03:18,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 40428 states and 47276 transitions. [2022-01-10 20:03:18,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-10 20:03:18,711 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:18,712 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-10 20:03:18,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-10 20:03:18,712 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:03:18,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:18,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1855723407, now seen corresponding path program 1 times [2022-01-10 20:03:18,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:18,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615919547] [2022-01-10 20:03:18,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:18,713 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:18,783 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-10 20:03:18,783 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:18,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615919547] [2022-01-10 20:03:18,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615919547] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:18,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:18,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:18,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707718798] [2022-01-10 20:03:18,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:18,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:18,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:18,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:18,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:18,785 INFO L87 Difference]: Start difference. First operand 40428 states and 47276 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:21,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:21,847 INFO L93 Difference]: Finished difference Result 68584 states and 80462 transitions. [2022-01-10 20:03:21,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:21,847 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-10 20:03:21,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:21,906 INFO L225 Difference]: With dead ends: 68584 [2022-01-10 20:03:21,906 INFO L226 Difference]: Without dead ends: 40430 [2022-01-10 20:03:21,928 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:21,928 INFO L933 BasicCegarLoop]: 660 mSDtfsCounter, 277 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 1036 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.2s IncrementalHoareTripleChecker+Time [2022-01-10 20:03:21,928 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 1036 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 20:03:21,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40430 states. [2022-01-10 20:03:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40430 to 40428. [2022-01-10 20:03:24,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40428 states, 40427 states have (on average 1.1652608405273703) internal successors, (47108), 40427 states have internal predecessors, (47108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40428 states to 40428 states and 47108 transitions. [2022-01-10 20:03:24,711 INFO L78 Accepts]: Start accepts. Automaton has 40428 states and 47108 transitions. Word has length 158 [2022-01-10 20:03:24,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:24,711 INFO L470 AbstractCegarLoop]: Abstraction has 40428 states and 47108 transitions. [2022-01-10 20:03:24,711 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-10 20:03:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 40428 states and 47108 transitions. [2022-01-10 20:03:24,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-10 20:03:24,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:24,726 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-10 20:03:24,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-10 20:03:24,726 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:03:24,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:24,726 INFO L85 PathProgramCache]: Analyzing trace with hash -943869466, now seen corresponding path program 1 times [2022-01-10 20:03:24,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:24,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251273394] [2022-01-10 20:03:24,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:24,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:24,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:24,756 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-10 20:03:24,756 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:24,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251273394] [2022-01-10 20:03:24,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251273394] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:24,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:24,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:24,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948207371] [2022-01-10 20:03:24,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:24,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:24,757 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:24,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:24,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:24,757 INFO L87 Difference]: Start difference. First operand 40428 states and 47108 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-10 20:03:27,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:27,358 INFO L93 Difference]: Finished difference Result 63824 states and 74618 transitions. [2022-01-10 20:03:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:27,358 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-10 20:03:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:27,412 INFO L225 Difference]: With dead ends: 63824 [2022-01-10 20:03:27,412 INFO L226 Difference]: Without dead ends: 35742 [2022-01-10 20:03:27,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:27,434 INFO L933 BasicCegarLoop]: 667 mSDtfsCounter, 278 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1049 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-10 20:03:27,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 1049 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:27,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35742 states. [2022-01-10 20:03:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35742 to 35740. [2022-01-10 20:03:30,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35740 states, 35739 states have (on average 1.162203755001539) internal successors, (41536), 35739 states have internal predecessors, (41536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:30,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35740 states to 35740 states and 41536 transitions. [2022-01-10 20:03:30,196 INFO L78 Accepts]: Start accepts. Automaton has 35740 states and 41536 transitions. Word has length 158 [2022-01-10 20:03:30,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 20:03:30,198 INFO L470 AbstractCegarLoop]: Abstraction has 35740 states and 41536 transitions. [2022-01-10 20:03:30,199 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-10 20:03:30,199 INFO L276 IsEmpty]: Start isEmpty. Operand 35740 states and 41536 transitions. [2022-01-10 20:03:30,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-10 20:03:30,225 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 20:03:30,226 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-10 20:03:30,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-10 20:03:30,226 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 20:03:30,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 20:03:30,226 INFO L85 PathProgramCache]: Analyzing trace with hash -137839401, now seen corresponding path program 1 times [2022-01-10 20:03:30,226 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 20:03:30,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134670021] [2022-01-10 20:03:30,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 20:03:30,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 20:03:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 20:03:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-01-10 20:03:30,254 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 20:03:30,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134670021] [2022-01-10 20:03:30,255 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134670021] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 20:03:30,255 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 20:03:30,255 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 20:03:30,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214967795] [2022-01-10 20:03:30,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 20:03:30,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 20:03:30,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 20:03:30,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 20:03:30,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:30,256 INFO L87 Difference]: Start difference. First operand 35740 states and 41536 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 20:03:33,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 20:03:33,027 INFO L93 Difference]: Finished difference Result 56518 states and 65925 transitions. [2022-01-10 20:03:33,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 20:03:33,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2022-01-10 20:03:33,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 20:03:33,082 INFO L225 Difference]: With dead ends: 56518 [2022-01-10 20:03:33,082 INFO L226 Difference]: Without dead ends: 37396 [2022-01-10 20:03:33,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 20:03:33,102 INFO L933 BasicCegarLoop]: 591 mSDtfsCounter, 326 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 957 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-10 20:03:33,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 957 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 20:03:33,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37396 states.