/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 12:40:55,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 12:40:55,614 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 12:40:55,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 12:40:55,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 12:40:55,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 12:40:55,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 12:40:55,692 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 12:40:55,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 12:40:55,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 12:40:55,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 12:40:55,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 12:40:55,698 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 12:40:55,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 12:40:55,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 12:40:55,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 12:40:55,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 12:40:55,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 12:40:55,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 12:40:55,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 12:40:55,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 12:40:55,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 12:40:55,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 12:40:55,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 12:40:55,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 12:40:55,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 12:40:55,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 12:40:55,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 12:40:55,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 12:40:55,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 12:40:55,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 12:40:55,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 12:40:55,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 12:40:55,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 12:40:55,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 12:40:55,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 12:40:55,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 12:40:55,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 12:40:55,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 12:40:55,725 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 12:40:55,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 12:40:55,726 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 12:40:55,750 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 12:40:55,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 12:40:55,751 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 12:40:55,751 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 12:40:55,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 12:40:55,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 12:40:55,752 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 12:40:55,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 12:40:55,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 12:40:55,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 12:40:55,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 12:40:55,753 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 12:40:55,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 12:40:55,754 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 12:40:55,754 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 12:40:55,754 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 12:40:55,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 12:40:55,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 12:40:55,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 12:40:55,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 12:40:55,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 12:40:55,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:40:55,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 12:40:55,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 12:40:55,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 12:40:55,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 12:40:55,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 12:40:55,756 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 12:40:55,756 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 12:40:55,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 12:40:55,756 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 12:40:55,756 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 12:40:55,757 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 12:40:55,757 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 12:40:55,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 12:40:55,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 12:40:55,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 12:40:55,920 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 12:40:55,921 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 12:40:55,922 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2022-01-10 12:40:55,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7982a7d10/32b9f5f9d35f4ae4885df6679b5332ae/FLAG09917acea [2022-01-10 12:40:56,333 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 12:40:56,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c [2022-01-10 12:40:56,342 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7982a7d10/32b9f5f9d35f4ae4885df6679b5332ae/FLAG09917acea [2022-01-10 12:40:56,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7982a7d10/32b9f5f9d35f4ae4885df6679b5332ae [2022-01-10 12:40:56,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 12:40:56,355 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 12:40:56,363 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 12:40:56,363 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 12:40:56,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 12:40:56,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:40:56" (1/1) ... [2022-01-10 12:40:56,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7805bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:56, skipping insertion in model container [2022-01-10 12:40:56,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:40:56" (1/1) ... [2022-01-10 12:40:56,371 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 12:40:56,388 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 12:40:56,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c[11857,11870] [2022-01-10 12:40:56,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:40:56,556 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 12:40:56,601 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.c[11857,11870] [2022-01-10 12:40:56,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 12:40:56,620 INFO L208 MainTranslator]: Completed translation [2022-01-10 12:40:56,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:56 WrapperNode [2022-01-10 12:40:56,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 12:40:56,622 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 12:40:56,622 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 12:40:56,622 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 12:40:56,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:56" (1/1) ... [2022-01-10 12:40:56,642 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:56" (1/1) ... [2022-01-10 12:40:56,686 INFO L137 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 41, calls inlined = 84, statements flattened = 1569 [2022-01-10 12:40:56,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 12:40:56,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 12:40:56,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 12:40:56,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 12:40:56,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:56" (1/1) ... [2022-01-10 12:40:56,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:56" (1/1) ... [2022-01-10 12:40:56,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:56" (1/1) ... [2022-01-10 12:40:56,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:56" (1/1) ... [2022-01-10 12:40:56,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:56" (1/1) ... [2022-01-10 12:40:56,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:56" (1/1) ... [2022-01-10 12:40:56,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:56" (1/1) ... [2022-01-10 12:40:56,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 12:40:56,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 12:40:56,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 12:40:56,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 12:40:56,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:56" (1/1) ... [2022-01-10 12:40:56,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 12:40:56,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:40:56,800 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 12:40:56,801 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 12:40:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 12:40:56,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 12:40:56,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 12:40:56,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 12:40:56,909 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 12:40:56,910 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 12:40:57,695 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 12:40:57,711 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 12:40:57,712 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 12:40:57,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:40:57 BoogieIcfgContainer [2022-01-10 12:40:57,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 12:40:57,716 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 12:40:57,716 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 12:40:57,717 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 12:40:57,719 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:40:57" (1/1) ... [2022-01-10 12:40:58,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:40:58 BasicIcfg [2022-01-10 12:40:58,057 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 12:40:58,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 12:40:58,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 12:40:58,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 12:40:58,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:40:56" (1/4) ... [2022-01-10 12:40:58,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af10860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:40:58, skipping insertion in model container [2022-01-10 12:40:58,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:40:56" (2/4) ... [2022-01-10 12:40:58,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af10860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:40:58, skipping insertion in model container [2022-01-10 12:40:58,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:40:57" (3/4) ... [2022-01-10 12:40:58,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af10860 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:40:58, skipping insertion in model container [2022-01-10 12:40:58,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 12:40:58" (4/4) ... [2022-01-10 12:40:58,062 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.2.ufo.BOUNDED-10.pals.cTransformedIcfg [2022-01-10 12:40:58,067 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 12:40:58,067 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2022-01-10 12:40:58,112 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 12:40:58,121 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 12:40:58,121 INFO L340 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2022-01-10 12:40:58,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 526 states, 488 states have (on average 1.7868852459016393) internal successors, (872), 525 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:58,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 12:40:58,147 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:58,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:40:58,148 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:40:58,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:58,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1882271033, now seen corresponding path program 1 times [2022-01-10 12:40:58,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:58,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792072021] [2022-01-10 12:40:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:58,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:58,382 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 12:40:58,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:58,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792072021] [2022-01-10 12:40:58,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792072021] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:58,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:58,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:40:58,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732991065] [2022-01-10 12:40:58,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:58,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:40:58,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:58,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:40:58,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:40:58,407 INFO L87 Difference]: Start difference. First operand has 526 states, 488 states have (on average 1.7868852459016393) internal successors, (872), 525 states have internal predecessors, (872), 0 states have call successors, (0), 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 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:58,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:58,587 INFO L93 Difference]: Finished difference Result 1268 states and 2078 transitions. [2022-01-10 12:40:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:40:58,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-01-10 12:40:58,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:58,604 INFO L225 Difference]: With dead ends: 1268 [2022-01-10 12:40:58,604 INFO L226 Difference]: Without dead ends: 736 [2022-01-10 12:40:58,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:40:58,615 INFO L933 BasicCegarLoop]: 947 mSDtfsCounter, 484 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:58,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [484 Valid, 1483 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:40:58,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2022-01-10 12:40:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 462. [2022-01-10 12:40:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 431 states have (on average 1.6612529002320187) internal successors, (716), 461 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 716 transitions. [2022-01-10 12:40:58,685 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 716 transitions. Word has length 9 [2022-01-10 12:40:58,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:58,686 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 716 transitions. [2022-01-10 12:40:58,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:58,687 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 716 transitions. [2022-01-10 12:40:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-10 12:40:58,687 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:58,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:40:58,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 12:40:58,688 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:40:58,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:58,690 INFO L85 PathProgramCache]: Analyzing trace with hash -861030910, now seen corresponding path program 1 times [2022-01-10 12:40:58,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:58,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500814852] [2022-01-10 12:40:58,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:58,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:58,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 12:40:58,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:58,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500814852] [2022-01-10 12:40:58,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500814852] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:58,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:58,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:40:58,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371308707] [2022-01-10 12:40:58,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:58,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:40:58,804 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:58,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:40:58,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:40:58,805 INFO L87 Difference]: Start difference. First operand 462 states and 716 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:58,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:58,862 INFO L93 Difference]: Finished difference Result 1146 states and 1758 transitions. [2022-01-10 12:40:58,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:40:58,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-01-10 12:40:58,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:58,865 INFO L225 Difference]: With dead ends: 1146 [2022-01-10 12:40:58,865 INFO L226 Difference]: Without dead ends: 686 [2022-01-10 12:40:58,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:40:58,871 INFO L933 BasicCegarLoop]: 666 mSDtfsCounter, 427 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:58,871 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [427 Valid, 1245 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:58,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-01-10 12:40:58,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 429. [2022-01-10 12:40:58,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 401 states have (on average 1.6408977556109725) internal successors, (658), 428 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 658 transitions. [2022-01-10 12:40:58,889 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 658 transitions. Word has length 10 [2022-01-10 12:40:58,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:58,890 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 658 transitions. [2022-01-10 12:40:58,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 658 transitions. [2022-01-10 12:40:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 12:40:58,892 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:58,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:40:58,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 12:40:58,895 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:40:58,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:58,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2004267966, now seen corresponding path program 1 times [2022-01-10 12:40:58,898 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:58,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454201059] [2022-01-10 12:40:58,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:58,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:58,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 12:40:58,951 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:58,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454201059] [2022-01-10 12:40:58,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454201059] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:58,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:58,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:40:58,952 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688563946] [2022-01-10 12:40:58,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:58,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:40:58,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:58,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:40:58,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:40:58,953 INFO L87 Difference]: Start difference. First operand 429 states and 658 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:59,071 INFO L93 Difference]: Finished difference Result 1289 states and 1941 transitions. [2022-01-10 12:40:59,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:40:59,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-01-10 12:40:59,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:59,076 INFO L225 Difference]: With dead ends: 1289 [2022-01-10 12:40:59,076 INFO L226 Difference]: Without dead ends: 873 [2022-01-10 12:40:59,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:40:59,082 INFO L933 BasicCegarLoop]: 1111 mSDtfsCounter, 882 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:59,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [882 Valid, 1910 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:40:59,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-01-10 12:40:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 384. [2022-01-10 12:40:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 361 states have (on average 1.6011080332409973) internal successors, (578), 383 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 578 transitions. [2022-01-10 12:40:59,095 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 578 transitions. Word has length 14 [2022-01-10 12:40:59,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:59,095 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 578 transitions. [2022-01-10 12:40:59,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,095 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 578 transitions. [2022-01-10 12:40:59,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 12:40:59,098 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:59,098 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:40:59,098 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 12:40:59,099 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:40:59,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:59,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1973696279, now seen corresponding path program 1 times [2022-01-10 12:40:59,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:59,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316619020] [2022-01-10 12:40:59,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:59,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:59,168 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 12:40:59,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:59,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316619020] [2022-01-10 12:40:59,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316619020] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:59,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:59,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:40:59,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656544599] [2022-01-10 12:40:59,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:59,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:40:59,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:59,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:40:59,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:40:59,171 INFO L87 Difference]: Start difference. First operand 384 states and 578 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:59,227 INFO L93 Difference]: Finished difference Result 1201 states and 1790 transitions. [2022-01-10 12:40:59,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:40:59,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-01-10 12:40:59,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:59,230 INFO L225 Difference]: With dead ends: 1201 [2022-01-10 12:40:59,230 INFO L226 Difference]: Without dead ends: 830 [2022-01-10 12:40:59,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:40:59,235 INFO L933 BasicCegarLoop]: 877 mSDtfsCounter, 805 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:59,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [805 Valid, 1686 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:59,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2022-01-10 12:40:59,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 358. [2022-01-10 12:40:59,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 337 states have (on average 1.5786350148367954) internal successors, (532), 357 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 532 transitions. [2022-01-10 12:40:59,246 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 532 transitions. Word has length 14 [2022-01-10 12:40:59,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:59,246 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 532 transitions. [2022-01-10 12:40:59,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 532 transitions. [2022-01-10 12:40:59,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 12:40:59,248 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:59,248 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:40:59,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 12:40:59,248 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:40:59,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:59,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1109879498, now seen corresponding path program 1 times [2022-01-10 12:40:59,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:59,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852018508] [2022-01-10 12:40:59,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:59,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:59,292 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 12:40:59,293 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:59,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852018508] [2022-01-10 12:40:59,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852018508] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:59,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:59,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:40:59,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847831606] [2022-01-10 12:40:59,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:59,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:40:59,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:59,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:40:59,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:40:59,294 INFO L87 Difference]: Start difference. First operand 358 states and 532 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:59,343 INFO L93 Difference]: Finished difference Result 1056 states and 1558 transitions. [2022-01-10 12:40:59,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:40:59,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-01-10 12:40:59,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:59,346 INFO L225 Difference]: With dead ends: 1056 [2022-01-10 12:40:59,346 INFO L226 Difference]: Without dead ends: 826 [2022-01-10 12:40:59,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:40:59,347 INFO L933 BasicCegarLoop]: 847 mSDtfsCounter, 1189 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 2029 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:59,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1189 Valid, 2029 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:59,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-01-10 12:40:59,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 360. [2022-01-10 12:40:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 339 states have (on average 1.575221238938053) internal successors, (534), 359 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 534 transitions. [2022-01-10 12:40:59,356 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 534 transitions. Word has length 15 [2022-01-10 12:40:59,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:59,357 INFO L470 AbstractCegarLoop]: Abstraction has 360 states and 534 transitions. [2022-01-10 12:40:59,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,359 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 534 transitions. [2022-01-10 12:40:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 12:40:59,360 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:59,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:40:59,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 12:40:59,361 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:40:59,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:59,361 INFO L85 PathProgramCache]: Analyzing trace with hash 641715079, now seen corresponding path program 1 times [2022-01-10 12:40:59,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:59,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096636782] [2022-01-10 12:40:59,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:59,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:59,426 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 12:40:59,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:59,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096636782] [2022-01-10 12:40:59,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096636782] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:59,426 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:59,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:40:59,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941002504] [2022-01-10 12:40:59,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:59,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:40:59,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:59,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:40:59,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:40:59,427 INFO L87 Difference]: Start difference. First operand 360 states and 534 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:59,499 INFO L93 Difference]: Finished difference Result 1368 states and 2024 transitions. [2022-01-10 12:40:59,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:40:59,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-01-10 12:40:59,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:59,502 INFO L225 Difference]: With dead ends: 1368 [2022-01-10 12:40:59,502 INFO L226 Difference]: Without dead ends: 1036 [2022-01-10 12:40:59,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:40:59,503 INFO L933 BasicCegarLoop]: 1170 mSDtfsCounter, 1205 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1205 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:59,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1205 Valid, 2286 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:59,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2022-01-10 12:40:59,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 337. [2022-01-10 12:40:59,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 317 states have (on average 1.5646687697160884) internal successors, (496), 336 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 496 transitions. [2022-01-10 12:40:59,512 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 496 transitions. Word has length 18 [2022-01-10 12:40:59,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:59,512 INFO L470 AbstractCegarLoop]: Abstraction has 337 states and 496 transitions. [2022-01-10 12:40:59,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 496 transitions. [2022-01-10 12:40:59,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 12:40:59,513 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:59,513 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:40:59,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 12:40:59,513 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:40:59,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:59,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1150250820, now seen corresponding path program 1 times [2022-01-10 12:40:59,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:59,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268584157] [2022-01-10 12:40:59,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:59,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:59,542 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 12:40:59,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:59,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268584157] [2022-01-10 12:40:59,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268584157] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:59,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:59,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:40:59,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983659692] [2022-01-10 12:40:59,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:59,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:40:59,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:59,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:40:59,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:40:59,543 INFO L87 Difference]: Start difference. First operand 337 states and 496 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:59,571 INFO L93 Difference]: Finished difference Result 794 states and 1169 transitions. [2022-01-10 12:40:59,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:40:59,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-01-10 12:40:59,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:59,573 INFO L225 Difference]: With dead ends: 794 [2022-01-10 12:40:59,573 INFO L226 Difference]: Without dead ends: 564 [2022-01-10 12:40:59,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:40:59,574 INFO L933 BasicCegarLoop]: 476 mSDtfsCounter, 335 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:59,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 1419 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:59,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-01-10 12:40:59,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 335. [2022-01-10 12:40:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 315 states have (on average 1.5555555555555556) internal successors, (490), 334 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 490 transitions. [2022-01-10 12:40:59,582 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 490 transitions. Word has length 19 [2022-01-10 12:40:59,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:59,582 INFO L470 AbstractCegarLoop]: Abstraction has 335 states and 490 transitions. [2022-01-10 12:40:59,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 490 transitions. [2022-01-10 12:40:59,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 12:40:59,583 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:59,583 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:40:59,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 12:40:59,583 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:40:59,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:59,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1611281826, now seen corresponding path program 1 times [2022-01-10 12:40:59,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:59,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526629527] [2022-01-10 12:40:59,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:59,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:59,620 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 12:40:59,620 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:59,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526629527] [2022-01-10 12:40:59,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526629527] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:59,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:59,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:40:59,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418893649] [2022-01-10 12:40:59,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:59,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:40:59,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:59,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:40:59,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:40:59,622 INFO L87 Difference]: Start difference. First operand 335 states and 490 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:59,693 INFO L93 Difference]: Finished difference Result 1074 states and 1546 transitions. [2022-01-10 12:40:59,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:40:59,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-01-10 12:40:59,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:59,696 INFO L225 Difference]: With dead ends: 1074 [2022-01-10 12:40:59,696 INFO L226 Difference]: Without dead ends: 765 [2022-01-10 12:40:59,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:40:59,697 INFO L933 BasicCegarLoop]: 1039 mSDtfsCounter, 1088 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:59,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1088 Valid, 1734 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:59,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2022-01-10 12:40:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 303. [2022-01-10 12:40:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 287 states have (on average 1.4982578397212543) internal successors, (430), 302 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 430 transitions. [2022-01-10 12:40:59,706 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 430 transitions. Word has length 19 [2022-01-10 12:40:59,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:59,706 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 430 transitions. [2022-01-10 12:40:59,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 430 transitions. [2022-01-10 12:40:59,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 12:40:59,707 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:59,707 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] [2022-01-10 12:40:59,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 12:40:59,707 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:40:59,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:59,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1430103387, now seen corresponding path program 1 times [2022-01-10 12:40:59,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:59,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886077227] [2022-01-10 12:40:59,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:59,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:59,744 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 12:40:59,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:59,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886077227] [2022-01-10 12:40:59,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886077227] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:59,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:59,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:40:59,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178709047] [2022-01-10 12:40:59,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:59,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:40:59,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:59,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:40:59,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:40:59,746 INFO L87 Difference]: Start difference. First operand 303 states and 430 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:59,779 INFO L93 Difference]: Finished difference Result 665 states and 968 transitions. [2022-01-10 12:40:59,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:40:59,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2022-01-10 12:40:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:59,781 INFO L225 Difference]: With dead ends: 665 [2022-01-10 12:40:59,781 INFO L226 Difference]: Without dead ends: 403 [2022-01-10 12:40:59,781 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 12:40:59,783 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 302 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:59,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 777 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:59,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-01-10 12:40:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 263. [2022-01-10 12:40:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 257 states have (on average 1.4785992217898833) internal successors, (380), 262 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 380 transitions. [2022-01-10 12:40:59,792 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 380 transitions. Word has length 22 [2022-01-10 12:40:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:59,792 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 380 transitions. [2022-01-10 12:40:59,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 380 transitions. [2022-01-10 12:40:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 12:40:59,793 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:59,793 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] [2022-01-10 12:40:59,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 12:40:59,793 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:40:59,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:59,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1399770013, now seen corresponding path program 1 times [2022-01-10 12:40:59,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:59,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526108272] [2022-01-10 12:40:59,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:59,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:59,835 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 12:40:59,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:59,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526108272] [2022-01-10 12:40:59,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526108272] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:59,835 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:59,835 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:40:59,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358599010] [2022-01-10 12:40:59,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:59,836 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:40:59,836 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:59,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:40:59,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:40:59,836 INFO L87 Difference]: Start difference. First operand 263 states and 380 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:59,861 INFO L93 Difference]: Finished difference Result 575 states and 846 transitions. [2022-01-10 12:40:59,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:40:59,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-01-10 12:40:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:59,864 INFO L225 Difference]: With dead ends: 575 [2022-01-10 12:40:59,864 INFO L226 Difference]: Without dead ends: 400 [2022-01-10 12:40:59,864 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:40:59,864 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 228 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:59,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 681 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:59,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-01-10 12:40:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 257. [2022-01-10 12:40:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.4722222222222223) internal successors, (371), 256 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 371 transitions. [2022-01-10 12:40:59,874 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 371 transitions. Word has length 27 [2022-01-10 12:40:59,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:40:59,874 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 371 transitions. [2022-01-10 12:40:59,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 371 transitions. [2022-01-10 12:40:59,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-10 12:40:59,875 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:40:59,876 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] [2022-01-10 12:40:59,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 12:40:59,876 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:40:59,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:40:59,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1686382236, now seen corresponding path program 1 times [2022-01-10 12:40:59,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:40:59,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982032313] [2022-01-10 12:40:59,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:40:59,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:40:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:40:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 12:40:59,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:40:59,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982032313] [2022-01-10 12:40:59,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982032313] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:40:59,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:40:59,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:40:59,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200870093] [2022-01-10 12:40:59,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:40:59,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:40:59,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:40:59,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:40:59,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:40:59,933 INFO L87 Difference]: Start difference. First operand 257 states and 371 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:40:59,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:40:59,984 INFO L93 Difference]: Finished difference Result 685 states and 1012 transitions. [2022-01-10 12:40:59,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:40:59,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-01-10 12:40:59,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:40:59,987 INFO L225 Difference]: With dead ends: 685 [2022-01-10 12:40:59,987 INFO L226 Difference]: Without dead ends: 516 [2022-01-10 12:40:59,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:40:59,988 INFO L933 BasicCegarLoop]: 544 mSDtfsCounter, 443 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:40:59,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 1062 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:40:59,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-01-10 12:41:00,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 252. [2022-01-10 12:41:00,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 248 states have (on average 1.4637096774193548) internal successors, (363), 251 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:00,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 363 transitions. [2022-01-10 12:41:00,001 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 363 transitions. Word has length 33 [2022-01-10 12:41:00,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:00,002 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 363 transitions. [2022-01-10 12:41:00,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:00,002 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 363 transitions. [2022-01-10 12:41:00,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 12:41:00,004 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:00,004 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] [2022-01-10 12:41:00,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 12:41:00,004 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:00,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:00,004 INFO L85 PathProgramCache]: Analyzing trace with hash 337909710, now seen corresponding path program 1 times [2022-01-10 12:41:00,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:00,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775190492] [2022-01-10 12:41:00,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:00,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:00,073 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 12:41:00,074 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:00,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775190492] [2022-01-10 12:41:00,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775190492] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:00,074 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:00,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:41:00,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181136686] [2022-01-10 12:41:00,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:00,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:41:00,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:00,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:41:00,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:41:00,075 INFO L87 Difference]: Start difference. First operand 252 states and 363 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:00,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:00,106 INFO L93 Difference]: Finished difference Result 413 states and 603 transitions. [2022-01-10 12:41:00,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:41:00,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2022-01-10 12:41:00,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:00,107 INFO L225 Difference]: With dead ends: 413 [2022-01-10 12:41:00,107 INFO L226 Difference]: Without dead ends: 249 [2022-01-10 12:41:00,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:41:00,109 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 450 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:00,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [450 Valid, 486 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:00,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-01-10 12:41:00,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 248. [2022-01-10 12:41:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 245 states have (on average 1.453061224489796) internal successors, (356), 247 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 356 transitions. [2022-01-10 12:41:00,121 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 356 transitions. Word has length 40 [2022-01-10 12:41:00,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:00,122 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 356 transitions. [2022-01-10 12:41:00,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:00,122 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 356 transitions. [2022-01-10 12:41:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 12:41:00,123 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:00,124 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] [2022-01-10 12:41:00,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 12:41:00,124 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:00,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:00,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1843900697, now seen corresponding path program 1 times [2022-01-10 12:41:00,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:00,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518337566] [2022-01-10 12:41:00,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:00,125 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:00,209 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 12:41:00,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:00,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518337566] [2022-01-10 12:41:00,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518337566] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:00,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:00,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:41:00,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845759618] [2022-01-10 12:41:00,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:00,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:41:00,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:00,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:41:00,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:41:00,212 INFO L87 Difference]: Start difference. First operand 248 states and 356 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:00,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:00,229 INFO L93 Difference]: Finished difference Result 456 states and 662 transitions. [2022-01-10 12:41:00,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:41:00,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2022-01-10 12:41:00,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:00,231 INFO L225 Difference]: With dead ends: 456 [2022-01-10 12:41:00,231 INFO L226 Difference]: Without dead ends: 296 [2022-01-10 12:41:00,231 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 12:41:00,232 INFO L933 BasicCegarLoop]: 409 mSDtfsCounter, 230 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:00,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 587 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:00,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-01-10 12:41:00,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 244. [2022-01-10 12:41:00,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 242 states have (on average 1.4504132231404958) internal successors, (351), 243 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:00,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 351 transitions. [2022-01-10 12:41:00,244 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 351 transitions. Word has length 49 [2022-01-10 12:41:00,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:00,245 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 351 transitions. [2022-01-10 12:41:00,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:00,245 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 351 transitions. [2022-01-10 12:41:00,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-10 12:41:00,245 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:00,245 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] [2022-01-10 12:41:00,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 12:41:00,246 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:00,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:00,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1991470110, now seen corresponding path program 1 times [2022-01-10 12:41:00,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:00,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543329224] [2022-01-10 12:41:00,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:00,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:00,342 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 12:41:00,342 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:00,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543329224] [2022-01-10 12:41:00,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543329224] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:00,342 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:00,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:41:00,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464119653] [2022-01-10 12:41:00,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:00,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:41:00,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:00,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:41:00,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:41:00,344 INFO L87 Difference]: Start difference. First operand 244 states and 351 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:00,638 INFO L93 Difference]: Finished difference Result 682 states and 996 transitions. [2022-01-10 12:41:00,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:41:00,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-01-10 12:41:00,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:00,641 INFO L225 Difference]: With dead ends: 682 [2022-01-10 12:41:00,641 INFO L226 Difference]: Without dead ends: 526 [2022-01-10 12:41:00,641 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 12:41:00,641 INFO L933 BasicCegarLoop]: 507 mSDtfsCounter, 630 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1284 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:00,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 1284 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 12:41:00,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-01-10 12:41:00,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 284. [2022-01-10 12:41:00,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.4487632508833923) internal successors, (410), 283 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:00,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 410 transitions. [2022-01-10 12:41:00,666 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 410 transitions. Word has length 50 [2022-01-10 12:41:00,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:00,667 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 410 transitions. [2022-01-10 12:41:00,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:00,667 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 410 transitions. [2022-01-10 12:41:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-10 12:41:00,667 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:00,668 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:00,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 12:41:00,668 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:00,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:00,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1597435453, now seen corresponding path program 1 times [2022-01-10 12:41:00,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:00,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713702195] [2022-01-10 12:41:00,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:00,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:00,716 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 12:41:00,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:00,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713702195] [2022-01-10 12:41:00,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713702195] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:00,716 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:00,716 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:41:00,716 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419633640] [2022-01-10 12:41:00,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:00,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:41:00,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:00,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:41:00,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:41:00,717 INFO L87 Difference]: Start difference. First operand 284 states and 410 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:00,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:00,778 INFO L93 Difference]: Finished difference Result 661 states and 966 transitions. [2022-01-10 12:41:00,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:41:00,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2022-01-10 12:41:00,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:00,780 INFO L225 Difference]: With dead ends: 661 [2022-01-10 12:41:00,780 INFO L226 Difference]: Without dead ends: 465 [2022-01-10 12:41:00,782 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 12:41:00,784 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 184 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:00,784 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 645 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:00,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-01-10 12:41:00,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 328. [2022-01-10 12:41:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 1.4342507645259939) internal successors, (469), 327 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 469 transitions. [2022-01-10 12:41:00,813 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 469 transitions. Word has length 70 [2022-01-10 12:41:00,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:00,813 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 469 transitions. [2022-01-10 12:41:00,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 469 transitions. [2022-01-10 12:41:00,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-10 12:41:00,814 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:00,814 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:00,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 12:41:00,814 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:00,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:00,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1316997024, now seen corresponding path program 1 times [2022-01-10 12:41:00,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:00,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008907204] [2022-01-10 12:41:00,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:00,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:00,876 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 12:41:00,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:00,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008907204] [2022-01-10 12:41:00,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008907204] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:00,876 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:00,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:41:00,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978068765] [2022-01-10 12:41:00,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:00,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:41:00,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:00,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:41:00,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:41:00,877 INFO L87 Difference]: Start difference. First operand 328 states and 469 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:00,931 INFO L93 Difference]: Finished difference Result 782 states and 1129 transitions. [2022-01-10 12:41:00,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:41:00,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2022-01-10 12:41:00,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:00,933 INFO L225 Difference]: With dead ends: 782 [2022-01-10 12:41:00,933 INFO L226 Difference]: Without dead ends: 542 [2022-01-10 12:41:00,934 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 12:41:00,934 INFO L933 BasicCegarLoop]: 346 mSDtfsCounter, 189 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:00,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 664 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-01-10 12:41:00,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 392. [2022-01-10 12:41:00,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 1.4194373401534526) internal successors, (555), 391 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:00,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 555 transitions. [2022-01-10 12:41:00,966 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 555 transitions. Word has length 71 [2022-01-10 12:41:00,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:00,966 INFO L470 AbstractCegarLoop]: Abstraction has 392 states and 555 transitions. [2022-01-10 12:41:00,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:00,966 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 555 transitions. [2022-01-10 12:41:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 12:41:00,967 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:00,967 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:00,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-10 12:41:00,967 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:00,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:00,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2104143334, now seen corresponding path program 1 times [2022-01-10 12:41:00,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:00,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74747615] [2022-01-10 12:41:00,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:00,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:01,013 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 12:41:01,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:01,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74747615] [2022-01-10 12:41:01,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74747615] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:01,013 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:01,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:41:01,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923598528] [2022-01-10 12:41:01,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:01,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:41:01,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:01,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:41:01,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:41:01,014 INFO L87 Difference]: Start difference. First operand 392 states and 555 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:01,074 INFO L93 Difference]: Finished difference Result 948 states and 1353 transitions. [2022-01-10 12:41:01,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:41:01,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-01-10 12:41:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:01,076 INFO L225 Difference]: With dead ends: 948 [2022-01-10 12:41:01,076 INFO L226 Difference]: Without dead ends: 644 [2022-01-10 12:41:01,077 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 12:41:01,077 INFO L933 BasicCegarLoop]: 364 mSDtfsCounter, 195 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:01,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 684 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2022-01-10 12:41:01,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 466. [2022-01-10 12:41:01,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 1.4086021505376345) internal successors, (655), 465 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:01,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 655 transitions. [2022-01-10 12:41:01,134 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 655 transitions. Word has length 72 [2022-01-10 12:41:01,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:01,134 INFO L470 AbstractCegarLoop]: Abstraction has 466 states and 655 transitions. [2022-01-10 12:41:01,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:01,134 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 655 transitions. [2022-01-10 12:41:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 12:41:01,135 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:01,135 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:01,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-10 12:41:01,136 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:01,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:01,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1979473049, now seen corresponding path program 1 times [2022-01-10 12:41:01,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:01,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614625346] [2022-01-10 12:41:01,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:01,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:01,175 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 12:41:01,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:01,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614625346] [2022-01-10 12:41:01,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614625346] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:01,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:01,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:41:01,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316788688] [2022-01-10 12:41:01,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:01,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:41:01,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:01,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:41:01,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:41:01,177 INFO L87 Difference]: Start difference. First operand 466 states and 655 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:01,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:01,213 INFO L93 Difference]: Finished difference Result 846 states and 1192 transitions. [2022-01-10 12:41:01,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:41:01,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-01-10 12:41:01,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:01,215 INFO L225 Difference]: With dead ends: 846 [2022-01-10 12:41:01,215 INFO L226 Difference]: Without dead ends: 443 [2022-01-10 12:41:01,215 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 12:41:01,215 INFO L933 BasicCegarLoop]: 329 mSDtfsCounter, 0 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:01,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 652 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:01,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-01-10 12:41:01,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2022-01-10 12:41:01,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.4027149321266967) internal successors, (620), 442 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:01,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 620 transitions. [2022-01-10 12:41:01,253 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 620 transitions. Word has length 72 [2022-01-10 12:41:01,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:01,253 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 620 transitions. [2022-01-10 12:41:01,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 620 transitions. [2022-01-10 12:41:01,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 12:41:01,257 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:01,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:01,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-10 12:41:01,257 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:01,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:01,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1116397571, now seen corresponding path program 1 times [2022-01-10 12:41:01,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:01,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426310583] [2022-01-10 12:41:01,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:01,258 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:01,307 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 12:41:01,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:01,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426310583] [2022-01-10 12:41:01,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426310583] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:01,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:01,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:41:01,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101113500] [2022-01-10 12:41:01,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:01,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:41:01,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:01,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:41:01,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:41:01,309 INFO L87 Difference]: Start difference. First operand 443 states and 620 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:01,401 INFO L93 Difference]: Finished difference Result 1083 states and 1502 transitions. [2022-01-10 12:41:01,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:41:01,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-01-10 12:41:01,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:01,403 INFO L225 Difference]: With dead ends: 1083 [2022-01-10 12:41:01,403 INFO L226 Difference]: Without dead ends: 728 [2022-01-10 12:41:01,404 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 12:41:01,404 INFO L933 BasicCegarLoop]: 436 mSDtfsCounter, 283 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:01,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 587 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:01,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-01-10 12:41:01,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 443. [2022-01-10 12:41:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.3823529411764706) internal successors, (611), 442 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:01,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 611 transitions. [2022-01-10 12:41:01,441 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 611 transitions. Word has length 72 [2022-01-10 12:41:01,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:01,441 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 611 transitions. [2022-01-10 12:41:01,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:01,441 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 611 transitions. [2022-01-10 12:41:01,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-10 12:41:01,442 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:01,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:01,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-10 12:41:01,442 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:01,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:01,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1388623362, now seen corresponding path program 1 times [2022-01-10 12:41:01,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:01,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092010104] [2022-01-10 12:41:01,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:01,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:01,513 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 12:41:01,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:01,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092010104] [2022-01-10 12:41:01,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092010104] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:01,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:01,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:41:01,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740940248] [2022-01-10 12:41:01,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:01,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:41:01,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:01,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:41:01,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:41:01,514 INFO L87 Difference]: Start difference. First operand 443 states and 611 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:01,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:01,610 INFO L93 Difference]: Finished difference Result 1159 states and 1592 transitions. [2022-01-10 12:41:01,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:41:01,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2022-01-10 12:41:01,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:01,613 INFO L225 Difference]: With dead ends: 1159 [2022-01-10 12:41:01,613 INFO L226 Difference]: Without dead ends: 804 [2022-01-10 12:41:01,614 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 12:41:01,614 INFO L933 BasicCegarLoop]: 515 mSDtfsCounter, 230 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:01,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 784 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:01,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-01-10 12:41:01,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 443. [2022-01-10 12:41:01,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 442 states have (on average 1.3800904977375565) internal successors, (610), 442 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 610 transitions. [2022-01-10 12:41:01,653 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 610 transitions. Word has length 73 [2022-01-10 12:41:01,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:01,653 INFO L470 AbstractCegarLoop]: Abstraction has 443 states and 610 transitions. [2022-01-10 12:41:01,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:01,653 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 610 transitions. [2022-01-10 12:41:01,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-10 12:41:01,654 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:01,654 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:01,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-10 12:41:01,654 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash -241364457, now seen corresponding path program 1 times [2022-01-10 12:41:01,654 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:01,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930946849] [2022-01-10 12:41:01,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:01,655 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:01,744 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 12:41:01,745 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:01,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930946849] [2022-01-10 12:41:01,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930946849] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:01,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:01,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:41:01,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620384868] [2022-01-10 12:41:01,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:01,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:41:01,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:01,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:41:01,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:41:01,746 INFO L87 Difference]: Start difference. First operand 443 states and 610 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:01,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:01,844 INFO L93 Difference]: Finished difference Result 997 states and 1368 transitions. [2022-01-10 12:41:01,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:41:01,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2022-01-10 12:41:01,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:01,847 INFO L225 Difference]: With dead ends: 997 [2022-01-10 12:41:01,847 INFO L226 Difference]: Without dead ends: 995 [2022-01-10 12:41:01,847 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 12:41:01,847 INFO L933 BasicCegarLoop]: 530 mSDtfsCounter, 356 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:01,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [356 Valid, 1362 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2022-01-10 12:41:01,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 445. [2022-01-10 12:41:01,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 444 states have (on average 1.3783783783783783) internal successors, (612), 444 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:01,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 612 transitions. [2022-01-10 12:41:01,914 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 612 transitions. Word has length 74 [2022-01-10 12:41:01,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:01,914 INFO L470 AbstractCegarLoop]: Abstraction has 445 states and 612 transitions. [2022-01-10 12:41:01,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:01,914 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 612 transitions. [2022-01-10 12:41:01,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-10 12:41:01,915 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:01,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:01,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-10 12:41:01,915 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:01,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1328595231, now seen corresponding path program 1 times [2022-01-10 12:41:01,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:01,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319798130] [2022-01-10 12:41:01,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:01,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:02,006 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 12:41:02,006 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:02,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319798130] [2022-01-10 12:41:02,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319798130] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:02,007 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:02,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 12:41:02,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685857860] [2022-01-10 12:41:02,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:02,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 12:41:02,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:02,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 12:41:02,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 12:41:02,008 INFO L87 Difference]: Start difference. First operand 445 states and 612 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:02,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:02,383 INFO L93 Difference]: Finished difference Result 1284 states and 1756 transitions. [2022-01-10 12:41:02,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 12:41:02,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-01-10 12:41:02,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:02,386 INFO L225 Difference]: With dead ends: 1284 [2022-01-10 12:41:02,386 INFO L226 Difference]: Without dead ends: 927 [2022-01-10 12:41:02,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-01-10 12:41:02,388 INFO L933 BasicCegarLoop]: 484 mSDtfsCounter, 624 mSDsluCounter, 2223 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:02,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [624 Valid, 2707 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 12:41:02,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2022-01-10 12:41:02,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 465. [2022-01-10 12:41:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 1.3793103448275863) internal successors, (640), 464 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 640 transitions. [2022-01-10 12:41:02,430 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 640 transitions. Word has length 77 [2022-01-10 12:41:02,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:02,430 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 640 transitions. [2022-01-10 12:41:02,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:02,431 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 640 transitions. [2022-01-10 12:41:02,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-10 12:41:02,431 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:02,431 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:02,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-10 12:41:02,432 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:02,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:02,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1357224382, now seen corresponding path program 1 times [2022-01-10 12:41:02,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:02,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578978238] [2022-01-10 12:41:02,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:02,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:02,515 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 12:41:02,515 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:02,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578978238] [2022-01-10 12:41:02,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578978238] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:02,516 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:02,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:41:02,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945495839] [2022-01-10 12:41:02,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:02,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:41:02,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:02,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:41:02,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:41:02,517 INFO L87 Difference]: Start difference. First operand 465 states and 640 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:02,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:02,646 INFO L93 Difference]: Finished difference Result 1467 states and 2000 transitions. [2022-01-10 12:41:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:41:02,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-01-10 12:41:02,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:02,648 INFO L225 Difference]: With dead ends: 1467 [2022-01-10 12:41:02,648 INFO L226 Difference]: Without dead ends: 1004 [2022-01-10 12:41:02,649 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:41:02,650 INFO L933 BasicCegarLoop]: 546 mSDtfsCounter, 564 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:02,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [564 Valid, 813 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:02,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2022-01-10 12:41:02,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 461. [2022-01-10 12:41:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 460 states have (on average 1.3434782608695652) internal successors, (618), 460 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:02,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 618 transitions. [2022-01-10 12:41:02,690 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 618 transitions. Word has length 77 [2022-01-10 12:41:02,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:02,690 INFO L470 AbstractCegarLoop]: Abstraction has 461 states and 618 transitions. [2022-01-10 12:41:02,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 618 transitions. [2022-01-10 12:41:02,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-10 12:41:02,691 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:02,691 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:02,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-10 12:41:02,691 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:02,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:02,692 INFO L85 PathProgramCache]: Analyzing trace with hash 809425436, now seen corresponding path program 1 times [2022-01-10 12:41:02,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:02,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126164014] [2022-01-10 12:41:02,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:02,692 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:02,784 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 12:41:02,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:02,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126164014] [2022-01-10 12:41:02,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126164014] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:02,786 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:02,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:41:02,787 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994191308] [2022-01-10 12:41:02,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:02,787 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:41:02,787 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:02,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:41:02,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:41:02,787 INFO L87 Difference]: Start difference. First operand 461 states and 618 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:02,889 INFO L93 Difference]: Finished difference Result 1358 states and 1823 transitions. [2022-01-10 12:41:02,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:41:02,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2022-01-10 12:41:02,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:02,892 INFO L225 Difference]: With dead ends: 1358 [2022-01-10 12:41:02,892 INFO L226 Difference]: Without dead ends: 907 [2022-01-10 12:41:02,893 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 12:41:02,893 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 292 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:02,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 594 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:02,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-01-10 12:41:02,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 465. [2022-01-10 12:41:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 1.3405172413793103) internal successors, (622), 464 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:02,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 622 transitions. [2022-01-10 12:41:02,935 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 622 transitions. Word has length 83 [2022-01-10 12:41:02,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:02,935 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 622 transitions. [2022-01-10 12:41:02,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 622 transitions. [2022-01-10 12:41:02,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-01-10 12:41:02,936 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:02,936 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:02,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-10 12:41:02,937 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:02,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:02,937 INFO L85 PathProgramCache]: Analyzing trace with hash -82367905, now seen corresponding path program 1 times [2022-01-10 12:41:02,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:02,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455131334] [2022-01-10 12:41:02,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:02,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:02,968 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 12:41:02,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:02,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455131334] [2022-01-10 12:41:02,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455131334] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:02,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:02,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:41:02,968 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134087696] [2022-01-10 12:41:02,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:02,969 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:41:02,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:02,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:41:02,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:41:02,969 INFO L87 Difference]: Start difference. First operand 465 states and 622 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 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 12:41:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:03,066 INFO L93 Difference]: Finished difference Result 1300 states and 1742 transitions. [2022-01-10 12:41:03,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:41:03,066 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 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 105 [2022-01-10 12:41:03,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:03,068 INFO L225 Difference]: With dead ends: 1300 [2022-01-10 12:41:03,068 INFO L226 Difference]: Without dead ends: 847 [2022-01-10 12:41:03,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:41:03,069 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 218 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:03,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 898 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:03,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2022-01-10 12:41:03,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 465. [2022-01-10 12:41:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 1.3383620689655173) internal successors, (621), 464 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:03,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 621 transitions. [2022-01-10 12:41:03,110 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 621 transitions. Word has length 105 [2022-01-10 12:41:03,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:03,110 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 621 transitions. [2022-01-10 12:41:03,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 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 12:41:03,110 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 621 transitions. [2022-01-10 12:41:03,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-01-10 12:41:03,111 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:03,111 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:03,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-10 12:41:03,111 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:03,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:03,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1477583050, now seen corresponding path program 1 times [2022-01-10 12:41:03,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:03,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867514780] [2022-01-10 12:41:03,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:03,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 12:41:03,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:03,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867514780] [2022-01-10 12:41:03,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867514780] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:03,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:03,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:41:03,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614916492] [2022-01-10 12:41:03,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:03,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:41:03,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:03,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:41:03,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:41:03,147 INFO L87 Difference]: Start difference. First operand 465 states and 621 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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 12:41:03,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:03,236 INFO L93 Difference]: Finished difference Result 1284 states and 1722 transitions. [2022-01-10 12:41:03,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:41:03,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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 12:41:03,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:03,239 INFO L225 Difference]: With dead ends: 1284 [2022-01-10 12:41:03,239 INFO L226 Difference]: Without dead ends: 845 [2022-01-10 12:41:03,240 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:41:03,240 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 217 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 898 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 12:41:03,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 898 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:03,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-01-10 12:41:03,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 465. [2022-01-10 12:41:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 1.3362068965517242) internal successors, (620), 464 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:03,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 620 transitions. [2022-01-10 12:41:03,281 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 620 transitions. Word has length 108 [2022-01-10 12:41:03,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:03,281 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 620 transitions. [2022-01-10 12:41:03,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 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 12:41:03,282 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 620 transitions. [2022-01-10 12:41:03,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-01-10 12:41:03,283 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:03,283 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:03,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-10 12:41:03,283 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:03,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:03,283 INFO L85 PathProgramCache]: Analyzing trace with hash 470139051, now seen corresponding path program 1 times [2022-01-10 12:41:03,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:03,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304974021] [2022-01-10 12:41:03,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:03,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:03,321 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 12:41:03,321 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:03,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304974021] [2022-01-10 12:41:03,321 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304974021] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:03,321 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:03,321 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:41:03,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039492010] [2022-01-10 12:41:03,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:03,321 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:41:03,322 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:03,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:41:03,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:41:03,322 INFO L87 Difference]: Start difference. First operand 465 states and 620 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:03,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:03,417 INFO L93 Difference]: Finished difference Result 1266 states and 1700 transitions. [2022-01-10 12:41:03,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:41:03,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2022-01-10 12:41:03,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:03,419 INFO L225 Difference]: With dead ends: 1266 [2022-01-10 12:41:03,419 INFO L226 Difference]: Without dead ends: 843 [2022-01-10 12:41:03,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:41:03,420 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 216 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:03,420 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [216 Valid, 898 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:03,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-01-10 12:41:03,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 465. [2022-01-10 12:41:03,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 1.334051724137931) internal successors, (619), 464 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:03,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 619 transitions. [2022-01-10 12:41:03,461 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 619 transitions. Word has length 111 [2022-01-10 12:41:03,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:03,461 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 619 transitions. [2022-01-10 12:41:03,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 619 transitions. [2022-01-10 12:41:03,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-01-10 12:41:03,462 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:03,462 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:03,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-10 12:41:03,463 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:03,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:03,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1074925313, now seen corresponding path program 1 times [2022-01-10 12:41:03,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:03,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893501480] [2022-01-10 12:41:03,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:03,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:41:03,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:03,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893501480] [2022-01-10 12:41:03,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893501480] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:03,497 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:03,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:41:03,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89047009] [2022-01-10 12:41:03,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:03,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:41:03,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:03,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:41:03,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:41:03,498 INFO L87 Difference]: Start difference. First operand 465 states and 619 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:03,555 INFO L93 Difference]: Finished difference Result 844 states and 1129 transitions. [2022-01-10 12:41:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:41:03,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2022-01-10 12:41:03,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:03,556 INFO L225 Difference]: With dead ends: 844 [2022-01-10 12:41:03,556 INFO L226 Difference]: Without dead ends: 435 [2022-01-10 12:41:03,557 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 12:41:03,557 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 231 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:03,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 311 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-01-10 12:41:03,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2022-01-10 12:41:03,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 1.3294930875576036) internal successors, (577), 434 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 577 transitions. [2022-01-10 12:41:03,605 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 577 transitions. Word has length 114 [2022-01-10 12:41:03,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:03,606 INFO L470 AbstractCegarLoop]: Abstraction has 435 states and 577 transitions. [2022-01-10 12:41:03,606 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:03,606 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 577 transitions. [2022-01-10 12:41:03,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-10 12:41:03,607 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:03,607 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:03,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-10 12:41:03,607 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:03,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:03,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1789595480, now seen corresponding path program 1 times [2022-01-10 12:41:03,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:03,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601372646] [2022-01-10 12:41:03,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:03,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:03,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:41:03,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:03,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601372646] [2022-01-10 12:41:03,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601372646] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:03,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:03,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 12:41:03,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091872135] [2022-01-10 12:41:03,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:03,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 12:41:03,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:03,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 12:41:03,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-10 12:41:03,666 INFO L87 Difference]: Start difference. First operand 435 states and 577 transitions. Second operand has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:03,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:03,743 INFO L93 Difference]: Finished difference Result 825 states and 1103 transitions. [2022-01-10 12:41:03,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 12:41:03,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2022-01-10 12:41:03,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:03,745 INFO L225 Difference]: With dead ends: 825 [2022-01-10 12:41:03,745 INFO L226 Difference]: Without dead ends: 435 [2022-01-10 12:41:03,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-10 12:41:03,746 INFO L933 BasicCegarLoop]: 268 mSDtfsCounter, 517 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:03,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [517 Valid, 317 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:03,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-01-10 12:41:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2022-01-10 12:41:03,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 1.327188940092166) internal successors, (576), 434 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 576 transitions. [2022-01-10 12:41:03,811 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 576 transitions. Word has length 116 [2022-01-10 12:41:03,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:03,811 INFO L470 AbstractCegarLoop]: Abstraction has 435 states and 576 transitions. [2022-01-10 12:41:03,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.333333333333332) internal successors, (116), 6 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 576 transitions. [2022-01-10 12:41:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-10 12:41:03,812 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:03,812 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:03,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-10 12:41:03,812 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:03,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:03,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2046684500, now seen corresponding path program 1 times [2022-01-10 12:41:03,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:03,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987797855] [2022-01-10 12:41:03,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:03,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:03,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:41:03,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:03,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987797855] [2022-01-10 12:41:03,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987797855] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:03,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:03,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:41:03,862 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640750168] [2022-01-10 12:41:03,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:03,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 12:41:03,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:03,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 12:41:03,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 12:41:03,863 INFO L87 Difference]: Start difference. First operand 435 states and 576 transitions. Second operand has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:03,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:03,931 INFO L93 Difference]: Finished difference Result 813 states and 1085 transitions. [2022-01-10 12:41:03,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 12:41:03,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2022-01-10 12:41:03,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:03,933 INFO L225 Difference]: With dead ends: 813 [2022-01-10 12:41:03,933 INFO L226 Difference]: Without dead ends: 435 [2022-01-10 12:41:03,934 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:41:03,934 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 1 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:03,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 817 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:03,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-01-10 12:41:03,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2022-01-10 12:41:03,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 1.3248847926267282) internal successors, (575), 434 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:03,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 575 transitions. [2022-01-10 12:41:03,973 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 575 transitions. Word has length 117 [2022-01-10 12:41:03,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:03,973 INFO L470 AbstractCegarLoop]: Abstraction has 435 states and 575 transitions. [2022-01-10 12:41:03,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:03,973 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 575 transitions. [2022-01-10 12:41:03,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:41:03,974 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:03,974 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:03,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-10 12:41:03,974 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:03,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2104903013, now seen corresponding path program 1 times [2022-01-10 12:41:03,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:03,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667705686] [2022-01-10 12:41:03,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:03,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:41:04,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:04,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667705686] [2022-01-10 12:41:04,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667705686] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:41:04,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95417189] [2022-01-10 12:41:04,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:04,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:41:04,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:41:04,074 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 12:41:04,075 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 12:41:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:04,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 12:41:04,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:41:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:41:04,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:41:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:41:04,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95417189] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:41:04,663 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:41:04,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-01-10 12:41:04,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456586780] [2022-01-10 12:41:04,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:41:04,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 12:41:04,664 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:04,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 12:41:04,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-01-10 12:41:04,665 INFO L87 Difference]: Start difference. First operand 435 states and 575 transitions. Second operand has 13 states, 13 states have (on average 9.692307692307692) internal successors, (126), 13 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:05,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:05,199 INFO L93 Difference]: Finished difference Result 2006 states and 2675 transitions. [2022-01-10 12:41:05,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 12:41:05,199 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.692307692307692) internal successors, (126), 13 states have internal predecessors, (126), 0 states have call successors, (0), 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 120 [2022-01-10 12:41:05,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:05,204 INFO L225 Difference]: With dead ends: 2006 [2022-01-10 12:41:05,204 INFO L226 Difference]: Without dead ends: 1633 [2022-01-10 12:41:05,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 234 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-01-10 12:41:05,205 INFO L933 BasicCegarLoop]: 588 mSDtfsCounter, 1404 mSDsluCounter, 2501 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 3089 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:05,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1404 Valid, 3089 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:41:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2022-01-10 12:41:05,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 727. [2022-01-10 12:41:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 726 states have (on average 1.31267217630854) internal successors, (953), 726 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 953 transitions. [2022-01-10 12:41:05,293 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 953 transitions. Word has length 120 [2022-01-10 12:41:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:05,293 INFO L470 AbstractCegarLoop]: Abstraction has 727 states and 953 transitions. [2022-01-10 12:41:05,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.692307692307692) internal successors, (126), 13 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 953 transitions. [2022-01-10 12:41:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-10 12:41:05,294 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:05,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:05,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 12:41:05,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:41:05,508 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:05,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:05,508 INFO L85 PathProgramCache]: Analyzing trace with hash 735240671, now seen corresponding path program 1 times [2022-01-10 12:41:05,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:05,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946227583] [2022-01-10 12:41:05,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:05,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:05,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:41:05,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:05,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946227583] [2022-01-10 12:41:05,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946227583] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:41:05,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514204319] [2022-01-10 12:41:05,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:05,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:41:05,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:41:05,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 12:41:05,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 12:41:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:05,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 12:41:05,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:41:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:41:06,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:41:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:41:06,288 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514204319] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:41:06,288 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:41:06,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-01-10 12:41:06,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960236618] [2022-01-10 12:41:06,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:41:06,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 12:41:06,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:06,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 12:41:06,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-01-10 12:41:06,289 INFO L87 Difference]: Start difference. First operand 727 states and 953 transitions. Second operand has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:06,752 INFO L93 Difference]: Finished difference Result 2290 states and 3029 transitions. [2022-01-10 12:41:06,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 12:41:06,752 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 0 states have call successors, (0), 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 120 [2022-01-10 12:41:06,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:06,757 INFO L225 Difference]: With dead ends: 2290 [2022-01-10 12:41:06,757 INFO L226 Difference]: Without dead ends: 1917 [2022-01-10 12:41:06,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 233 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2022-01-10 12:41:06,759 INFO L933 BasicCegarLoop]: 501 mSDtfsCounter, 1224 mSDsluCounter, 2982 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:06,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1224 Valid, 3483 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:41:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2022-01-10 12:41:06,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1299. [2022-01-10 12:41:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1298 states have (on average 1.3058551617873653) internal successors, (1695), 1298 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:06,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1695 transitions. [2022-01-10 12:41:06,917 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1695 transitions. Word has length 120 [2022-01-10 12:41:06,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:06,917 INFO L470 AbstractCegarLoop]: Abstraction has 1299 states and 1695 transitions. [2022-01-10 12:41:06,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:06,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1695 transitions. [2022-01-10 12:41:06,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-01-10 12:41:06,919 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:06,919 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:06,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 12:41:07,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-01-10 12:41:07,127 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:07,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:07,128 INFO L85 PathProgramCache]: Analyzing trace with hash 105331309, now seen corresponding path program 1 times [2022-01-10 12:41:07,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:07,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423107718] [2022-01-10 12:41:07,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:07,128 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:41:07,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:07,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423107718] [2022-01-10 12:41:07,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423107718] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:07,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:07,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:41:07,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501245468] [2022-01-10 12:41:07,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:07,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:41:07,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:07,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:41:07,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:41:07,168 INFO L87 Difference]: Start difference. First operand 1299 states and 1695 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:07,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:07,256 INFO L93 Difference]: Finished difference Result 1981 states and 2596 transitions. [2022-01-10 12:41:07,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:41:07,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2022-01-10 12:41:07,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:07,258 INFO L225 Difference]: With dead ends: 1981 [2022-01-10 12:41:07,258 INFO L226 Difference]: Without dead ends: 685 [2022-01-10 12:41:07,259 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 12:41:07,260 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 130 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:07,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 465 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:07,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-01-10 12:41:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 677. [2022-01-10 12:41:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 676 states have (on average 1.3180473372781065) internal successors, (891), 676 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 891 transitions. [2022-01-10 12:41:07,330 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 891 transitions. Word has length 121 [2022-01-10 12:41:07,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:07,330 INFO L470 AbstractCegarLoop]: Abstraction has 677 states and 891 transitions. [2022-01-10 12:41:07,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 891 transitions. [2022-01-10 12:41:07,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-01-10 12:41:07,331 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:07,331 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:07,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-10 12:41:07,331 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:07,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:07,332 INFO L85 PathProgramCache]: Analyzing trace with hash 89435240, now seen corresponding path program 1 times [2022-01-10 12:41:07,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:07,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328044465] [2022-01-10 12:41:07,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:07,332 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:41:07,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:07,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328044465] [2022-01-10 12:41:07,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328044465] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:41:07,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008518942] [2022-01-10 12:41:07,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:07,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:41:07,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:41:07,464 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 12:41:07,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 12:41:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:07,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 1219 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-10 12:41:07,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:41:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:41:07,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:41:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:41:08,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008518942] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:41:08,127 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:41:08,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-01-10 12:41:08,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809558739] [2022-01-10 12:41:08,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:41:08,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 12:41:08,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:08,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 12:41:08,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-01-10 12:41:08,128 INFO L87 Difference]: Start difference. First operand 677 states and 891 transitions. Second operand has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:08,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:08,504 INFO L93 Difference]: Finished difference Result 1708 states and 2279 transitions. [2022-01-10 12:41:08,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 12:41:08,505 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 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 127 [2022-01-10 12:41:08,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:08,509 INFO L225 Difference]: With dead ends: 1708 [2022-01-10 12:41:08,509 INFO L226 Difference]: Without dead ends: 1335 [2022-01-10 12:41:08,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 248 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-01-10 12:41:08,513 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 1608 mSDsluCounter, 2459 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:08,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1608 Valid, 2796 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:41:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2022-01-10 12:41:08,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 691. [2022-01-10 12:41:08,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 690 states have (on average 1.3115942028985508) internal successors, (905), 690 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:08,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 905 transitions. [2022-01-10 12:41:08,589 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 905 transitions. Word has length 127 [2022-01-10 12:41:08,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:08,589 INFO L470 AbstractCegarLoop]: Abstraction has 691 states and 905 transitions. [2022-01-10 12:41:08,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:08,589 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 905 transitions. [2022-01-10 12:41:08,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-01-10 12:41:08,590 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:08,590 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 12:41:08,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 12:41:08,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:41:08,803 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:08,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:08,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1476230355, now seen corresponding path program 1 times [2022-01-10 12:41:08,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:08,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397980180] [2022-01-10 12:41:08,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:08,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:41:08,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:08,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397980180] [2022-01-10 12:41:08,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397980180] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:41:08,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497759643] [2022-01-10 12:41:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:08,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:41:08,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:41:08,889 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 12:41:08,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 12:41:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:09,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 12:41:09,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 12:41:09,424 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:41:09,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 12:41:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 12:41:09,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497759643] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 12:41:09,608 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 12:41:09,608 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-01-10 12:41:09,608 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239651782] [2022-01-10 12:41:09,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 12:41:09,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 12:41:09,609 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:09,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 12:41:09,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-10 12:41:09,609 INFO L87 Difference]: Start difference. First operand 691 states and 905 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:09,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:09,796 INFO L93 Difference]: Finished difference Result 1448 states and 1887 transitions. [2022-01-10 12:41:09,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:41:09,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 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 128 [2022-01-10 12:41:09,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:09,799 INFO L225 Difference]: With dead ends: 1448 [2022-01-10 12:41:09,799 INFO L226 Difference]: Without dead ends: 767 [2022-01-10 12:41:09,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-10 12:41:09,800 INFO L933 BasicCegarLoop]: 295 mSDtfsCounter, 234 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:09,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 1092 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:41:09,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-01-10 12:41:09,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 767. [2022-01-10 12:41:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 766 states have (on average 1.2859007832898173) internal successors, (985), 766 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 985 transitions. [2022-01-10 12:41:09,920 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 985 transitions. Word has length 128 [2022-01-10 12:41:09,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:09,920 INFO L470 AbstractCegarLoop]: Abstraction has 767 states and 985 transitions. [2022-01-10 12:41:09,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 985 transitions. [2022-01-10 12:41:09,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-01-10 12:41:09,921 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:09,921 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:09,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 12:41:10,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:41:10,135 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:10,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:10,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1572162143, now seen corresponding path program 2 times [2022-01-10 12:41:10,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:10,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505045247] [2022-01-10 12:41:10,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:10,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-01-10 12:41:10,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:10,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505045247] [2022-01-10 12:41:10,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505045247] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:10,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:10,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 12:41:10,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786040540] [2022-01-10 12:41:10,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:10,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 12:41:10,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:10,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 12:41:10,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 12:41:10,327 INFO L87 Difference]: Start difference. First operand 767 states and 985 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:10,647 INFO L93 Difference]: Finished difference Result 2161 states and 2879 transitions. [2022-01-10 12:41:10,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 12:41:10,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 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 202 [2022-01-10 12:41:10,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:10,655 INFO L225 Difference]: With dead ends: 2161 [2022-01-10 12:41:10,655 INFO L226 Difference]: Without dead ends: 1788 [2022-01-10 12:41:10,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 12:41:10,656 INFO L933 BasicCegarLoop]: 743 mSDtfsCounter, 576 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 3111 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:10,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 3111 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:41:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2022-01-10 12:41:10,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 813. [2022-01-10 12:41:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 812 states have (on average 1.2967980295566504) internal successors, (1053), 812 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1053 transitions. [2022-01-10 12:41:10,759 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1053 transitions. Word has length 202 [2022-01-10 12:41:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:10,760 INFO L470 AbstractCegarLoop]: Abstraction has 813 states and 1053 transitions. [2022-01-10 12:41:10,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 6 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1053 transitions. [2022-01-10 12:41:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-01-10 12:41:10,761 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:10,761 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:10,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-10 12:41:10,761 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:10,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:10,763 INFO L85 PathProgramCache]: Analyzing trace with hash 954482945, now seen corresponding path program 1 times [2022-01-10 12:41:10,764 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:10,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157946737] [2022-01-10 12:41:10,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:10,764 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-01-10 12:41:11,118 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:11,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157946737] [2022-01-10 12:41:11,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157946737] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:11,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:11,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 12:41:11,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459366255] [2022-01-10 12:41:11,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:11,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 12:41:11,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:11,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 12:41:11,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 12:41:11,120 INFO L87 Difference]: Start difference. First operand 813 states and 1053 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:11,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:11,325 INFO L93 Difference]: Finished difference Result 1396 states and 1834 transitions. [2022-01-10 12:41:11,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 12:41:11,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 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 202 [2022-01-10 12:41:11,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:11,327 INFO L225 Difference]: With dead ends: 1396 [2022-01-10 12:41:11,328 INFO L226 Difference]: Without dead ends: 819 [2022-01-10 12:41:11,328 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 12:41:11,329 INFO L933 BasicCegarLoop]: 250 mSDtfsCounter, 217 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:11,329 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 588 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 12:41:11,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-01-10 12:41:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 817. [2022-01-10 12:41:11,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 816 states have (on average 1.295343137254902) internal successors, (1057), 816 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1057 transitions. [2022-01-10 12:41:11,434 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1057 transitions. Word has length 202 [2022-01-10 12:41:11,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:11,434 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1057 transitions. [2022-01-10 12:41:11,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:11,435 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1057 transitions. [2022-01-10 12:41:11,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-01-10 12:41:11,438 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:11,438 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:11,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-10 12:41:11,438 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:11,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:11,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1165804254, now seen corresponding path program 1 times [2022-01-10 12:41:11,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:11,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791144574] [2022-01-10 12:41:11,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:11,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-01-10 12:41:11,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:11,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791144574] [2022-01-10 12:41:11,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791144574] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:11,748 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:11,748 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 12:41:11,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547799645] [2022-01-10 12:41:11,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:11,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 12:41:11,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:11,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 12:41:11,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-10 12:41:11,749 INFO L87 Difference]: Start difference. First operand 817 states and 1057 transitions. Second operand has 10 states, 10 states have (on average 12.8) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:12,892 INFO L93 Difference]: Finished difference Result 2564 states and 3417 transitions. [2022-01-10 12:41:12,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 12:41:12,893 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 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 202 [2022-01-10 12:41:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:12,896 INFO L225 Difference]: With dead ends: 2564 [2022-01-10 12:41:12,896 INFO L226 Difference]: Without dead ends: 2143 [2022-01-10 12:41:12,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2022-01-10 12:41:12,897 INFO L933 BasicCegarLoop]: 272 mSDtfsCounter, 2941 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2941 SdHoareTripleChecker+Valid, 2525 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:12,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2941 Valid, 2525 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-10 12:41:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2022-01-10 12:41:13,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 906. [2022-01-10 12:41:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 905 states have (on average 1.2839779005524863) internal successors, (1162), 905 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1162 transitions. [2022-01-10 12:41:13,050 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1162 transitions. Word has length 202 [2022-01-10 12:41:13,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:13,050 INFO L470 AbstractCegarLoop]: Abstraction has 906 states and 1162 transitions. [2022-01-10 12:41:13,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.8) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1162 transitions. [2022-01-10 12:41:13,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-01-10 12:41:13,052 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:13,052 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:13,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-10 12:41:13,052 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:13,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:13,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1704967582, now seen corresponding path program 1 times [2022-01-10 12:41:13,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:13,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620920234] [2022-01-10 12:41:13,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:13,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:13,548 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-01-10 12:41:13,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:13,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620920234] [2022-01-10 12:41:13,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620920234] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:13,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:13,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-10 12:41:13,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985070548] [2022-01-10 12:41:13,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:13,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 12:41:13,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:13,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 12:41:13,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-01-10 12:41:13,549 INFO L87 Difference]: Start difference. First operand 906 states and 1162 transitions. Second operand has 13 states, 13 states have (on average 9.846153846153847) internal successors, (128), 12 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:15,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:15,602 INFO L93 Difference]: Finished difference Result 2601 states and 3466 transitions. [2022-01-10 12:41:15,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 12:41:15,603 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.846153846153847) internal successors, (128), 12 states have internal predecessors, (128), 0 states have call successors, (0), 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 202 [2022-01-10 12:41:15,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:15,606 INFO L225 Difference]: With dead ends: 2601 [2022-01-10 12:41:15,606 INFO L226 Difference]: Without dead ends: 2164 [2022-01-10 12:41:15,606 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2022-01-10 12:41:15,607 INFO L933 BasicCegarLoop]: 421 mSDtfsCounter, 4408 mSDsluCounter, 2562 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4408 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:15,607 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4408 Valid, 2983 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 12:41:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2022-01-10 12:41:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 921. [2022-01-10 12:41:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.2880434782608696) internal successors, (1185), 920 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1185 transitions. [2022-01-10 12:41:15,761 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1185 transitions. Word has length 202 [2022-01-10 12:41:15,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:15,761 INFO L470 AbstractCegarLoop]: Abstraction has 921 states and 1185 transitions. [2022-01-10 12:41:15,761 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.846153846153847) internal successors, (128), 12 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:15,761 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1185 transitions. [2022-01-10 12:41:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2022-01-10 12:41:15,762 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:15,762 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:15,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-10 12:41:15,763 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:15,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:15,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1428422563, now seen corresponding path program 1 times [2022-01-10 12:41:15,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:15,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508729819] [2022-01-10 12:41:15,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:15,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-01-10 12:41:16,108 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:16,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508729819] [2022-01-10 12:41:16,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508729819] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:16,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:16,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 12:41:16,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690834476] [2022-01-10 12:41:16,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:16,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 12:41:16,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:16,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 12:41:16,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 12:41:16,109 INFO L87 Difference]: Start difference. First operand 921 states and 1185 transitions. Second operand has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:16,606 INFO L93 Difference]: Finished difference Result 1683 states and 2194 transitions. [2022-01-10 12:41:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 12:41:16,607 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 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 202 [2022-01-10 12:41:16,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:16,609 INFO L225 Difference]: With dead ends: 1683 [2022-01-10 12:41:16,609 INFO L226 Difference]: Without dead ends: 1144 [2022-01-10 12:41:16,609 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-10 12:41:16,610 INFO L933 BasicCegarLoop]: 284 mSDtfsCounter, 934 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:16,610 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [934 Valid, 747 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 12:41:16,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2022-01-10 12:41:16,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 862. [2022-01-10 12:41:16,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 861 states have (on average 1.278745644599303) internal successors, (1101), 861 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:16,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1101 transitions. [2022-01-10 12:41:16,765 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1101 transitions. Word has length 202 [2022-01-10 12:41:16,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:16,765 INFO L470 AbstractCegarLoop]: Abstraction has 862 states and 1101 transitions. [2022-01-10 12:41:16,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.333333333333332) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:16,765 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1101 transitions. [2022-01-10 12:41:16,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-01-10 12:41:16,766 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:16,766 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:16,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-10 12:41:16,767 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:16,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:16,767 INFO L85 PathProgramCache]: Analyzing trace with hash 156334341, now seen corresponding path program 1 times [2022-01-10 12:41:16,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:16,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526894083] [2022-01-10 12:41:16,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:16,767 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-01-10 12:41:16,866 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:16,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526894083] [2022-01-10 12:41:16,867 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526894083] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:16,867 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:16,867 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 12:41:16,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003358854] [2022-01-10 12:41:16,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:16,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 12:41:16,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:16,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 12:41:16,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 12:41:16,869 INFO L87 Difference]: Start difference. First operand 862 states and 1101 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:17,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:17,050 INFO L93 Difference]: Finished difference Result 1576 states and 2015 transitions. [2022-01-10 12:41:17,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 12:41:17,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 203 [2022-01-10 12:41:17,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:17,052 INFO L225 Difference]: With dead ends: 1576 [2022-01-10 12:41:17,052 INFO L226 Difference]: Without dead ends: 816 [2022-01-10 12:41:17,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 12:41:17,053 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 186 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:17,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 289 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 12:41:17,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2022-01-10 12:41:17,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 812. [2022-01-10 12:41:17,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 1.2219482120838472) internal successors, (991), 811 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:17,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 991 transitions. [2022-01-10 12:41:17,211 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 991 transitions. Word has length 203 [2022-01-10 12:41:17,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:17,212 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 991 transitions. [2022-01-10 12:41:17,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:17,212 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 991 transitions. [2022-01-10 12:41:17,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-01-10 12:41:17,213 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:17,213 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:17,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-10 12:41:17,213 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:17,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:17,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1739843187, now seen corresponding path program 1 times [2022-01-10 12:41:17,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:17,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101393461] [2022-01-10 12:41:17,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:17,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-01-10 12:41:17,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:17,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101393461] [2022-01-10 12:41:17,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101393461] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:17,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:17,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 12:41:17,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684290168] [2022-01-10 12:41:17,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:17,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 12:41:17,510 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:17,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 12:41:17,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-01-10 12:41:17,510 INFO L87 Difference]: Start difference. First operand 812 states and 991 transitions. Second operand has 10 states, 10 states have (on average 13.0) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:18,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:18,453 INFO L93 Difference]: Finished difference Result 1956 states and 2450 transitions. [2022-01-10 12:41:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 12:41:18,454 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 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 204 [2022-01-10 12:41:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:18,456 INFO L225 Difference]: With dead ends: 1956 [2022-01-10 12:41:18,456 INFO L226 Difference]: Without dead ends: 1480 [2022-01-10 12:41:18,457 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2022-01-10 12:41:18,457 INFO L933 BasicCegarLoop]: 338 mSDtfsCounter, 1854 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1854 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:18,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1854 Valid, 1931 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 12:41:18,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2022-01-10 12:41:18,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 812. [2022-01-10 12:41:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 1.214549938347719) internal successors, (985), 811 states have internal predecessors, (985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:18,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 985 transitions. [2022-01-10 12:41:18,629 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 985 transitions. Word has length 204 [2022-01-10 12:41:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:18,630 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 985 transitions. [2022-01-10 12:41:18,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.0) internal successors, (130), 9 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:18,630 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 985 transitions. [2022-01-10 12:41:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-01-10 12:41:18,631 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:18,631 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:18,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-10 12:41:18,631 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:18,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:18,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1330897131, now seen corresponding path program 1 times [2022-01-10 12:41:18,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:18,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059627599] [2022-01-10 12:41:18,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:18,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-01-10 12:41:19,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:19,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059627599] [2022-01-10 12:41:19,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059627599] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 12:41:19,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 12:41:19,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 12:41:19,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031478664] [2022-01-10 12:41:19,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 12:41:19,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 12:41:19,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 12:41:19,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 12:41:19,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-10 12:41:19,053 INFO L87 Difference]: Start difference. First operand 812 states and 985 transitions. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 7 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 12:41:20,169 INFO L93 Difference]: Finished difference Result 1550 states and 1937 transitions. [2022-01-10 12:41:20,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 12:41:20,170 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 7 states have internal predecessors, (130), 0 states have call successors, (0), 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 204 [2022-01-10 12:41:20,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 12:41:20,171 INFO L225 Difference]: With dead ends: 1550 [2022-01-10 12:41:20,171 INFO L226 Difference]: Without dead ends: 1060 [2022-01-10 12:41:20,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-01-10 12:41:20,172 INFO L933 BasicCegarLoop]: 354 mSDtfsCounter, 914 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 12:41:20,173 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [914 Valid, 1652 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-10 12:41:20,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2022-01-10 12:41:20,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 725. [2022-01-10 12:41:20,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.223756906077348) internal successors, (886), 724 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 886 transitions. [2022-01-10 12:41:20,337 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 886 transitions. Word has length 204 [2022-01-10 12:41:20,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 12:41:20,338 INFO L470 AbstractCegarLoop]: Abstraction has 725 states and 886 transitions. [2022-01-10 12:41:20,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 7 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 12:41:20,339 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 886 transitions. [2022-01-10 12:41:20,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-01-10 12:41:20,339 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 12:41:20,339 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:41:20,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-10 12:41:20,340 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2022-01-10 12:41:20,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 12:41:20,340 INFO L85 PathProgramCache]: Analyzing trace with hash -405133569, now seen corresponding path program 1 times [2022-01-10 12:41:20,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 12:41:20,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706381646] [2022-01-10 12:41:20,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:20,340 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 12:41:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-01-10 12:41:21,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 12:41:21,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706381646] [2022-01-10 12:41:21,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706381646] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 12:41:21,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138642366] [2022-01-10 12:41:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 12:41:21,298 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 12:41:21,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 12:41:21,300 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 12:41:21,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 12:41:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 12:41:21,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 1873 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-10 12:41:21,594 INFO L286 TraceCheckSpWp]: Computing forward predicates...