/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/locks/test_locks_12.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 03:30:28,624 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 03:30:28,648 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 03:30:28,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 03:30:28,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 03:30:28,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 03:30:28,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 03:30:28,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 03:30:28,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 03:30:28,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 03:30:28,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 03:30:28,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 03:30:28,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 03:30:28,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 03:30:28,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 03:30:28,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 03:30:28,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 03:30:28,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 03:30:28,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 03:30:28,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 03:30:28,707 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 03:30:28,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 03:30:28,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 03:30:28,713 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 03:30:28,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 03:30:28,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 03:30:28,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 03:30:28,719 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 03:30:28,719 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 03:30:28,720 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 03:30:28,720 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 03:30:28,721 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 03:30:28,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 03:30:28,722 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 03:30:28,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 03:30:28,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 03:30:28,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 03:30:28,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 03:30:28,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 03:30:28,724 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 03:30:28,725 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 03:30:28,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_SUM.epf [2022-01-11 03:30:28,751 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 03:30:28,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 03:30:28,751 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 03:30:28,752 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 03:30:28,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 03:30:28,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 03:30:28,753 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 03:30:28,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 03:30:28,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 03:30:28,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 03:30:28,753 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 03:30:28,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 03:30:28,754 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 03:30:28,754 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 03:30:28,754 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 03:30:28,754 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 03:30:28,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 03:30:28,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 03:30:28,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 03:30:28,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 03:30:28,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 03:30:28,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:30:28,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 03:30:28,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 03:30:28,756 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 03:30:28,756 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 03:30:28,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 03:30:28,756 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 03:30:28,756 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 03:30:28,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 03:30:28,756 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 03:30:28,756 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 03:30:28,757 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 03:30:28,757 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 03:30:28,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 03:30:28,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 03:30:28,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 03:30:28,954 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 03:30:28,954 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 03:30:28,955 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_12.c [2022-01-11 03:30:29,019 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3928358/228965a68f914328b151cfb41c296ed5/FLAGcdbebf239 [2022-01-11 03:30:29,458 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 03:30:29,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c [2022-01-11 03:30:29,463 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3928358/228965a68f914328b151cfb41c296ed5/FLAGcdbebf239 [2022-01-11 03:30:29,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3928358/228965a68f914328b151cfb41c296ed5 [2022-01-11 03:30:29,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 03:30:29,475 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 03:30:29,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 03:30:29,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 03:30:29,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 03:30:29,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:30:29" (1/1) ... [2022-01-11 03:30:29,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b7f8e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:29, skipping insertion in model container [2022-01-11 03:30:29,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 03:30:29" (1/1) ... [2022-01-11 03:30:29,484 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 03:30:29,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 03:30:29,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c[4591,4604] [2022-01-11 03:30:29,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:30:29,641 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 03:30:29,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_12.c[4591,4604] [2022-01-11 03:30:29,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 03:30:29,665 INFO L208 MainTranslator]: Completed translation [2022-01-11 03:30:29,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:29 WrapperNode [2022-01-11 03:30:29,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 03:30:29,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 03:30:29,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 03:30:29,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 03:30:29,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:29" (1/1) ... [2022-01-11 03:30:29,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:29" (1/1) ... [2022-01-11 03:30:29,721 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 147 [2022-01-11 03:30:29,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 03:30:29,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 03:30:29,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 03:30:29,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 03:30:29,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:29" (1/1) ... [2022-01-11 03:30:29,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:29" (1/1) ... [2022-01-11 03:30:29,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:29" (1/1) ... [2022-01-11 03:30:29,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:29" (1/1) ... [2022-01-11 03:30:29,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:29" (1/1) ... [2022-01-11 03:30:29,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:29" (1/1) ... [2022-01-11 03:30:29,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:29" (1/1) ... [2022-01-11 03:30:29,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 03:30:29,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 03:30:29,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 03:30:29,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 03:30:29,774 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:29" (1/1) ... [2022-01-11 03:30:29,788 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 03:30:29,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 03:30:29,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 03:30:29,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 03:30:29,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 03:30:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 03:30:29,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 03:30:29,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 03:30:29,969 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 03:30:29,970 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 03:30:30,159 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 03:30:30,164 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 03:30:30,165 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-11 03:30:30,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:30 BoogieIcfgContainer [2022-01-11 03:30:30,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 03:30:30,167 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 03:30:30,167 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 03:30:30,168 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 03:30:30,170 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:30" (1/1) ... [2022-01-11 03:30:30,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:30:30 BasicIcfg [2022-01-11 03:30:30,255 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 03:30:30,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 03:30:30,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 03:30:30,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 03:30:30,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 03:30:29" (1/4) ... [2022-01-11 03:30:30,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a31fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:30:30, skipping insertion in model container [2022-01-11 03:30:30,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 03:30:29" (2/4) ... [2022-01-11 03:30:30,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a31fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 03:30:30, skipping insertion in model container [2022-01-11 03:30:30,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:30:30" (3/4) ... [2022-01-11 03:30:30,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a31fad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:30:30, skipping insertion in model container [2022-01-11 03:30:30,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 03:30:30" (4/4) ... [2022-01-11 03:30:30,260 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_12.cTransformedIcfg [2022-01-11 03:30:30,266 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 03:30:30,266 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 03:30:30,294 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 03:30:30,299 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 03:30:30,299 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 03:30:30,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-11 03:30:30,315 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:30,316 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:30,316 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:30,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:30,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1482315354, now seen corresponding path program 1 times [2022-01-11 03:30:30,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:30,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280024850] [2022-01-11 03:30:30,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:30,326 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:30,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:30,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280024850] [2022-01-11 03:30:30,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280024850] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:30,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:30,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:30,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41751459] [2022-01-11 03:30:30,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:30,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:30,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:30,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:30,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:30,538 INFO L87 Difference]: Start difference. First operand has 46 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 45 states have internal predecessors, (84), 0 states have call successors, (0), 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 6.333333333333333) internal successors, (19), 3 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-11 03:30:30,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:30,578 INFO L93 Difference]: Finished difference Result 95 states and 169 transitions. [2022-01-11 03:30:30,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:30,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-11 03:30:30,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:30,585 INFO L225 Difference]: With dead ends: 95 [2022-01-11 03:30:30,586 INFO L226 Difference]: Without dead ends: 81 [2022-01-11 03:30:30,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:30,590 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:30,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:30,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-11 03:30:30,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2022-01-11 03:30:30,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 102 transitions. [2022-01-11 03:30:30,617 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 102 transitions. Word has length 19 [2022-01-11 03:30:30,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:30,618 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 102 transitions. [2022-01-11 03:30:30,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-11 03:30:30,618 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 102 transitions. [2022-01-11 03:30:30,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-11 03:30:30,619 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:30,619 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-11 03:30:30,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 03:30:30,619 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:30,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1305100133, now seen corresponding path program 1 times [2022-01-11 03:30:30,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:30,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51900642] [2022-01-11 03:30:30,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:30,621 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:30,694 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:30,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51900642] [2022-01-11 03:30:30,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51900642] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:30,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:30,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:30,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183240460] [2022-01-11 03:30:30,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:30,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:30,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:30,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:30,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:30,697 INFO L87 Difference]: Start difference. First operand 55 states and 102 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-11 03:30:30,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:30,710 INFO L93 Difference]: Finished difference Result 134 states and 249 transitions. [2022-01-11 03:30:30,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:30,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-11 03:30:30,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:30,711 INFO L225 Difference]: With dead ends: 134 [2022-01-11 03:30:30,712 INFO L226 Difference]: Without dead ends: 81 [2022-01-11 03:30:30,712 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:30,713 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 58 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:30,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 171 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:30,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-11 03:30:30,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-01-11 03:30:30,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 78 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 146 transitions. [2022-01-11 03:30:30,797 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 146 transitions. Word has length 19 [2022-01-11 03:30:30,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:30,797 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 146 transitions. [2022-01-11 03:30:30,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-11 03:30:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 146 transitions. [2022-01-11 03:30:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-11 03:30:30,799 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:30,799 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] [2022-01-11 03:30:30,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 03:30:30,800 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:30,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:30,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1292832236, now seen corresponding path program 1 times [2022-01-11 03:30:30,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:30,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925216595] [2022-01-11 03:30:30,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:30,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:30,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-11 03:30:30,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:30,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925216595] [2022-01-11 03:30:30,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925216595] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:30,877 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:30,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:30,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739970786] [2022-01-11 03:30:30,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:30,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:30,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:30,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:30,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:30,878 INFO L87 Difference]: Start difference. First operand 79 states and 146 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:30,907 INFO L93 Difference]: Finished difference Result 123 states and 222 transitions. [2022-01-11 03:30:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:30,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-01-11 03:30:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:30,908 INFO L225 Difference]: With dead ends: 123 [2022-01-11 03:30:30,908 INFO L226 Difference]: Without dead ends: 84 [2022-01-11 03:30:30,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:30,909 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:30,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:30,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-11 03:30:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-01-11 03:30:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.8271604938271604) internal successors, (148), 81 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 148 transitions. [2022-01-11 03:30:30,915 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 148 transitions. Word has length 20 [2022-01-11 03:30:30,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:30,915 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 148 transitions. [2022-01-11 03:30:30,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 148 transitions. [2022-01-11 03:30:30,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-11 03:30:30,916 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:30,916 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] [2022-01-11 03:30:30,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 03:30:30,917 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:30,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:30,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1803366413, now seen corresponding path program 1 times [2022-01-11 03:30:30,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:30,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795107949] [2022-01-11 03:30:30,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:30,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:30,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:30,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795107949] [2022-01-11 03:30:30,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795107949] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:30,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:30,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:30,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852517550] [2022-01-11 03:30:30,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:30,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:30,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:30,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:30,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:30,960 INFO L87 Difference]: Start difference. First operand 82 states and 148 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:30,970 INFO L93 Difference]: Finished difference Result 157 states and 285 transitions. [2022-01-11 03:30:30,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:30,971 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-01-11 03:30:30,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:30,972 INFO L225 Difference]: With dead ends: 157 [2022-01-11 03:30:30,972 INFO L226 Difference]: Without dead ends: 155 [2022-01-11 03:30:30,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:30,973 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 55 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:30,974 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:30,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-01-11 03:30:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2022-01-11 03:30:30,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.8240740740740742) internal successors, (197), 108 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 197 transitions. [2022-01-11 03:30:30,981 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 197 transitions. Word has length 20 [2022-01-11 03:30:30,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:30,981 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 197 transitions. [2022-01-11 03:30:30,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 197 transitions. [2022-01-11 03:30:30,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-11 03:30:30,982 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:30,982 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] [2022-01-11 03:30:30,982 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 03:30:30,982 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:30,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:30,983 INFO L85 PathProgramCache]: Analyzing trace with hash -295814604, now seen corresponding path program 1 times [2022-01-11 03:30:30,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:30,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804437225] [2022-01-11 03:30:30,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:30,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:31,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804437225] [2022-01-11 03:30:31,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804437225] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830338933] [2022-01-11 03:30:31,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,017 INFO L87 Difference]: Start difference. First operand 109 states and 197 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,028 INFO L93 Difference]: Finished difference Result 261 states and 475 transitions. [2022-01-11 03:30:31,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-01-11 03:30:31,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,029 INFO L225 Difference]: With dead ends: 261 [2022-01-11 03:30:31,029 INFO L226 Difference]: Without dead ends: 157 [2022-01-11 03:30:31,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,031 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-01-11 03:30:31,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2022-01-11 03:30:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.8116883116883118) internal successors, (279), 154 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 279 transitions. [2022-01-11 03:30:31,049 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 279 transitions. Word has length 20 [2022-01-11 03:30:31,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,049 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 279 transitions. [2022-01-11 03:30:31,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,049 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 279 transitions. [2022-01-11 03:30:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-11 03:30:31,050 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,050 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] [2022-01-11 03:30:31,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 03:30:31,050 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,051 INFO L85 PathProgramCache]: Analyzing trace with hash -69751785, now seen corresponding path program 1 times [2022-01-11 03:30:31,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070211393] [2022-01-11 03:30:31,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:31,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070211393] [2022-01-11 03:30:31,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070211393] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,093 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,093 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202095173] [2022-01-11 03:30:31,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,095 INFO L87 Difference]: Start difference. First operand 155 states and 279 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,103 INFO L93 Difference]: Finished difference Result 234 states and 418 transitions. [2022-01-11 03:30:31,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-01-11 03:30:31,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,105 INFO L225 Difference]: With dead ends: 234 [2022-01-11 03:30:31,105 INFO L226 Difference]: Without dead ends: 159 [2022-01-11 03:30:31,105 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,106 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 59 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,106 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:31,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-01-11 03:30:31,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2022-01-11 03:30:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.7884615384615385) internal successors, (279), 156 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2022-01-11 03:30:31,118 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 21 [2022-01-11 03:30:31,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,119 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2022-01-11 03:30:31,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,119 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2022-01-11 03:30:31,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-11 03:30:31,120 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,120 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] [2022-01-11 03:30:31,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-11 03:30:31,120 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,120 INFO L85 PathProgramCache]: Analyzing trace with hash -580285962, now seen corresponding path program 1 times [2022-01-11 03:30:31,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415880045] [2022-01-11 03:30:31,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:31,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415880045] [2022-01-11 03:30:31,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415880045] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221397248] [2022-01-11 03:30:31,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,165 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,181 INFO L93 Difference]: Finished difference Result 297 states and 533 transitions. [2022-01-11 03:30:31,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-01-11 03:30:31,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,183 INFO L225 Difference]: With dead ends: 297 [2022-01-11 03:30:31,183 INFO L226 Difference]: Without dead ends: 295 [2022-01-11 03:30:31,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,184 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 52 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:31,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-01-11 03:30:31,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 213. [2022-01-11 03:30:31,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 1.7688679245283019) internal successors, (375), 212 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 375 transitions. [2022-01-11 03:30:31,192 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 375 transitions. Word has length 21 [2022-01-11 03:30:31,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,193 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 375 transitions. [2022-01-11 03:30:31,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 375 transitions. [2022-01-11 03:30:31,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-11 03:30:31,194 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,194 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] [2022-01-11 03:30:31,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 03:30:31,194 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,194 INFO L85 PathProgramCache]: Analyzing trace with hash 927265847, now seen corresponding path program 1 times [2022-01-11 03:30:31,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100347927] [2022-01-11 03:30:31,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:31,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100347927] [2022-01-11 03:30:31,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100347927] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851601771] [2022-01-11 03:30:31,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,217 INFO L87 Difference]: Start difference. First operand 213 states and 375 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,226 INFO L93 Difference]: Finished difference Result 509 states and 901 transitions. [2022-01-11 03:30:31,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-01-11 03:30:31,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,227 INFO L225 Difference]: With dead ends: 509 [2022-01-11 03:30:31,227 INFO L226 Difference]: Without dead ends: 303 [2022-01-11 03:30:31,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,229 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 56 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 173 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:31,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-01-11 03:30:31,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2022-01-11 03:30:31,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.7566666666666666) internal successors, (527), 300 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 527 transitions. [2022-01-11 03:30:31,238 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 527 transitions. Word has length 21 [2022-01-11 03:30:31,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,238 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 527 transitions. [2022-01-11 03:30:31,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,238 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 527 transitions. [2022-01-11 03:30:31,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-11 03:30:31,239 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,239 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-11 03:30:31,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-11 03:30:31,239 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,240 INFO L85 PathProgramCache]: Analyzing trace with hash -808963344, now seen corresponding path program 1 times [2022-01-11 03:30:31,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303431299] [2022-01-11 03:30:31,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:31,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303431299] [2022-01-11 03:30:31,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303431299] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472599811] [2022-01-11 03:30:31,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,262 INFO L87 Difference]: Start difference. First operand 301 states and 527 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-11 03:30:31,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,270 INFO L93 Difference]: Finished difference Result 453 states and 789 transitions. [2022-01-11 03:30:31,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,271 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-11 03:30:31,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,272 INFO L225 Difference]: With dead ends: 453 [2022-01-11 03:30:31,272 INFO L226 Difference]: Without dead ends: 307 [2022-01-11 03:30:31,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,273 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 58 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,273 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-01-11 03:30:31,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-01-11 03:30:31,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.7335526315789473) internal successors, (527), 304 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 527 transitions. [2022-01-11 03:30:31,281 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 527 transitions. Word has length 22 [2022-01-11 03:30:31,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,281 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 527 transitions. [2022-01-11 03:30:31,281 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-11 03:30:31,281 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 527 transitions. [2022-01-11 03:30:31,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-11 03:30:31,282 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,282 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:31,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-11 03:30:31,283 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1319497521, now seen corresponding path program 1 times [2022-01-11 03:30:31,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219429561] [2022-01-11 03:30:31,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:31,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219429561] [2022-01-11 03:30:31,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219429561] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490138254] [2022-01-11 03:30:31,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,304 INFO L87 Difference]: Start difference. First operand 305 states and 527 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-11 03:30:31,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,319 INFO L93 Difference]: Finished difference Result 569 states and 997 transitions. [2022-01-11 03:30:31,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,319 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-11 03:30:31,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,321 INFO L225 Difference]: With dead ends: 569 [2022-01-11 03:30:31,322 INFO L226 Difference]: Without dead ends: 567 [2022-01-11 03:30:31,322 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,324 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 49 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-01-11 03:30:31,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 421. [2022-01-11 03:30:31,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.7023809523809523) internal successors, (715), 420 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 715 transitions. [2022-01-11 03:30:31,337 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 715 transitions. Word has length 22 [2022-01-11 03:30:31,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,338 INFO L470 AbstractCegarLoop]: Abstraction has 421 states and 715 transitions. [2022-01-11 03:30:31,338 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-11 03:30:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 715 transitions. [2022-01-11 03:30:31,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-11 03:30:31,344 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,344 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:31,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-11 03:30:31,344 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,346 INFO L85 PathProgramCache]: Analyzing trace with hash 188054288, now seen corresponding path program 1 times [2022-01-11 03:30:31,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204361579] [2022-01-11 03:30:31,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:31,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204361579] [2022-01-11 03:30:31,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204361579] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,385 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35848682] [2022-01-11 03:30:31,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,388 INFO L87 Difference]: Start difference. First operand 421 states and 715 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-11 03:30:31,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,401 INFO L93 Difference]: Finished difference Result 1001 states and 1709 transitions. [2022-01-11 03:30:31,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,402 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-11 03:30:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,404 INFO L225 Difference]: With dead ends: 1001 [2022-01-11 03:30:31,404 INFO L226 Difference]: Without dead ends: 591 [2022-01-11 03:30:31,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,407 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:31,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2022-01-11 03:30:31,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2022-01-11 03:30:31,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 588 states have (on average 1.6921768707482994) internal successors, (995), 588 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 995 transitions. [2022-01-11 03:30:31,423 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 995 transitions. Word has length 22 [2022-01-11 03:30:31,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,423 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 995 transitions. [2022-01-11 03:30:31,423 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-11 03:30:31,423 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 995 transitions. [2022-01-11 03:30:31,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 03:30:31,424 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,424 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] [2022-01-11 03:30:31,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-11 03:30:31,424 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2045282227, now seen corresponding path program 1 times [2022-01-11 03:30:31,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750056786] [2022-01-11 03:30:31,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:31,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750056786] [2022-01-11 03:30:31,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750056786] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653315935] [2022-01-11 03:30:31,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,464 INFO L87 Difference]: Start difference. First operand 589 states and 995 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,474 INFO L93 Difference]: Finished difference Result 885 states and 1489 transitions. [2022-01-11 03:30:31,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-11 03:30:31,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,477 INFO L225 Difference]: With dead ends: 885 [2022-01-11 03:30:31,477 INFO L226 Difference]: Without dead ends: 599 [2022-01-11 03:30:31,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,477 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:31,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-01-11 03:30:31,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2022-01-11 03:30:31,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.669463087248322) internal successors, (995), 596 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 995 transitions. [2022-01-11 03:30:31,488 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 995 transitions. Word has length 23 [2022-01-11 03:30:31,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,488 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 995 transitions. [2022-01-11 03:30:31,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,488 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 995 transitions. [2022-01-11 03:30:31,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 03:30:31,489 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,490 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] [2022-01-11 03:30:31,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 03:30:31,490 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1534748050, now seen corresponding path program 1 times [2022-01-11 03:30:31,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937970529] [2022-01-11 03:30:31,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,492 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:31,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937970529] [2022-01-11 03:30:31,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937970529] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291035401] [2022-01-11 03:30:31,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,527 INFO L87 Difference]: Start difference. First operand 597 states and 995 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,542 INFO L93 Difference]: Finished difference Result 1097 states and 1861 transitions. [2022-01-11 03:30:31,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-11 03:30:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,546 INFO L225 Difference]: With dead ends: 1097 [2022-01-11 03:30:31,546 INFO L226 Difference]: Without dead ends: 1095 [2022-01-11 03:30:31,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,548 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:31,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2022-01-11 03:30:31,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 837. [2022-01-11 03:30:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.6303827751196172) internal successors, (1363), 836 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1363 transitions. [2022-01-11 03:30:31,561 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1363 transitions. Word has length 23 [2022-01-11 03:30:31,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,562 INFO L470 AbstractCegarLoop]: Abstraction has 837 states and 1363 transitions. [2022-01-11 03:30:31,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,562 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1363 transitions. [2022-01-11 03:30:31,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-11 03:30:31,563 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,563 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:31,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-11 03:30:31,563 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1252667437, now seen corresponding path program 1 times [2022-01-11 03:30:31,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295518435] [2022-01-11 03:30:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,564 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:31,588 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295518435] [2022-01-11 03:30:31,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295518435] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,588 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,588 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807083114] [2022-01-11 03:30:31,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,589 INFO L87 Difference]: Start difference. First operand 837 states and 1363 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,618 INFO L93 Difference]: Finished difference Result 1977 states and 3237 transitions. [2022-01-11 03:30:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-01-11 03:30:31,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,623 INFO L225 Difference]: With dead ends: 1977 [2022-01-11 03:30:31,623 INFO L226 Difference]: Without dead ends: 1159 [2022-01-11 03:30:31,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,624 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:31,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-01-11 03:30:31,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2022-01-11 03:30:31,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.6219723183391004) internal successors, (1875), 1156 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1875 transitions. [2022-01-11 03:30:31,642 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1875 transitions. Word has length 23 [2022-01-11 03:30:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,642 INFO L470 AbstractCegarLoop]: Abstraction has 1157 states and 1875 transitions. [2022-01-11 03:30:31,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1875 transitions. [2022-01-11 03:30:31,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-11 03:30:31,643 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,643 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] [2022-01-11 03:30:31,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-11 03:30:31,643 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,644 INFO L85 PathProgramCache]: Analyzing trace with hash 332581836, now seen corresponding path program 1 times [2022-01-11 03:30:31,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213184843] [2022-01-11 03:30:31,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:31,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213184843] [2022-01-11 03:30:31,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213184843] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207913895] [2022-01-11 03:30:31,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,669 INFO L87 Difference]: Start difference. First operand 1157 states and 1875 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,689 INFO L93 Difference]: Finished difference Result 1737 states and 2805 transitions. [2022-01-11 03:30:31,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-11 03:30:31,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,692 INFO L225 Difference]: With dead ends: 1737 [2022-01-11 03:30:31,692 INFO L226 Difference]: Without dead ends: 1175 [2022-01-11 03:30:31,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,695 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2022-01-11 03:30:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1173. [2022-01-11 03:30:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.5998293515358362) internal successors, (1875), 1172 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1875 transitions. [2022-01-11 03:30:31,723 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1875 transitions. Word has length 24 [2022-01-11 03:30:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,723 INFO L470 AbstractCegarLoop]: Abstraction has 1173 states and 1875 transitions. [2022-01-11 03:30:31,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1875 transitions. [2022-01-11 03:30:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-11 03:30:31,725 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,725 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] [2022-01-11 03:30:31,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-11 03:30:31,725 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash -177952341, now seen corresponding path program 1 times [2022-01-11 03:30:31,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426819993] [2022-01-11 03:30:31,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:31,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426819993] [2022-01-11 03:30:31,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426819993] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,754 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123126088] [2022-01-11 03:30:31,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,755 INFO L87 Difference]: Start difference. First operand 1173 states and 1875 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,780 INFO L93 Difference]: Finished difference Result 2121 states and 3461 transitions. [2022-01-11 03:30:31,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-11 03:30:31,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,785 INFO L225 Difference]: With dead ends: 2121 [2022-01-11 03:30:31,785 INFO L226 Difference]: Without dead ends: 2119 [2022-01-11 03:30:31,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,787 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:31,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2022-01-11 03:30:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1669. [2022-01-11 03:30:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1668 states have (on average 1.5557553956834533) internal successors, (2595), 1668 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2595 transitions. [2022-01-11 03:30:31,817 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2595 transitions. Word has length 24 [2022-01-11 03:30:31,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,818 INFO L470 AbstractCegarLoop]: Abstraction has 1669 states and 2595 transitions. [2022-01-11 03:30:31,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2595 transitions. [2022-01-11 03:30:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-11 03:30:31,819 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,819 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] [2022-01-11 03:30:31,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-11 03:30:31,819 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1329599468, now seen corresponding path program 1 times [2022-01-11 03:30:31,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879883457] [2022-01-11 03:30:31,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:31,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879883457] [2022-01-11 03:30:31,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879883457] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014417425] [2022-01-11 03:30:31,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,844 INFO L87 Difference]: Start difference. First operand 1669 states and 2595 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,869 INFO L93 Difference]: Finished difference Result 3913 states and 6117 transitions. [2022-01-11 03:30:31,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-01-11 03:30:31,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,875 INFO L225 Difference]: With dead ends: 3913 [2022-01-11 03:30:31,875 INFO L226 Difference]: Without dead ends: 2279 [2022-01-11 03:30:31,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,878 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2022-01-11 03:30:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2277. [2022-01-11 03:30:31,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 2276 states have (on average 1.5478910369068541) internal successors, (3523), 2276 states have internal predecessors, (3523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 3523 transitions. [2022-01-11 03:30:31,920 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 3523 transitions. Word has length 24 [2022-01-11 03:30:31,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:31,921 INFO L470 AbstractCegarLoop]: Abstraction has 2277 states and 3523 transitions. [2022-01-11 03:30:31,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3523 transitions. [2022-01-11 03:30:31,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-11 03:30:31,922 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:31,922 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] [2022-01-11 03:30:31,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-11 03:30:31,922 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:31,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:31,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1221522609, now seen corresponding path program 1 times [2022-01-11 03:30:31,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:31,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648348804] [2022-01-11 03:30:31,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:31,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:31,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:31,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648348804] [2022-01-11 03:30:31,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648348804] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:31,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:31,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:31,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032267518] [2022-01-11 03:30:31,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:31,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:31,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:31,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:31,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,944 INFO L87 Difference]: Start difference. First operand 2277 states and 3523 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:31,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:31,970 INFO L93 Difference]: Finished difference Result 3417 states and 5269 transitions. [2022-01-11 03:30:31,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:31,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-01-11 03:30:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:31,975 INFO L225 Difference]: With dead ends: 3417 [2022-01-11 03:30:31,975 INFO L226 Difference]: Without dead ends: 2311 [2022-01-11 03:30:31,976 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:31,977 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 55 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:31,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:31,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-01-11 03:30:32,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2309. [2022-01-11 03:30:32,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.5264298093587523) internal successors, (3523), 2308 states have internal predecessors, (3523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3523 transitions. [2022-01-11 03:30:32,027 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3523 transitions. Word has length 25 [2022-01-11 03:30:32,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:32,028 INFO L470 AbstractCegarLoop]: Abstraction has 2309 states and 3523 transitions. [2022-01-11 03:30:32,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3523 transitions. [2022-01-11 03:30:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-11 03:30:32,029 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:32,029 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] [2022-01-11 03:30:32,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-11 03:30:32,029 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:32,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:32,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1732056786, now seen corresponding path program 1 times [2022-01-11 03:30:32,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:32,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188316886] [2022-01-11 03:30:32,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:32,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:32,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:32,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188316886] [2022-01-11 03:30:32,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188316886] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:32,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:32,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:32,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291374780] [2022-01-11 03:30:32,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:32,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:32,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:32,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:32,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:32,052 INFO L87 Difference]: Start difference. First operand 2309 states and 3523 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:32,084 INFO L93 Difference]: Finished difference Result 4105 states and 6405 transitions. [2022-01-11 03:30:32,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:32,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-01-11 03:30:32,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:32,095 INFO L225 Difference]: With dead ends: 4105 [2022-01-11 03:30:32,095 INFO L226 Difference]: Without dead ends: 4103 [2022-01-11 03:30:32,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:32,097 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 40 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:32,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2022-01-11 03:30:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 3333. [2022-01-11 03:30:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.4798919567827131) internal successors, (4931), 3332 states have internal predecessors, (4931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4931 transitions. [2022-01-11 03:30:32,162 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4931 transitions. Word has length 25 [2022-01-11 03:30:32,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:32,162 INFO L470 AbstractCegarLoop]: Abstraction has 3333 states and 4931 transitions. [2022-01-11 03:30:32,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4931 transitions. [2022-01-11 03:30:32,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-11 03:30:32,166 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:32,166 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] [2022-01-11 03:30:32,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-11 03:30:32,166 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:32,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:32,167 INFO L85 PathProgramCache]: Analyzing trace with hash -224504977, now seen corresponding path program 1 times [2022-01-11 03:30:32,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:32,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553725131] [2022-01-11 03:30:32,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:32,167 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:32,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:32,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553725131] [2022-01-11 03:30:32,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553725131] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:32,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:32,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:32,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69884733] [2022-01-11 03:30:32,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:32,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:32,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:32,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:32,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:32,184 INFO L87 Difference]: Start difference. First operand 3333 states and 4931 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:32,232 INFO L93 Difference]: Finished difference Result 7753 states and 11525 transitions. [2022-01-11 03:30:32,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:32,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-01-11 03:30:32,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:32,243 INFO L225 Difference]: With dead ends: 7753 [2022-01-11 03:30:32,243 INFO L226 Difference]: Without dead ends: 4487 [2022-01-11 03:30:32,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:32,248 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:32,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:32,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2022-01-11 03:30:32,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 4485. [2022-01-11 03:30:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4485 states, 4484 states have (on average 1.47078501338091) internal successors, (6595), 4484 states have internal predecessors, (6595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6595 transitions. [2022-01-11 03:30:32,350 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6595 transitions. Word has length 25 [2022-01-11 03:30:32,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:32,350 INFO L470 AbstractCegarLoop]: Abstraction has 4485 states and 6595 transitions. [2022-01-11 03:30:32,350 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,350 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6595 transitions. [2022-01-11 03:30:32,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-11 03:30:32,355 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:32,355 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] [2022-01-11 03:30:32,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-11 03:30:32,355 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:32,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:32,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2140847272, now seen corresponding path program 1 times [2022-01-11 03:30:32,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:32,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8174673] [2022-01-11 03:30:32,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:32,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:32,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:32,371 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:32,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8174673] [2022-01-11 03:30:32,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8174673] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:32,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:32,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:32,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140879885] [2022-01-11 03:30:32,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:32,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:32,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:32,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:32,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:32,373 INFO L87 Difference]: Start difference. First operand 4485 states and 6595 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:32,415 INFO L93 Difference]: Finished difference Result 6729 states and 9861 transitions. [2022-01-11 03:30:32,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:32,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-01-11 03:30:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:32,436 INFO L225 Difference]: With dead ends: 6729 [2022-01-11 03:30:32,436 INFO L226 Difference]: Without dead ends: 4551 [2022-01-11 03:30:32,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:32,439 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:32,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:32,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2022-01-11 03:30:32,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 4549. [2022-01-11 03:30:32,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4549 states, 4548 states have (on average 1.4500879507475815) internal successors, (6595), 4548 states have internal predecessors, (6595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 6595 transitions. [2022-01-11 03:30:32,510 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 6595 transitions. Word has length 26 [2022-01-11 03:30:32,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:32,511 INFO L470 AbstractCegarLoop]: Abstraction has 4549 states and 6595 transitions. [2022-01-11 03:30:32,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 6595 transitions. [2022-01-11 03:30:32,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-11 03:30:32,514 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:32,514 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] [2022-01-11 03:30:32,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-11 03:30:32,514 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:32,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:32,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1630313095, now seen corresponding path program 1 times [2022-01-11 03:30:32,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:32,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075500145] [2022-01-11 03:30:32,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:32,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:32,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:32,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075500145] [2022-01-11 03:30:32,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075500145] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:32,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:32,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:32,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825226052] [2022-01-11 03:30:32,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:32,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:32,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:32,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:32,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:32,546 INFO L87 Difference]: Start difference. First operand 4549 states and 6595 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:32,646 INFO L93 Difference]: Finished difference Result 13257 states and 19013 transitions. [2022-01-11 03:30:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:32,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-01-11 03:30:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:32,657 INFO L225 Difference]: With dead ends: 13257 [2022-01-11 03:30:32,657 INFO L226 Difference]: Without dead ends: 8839 [2022-01-11 03:30:32,662 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:32,663 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:32,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:32,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8839 states. [2022-01-11 03:30:32,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8839 to 8837. [2022-01-11 03:30:32,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8837 states, 8836 states have (on average 1.4055002263467633) internal successors, (12419), 8836 states have internal predecessors, (12419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 12419 transitions. [2022-01-11 03:30:32,810 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 12419 transitions. Word has length 26 [2022-01-11 03:30:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:32,811 INFO L470 AbstractCegarLoop]: Abstraction has 8837 states and 12419 transitions. [2022-01-11 03:30:32,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 12419 transitions. [2022-01-11 03:30:32,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-11 03:30:32,817 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:32,817 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] [2022-01-11 03:30:32,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-11 03:30:32,818 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:32,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:32,818 INFO L85 PathProgramCache]: Analyzing trace with hash 122761286, now seen corresponding path program 1 times [2022-01-11 03:30:32,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:32,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585540111] [2022-01-11 03:30:32,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:32,818 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:32,846 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:32,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585540111] [2022-01-11 03:30:32,846 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585540111] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:32,846 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:32,846 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:32,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720442320] [2022-01-11 03:30:32,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:32,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:32,847 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:32,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:32,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:32,847 INFO L87 Difference]: Start difference. First operand 8837 states and 12419 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:32,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:32,957 INFO L93 Difference]: Finished difference Result 10121 states and 14725 transitions. [2022-01-11 03:30:32,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:32,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-01-11 03:30:32,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:32,971 INFO L225 Difference]: With dead ends: 10121 [2022-01-11 03:30:32,971 INFO L226 Difference]: Without dead ends: 10119 [2022-01-11 03:30:32,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:32,973 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 37 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 181 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-11 03:30:32,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 181 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10119 states. [2022-01-11 03:30:33,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10119 to 8837. [2022-01-11 03:30:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8837 states, 8836 states have (on average 1.391014033499321) internal successors, (12291), 8836 states have internal predecessors, (12291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 12291 transitions. [2022-01-11 03:30:33,099 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 12291 transitions. Word has length 26 [2022-01-11 03:30:33,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:33,099 INFO L470 AbstractCegarLoop]: Abstraction has 8837 states and 12291 transitions. [2022-01-11 03:30:33,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:33,099 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 12291 transitions. [2022-01-11 03:30:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-11 03:30:33,105 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:33,105 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-11 03:30:33,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-11 03:30:33,105 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:33,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:33,105 INFO L85 PathProgramCache]: Analyzing trace with hash -999868693, now seen corresponding path program 1 times [2022-01-11 03:30:33,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:33,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801955633] [2022-01-11 03:30:33,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:33,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:33,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:33,121 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:33,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801955633] [2022-01-11 03:30:33,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801955633] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:33,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:33,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:33,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38170708] [2022-01-11 03:30:33,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:33,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:33,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:33,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:33,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:33,122 INFO L87 Difference]: Start difference. First operand 8837 states and 12291 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-11 03:30:33,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:33,236 INFO L93 Difference]: Finished difference Result 15241 states and 21637 transitions. [2022-01-11 03:30:33,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:33,236 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-11 03:30:33,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:33,256 INFO L225 Difference]: With dead ends: 15241 [2022-01-11 03:30:33,257 INFO L226 Difference]: Without dead ends: 15239 [2022-01-11 03:30:33,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-11 03:30:33,260 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 34 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:33,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15239 states. [2022-01-11 03:30:33,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15239 to 13189. [2022-01-11 03:30:33,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13189 states, 13188 states have (on average 1.3493327267212618) internal successors, (17795), 13188 states have internal predecessors, (17795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:33,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13189 states to 13189 states and 17795 transitions. [2022-01-11 03:30:33,509 INFO L78 Accepts]: Start accepts. Automaton has 13189 states and 17795 transitions. Word has length 27 [2022-01-11 03:30:33,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:33,509 INFO L470 AbstractCegarLoop]: Abstraction has 13189 states and 17795 transitions. [2022-01-11 03:30:33,509 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-11 03:30:33,509 INFO L276 IsEmpty]: Start isEmpty. Operand 13189 states and 17795 transitions. [2022-01-11 03:30:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-11 03:30:33,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:33,519 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-11 03:30:33,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-11 03:30:33,519 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:33,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:33,519 INFO L85 PathProgramCache]: Analyzing trace with hash 507683116, now seen corresponding path program 1 times [2022-01-11 03:30:33,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:33,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677624953] [2022-01-11 03:30:33,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:33,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:33,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:33,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:33,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677624953] [2022-01-11 03:30:33,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677624953] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:33,536 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:33,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:33,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934736595] [2022-01-11 03:30:33,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:33,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:33,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:33,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:33,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:33,538 INFO L87 Difference]: Start difference. First operand 13189 states and 17795 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-11 03:30:33,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:33,673 INFO L93 Difference]: Finished difference Result 30345 states and 41093 transitions. [2022-01-11 03:30:33,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:33,673 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-11 03:30:33,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:33,698 INFO L225 Difference]: With dead ends: 30345 [2022-01-11 03:30:33,698 INFO L226 Difference]: Without dead ends: 17287 [2022-01-11 03:30:33,715 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:33,716 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:33,719 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 179 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:33,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17287 states. [2022-01-11 03:30:33,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17287 to 17285. [2022-01-11 03:30:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17285 states, 17284 states have (on average 1.3331983337190465) internal successors, (23043), 17284 states have internal predecessors, (23043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:34,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17285 states to 17285 states and 23043 transitions. [2022-01-11 03:30:34,038 INFO L78 Accepts]: Start accepts. Automaton has 17285 states and 23043 transitions. Word has length 27 [2022-01-11 03:30:34,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:34,038 INFO L470 AbstractCegarLoop]: Abstraction has 17285 states and 23043 transitions. [2022-01-11 03:30:34,038 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-11 03:30:34,038 INFO L276 IsEmpty]: Start isEmpty. Operand 17285 states and 23043 transitions. [2022-01-11 03:30:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-11 03:30:34,050 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:34,050 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] [2022-01-11 03:30:34,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-11 03:30:34,050 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:34,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:34,051 INFO L85 PathProgramCache]: Analyzing trace with hash -931125373, now seen corresponding path program 1 times [2022-01-11 03:30:34,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:34,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541972143] [2022-01-11 03:30:34,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:34,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:34,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:34,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541972143] [2022-01-11 03:30:34,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541972143] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:34,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:34,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:34,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065549618] [2022-01-11 03:30:34,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:34,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:34,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:34,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:34,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:34,069 INFO L87 Difference]: Start difference. First operand 17285 states and 23043 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:34,263 INFO L93 Difference]: Finished difference Result 26121 states and 34821 transitions. [2022-01-11 03:30:34,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:34,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-01-11 03:30:34,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:34,286 INFO L225 Difference]: With dead ends: 26121 [2022-01-11 03:30:34,286 INFO L226 Difference]: Without dead ends: 17671 [2022-01-11 03:30:34,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:34,293 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 52 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:34,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:34,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17671 states. [2022-01-11 03:30:34,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17671 to 17669. [2022-01-11 03:30:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17669 states, 17668 states have (on average 1.318711795336201) internal successors, (23299), 17668 states have internal predecessors, (23299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17669 states to 17669 states and 23299 transitions. [2022-01-11 03:30:34,514 INFO L78 Accepts]: Start accepts. Automaton has 17669 states and 23299 transitions. Word has length 28 [2022-01-11 03:30:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:34,514 INFO L470 AbstractCegarLoop]: Abstraction has 17669 states and 23299 transitions. [2022-01-11 03:30:34,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 17669 states and 23299 transitions. [2022-01-11 03:30:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-11 03:30:34,525 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:34,525 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] [2022-01-11 03:30:34,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-11 03:30:34,526 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:34,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:34,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1441659550, now seen corresponding path program 1 times [2022-01-11 03:30:34,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:34,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556575859] [2022-01-11 03:30:34,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:34,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:34,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:34,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:34,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556575859] [2022-01-11 03:30:34,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556575859] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:34,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:34,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:34,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326602607] [2022-01-11 03:30:34,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:34,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:34,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:34,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:34,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:34,550 INFO L87 Difference]: Start difference. First operand 17669 states and 23299 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:34,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:34,792 INFO L93 Difference]: Finished difference Result 29705 states and 39685 transitions. [2022-01-11 03:30:34,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:34,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-01-11 03:30:34,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:34,843 INFO L225 Difference]: With dead ends: 29705 [2022-01-11 03:30:34,844 INFO L226 Difference]: Without dead ends: 29703 [2022-01-11 03:30:34,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:34,850 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 31 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:34,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29703 states. [2022-01-11 03:30:35,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29703 to 26629. [2022-01-11 03:30:35,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26629 states, 26628 states have (on average 1.2787667117320114) internal successors, (34051), 26628 states have internal predecessors, (34051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26629 states to 26629 states and 34051 transitions. [2022-01-11 03:30:35,232 INFO L78 Accepts]: Start accepts. Automaton has 26629 states and 34051 transitions. Word has length 28 [2022-01-11 03:30:35,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:35,232 INFO L470 AbstractCegarLoop]: Abstraction has 26629 states and 34051 transitions. [2022-01-11 03:30:35,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 26629 states and 34051 transitions. [2022-01-11 03:30:35,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-11 03:30:35,254 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:35,254 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 03:30:35,254 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-11 03:30:35,254 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:35,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:35,255 INFO L85 PathProgramCache]: Analyzing trace with hash 65892259, now seen corresponding path program 1 times [2022-01-11 03:30:35,255 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:35,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912852410] [2022-01-11 03:30:35,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:35,255 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:35,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:35,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:35,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912852410] [2022-01-11 03:30:35,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912852410] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:35,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:35,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:35,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462449724] [2022-01-11 03:30:35,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:35,270 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:35,270 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:35,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:35,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:35,270 INFO L87 Difference]: Start difference. First operand 26629 states and 34051 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:35,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:35,733 INFO L93 Difference]: Finished difference Result 60425 states and 77061 transitions. [2022-01-11 03:30:35,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:35,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-01-11 03:30:35,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:35,774 INFO L225 Difference]: With dead ends: 60425 [2022-01-11 03:30:35,775 INFO L226 Difference]: Without dead ends: 34311 [2022-01-11 03:30:35,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:35,793 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:35,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:35,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34311 states. [2022-01-11 03:30:36,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34311 to 34309. [2022-01-11 03:30:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34309 states, 34308 states have (on average 1.2536726128016789) internal successors, (43011), 34308 states have internal predecessors, (43011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:36,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34309 states to 34309 states and 43011 transitions. [2022-01-11 03:30:36,323 INFO L78 Accepts]: Start accepts. Automaton has 34309 states and 43011 transitions. Word has length 28 [2022-01-11 03:30:36,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:36,323 INFO L470 AbstractCegarLoop]: Abstraction has 34309 states and 43011 transitions. [2022-01-11 03:30:36,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:36,324 INFO L276 IsEmpty]: Start isEmpty. Operand 34309 states and 43011 transitions. [2022-01-11 03:30:36,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-11 03:30:36,338 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:36,338 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] [2022-01-11 03:30:36,338 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-11 03:30:36,338 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:36,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:36,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1741739928, now seen corresponding path program 1 times [2022-01-11 03:30:36,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:36,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349301049] [2022-01-11 03:30:36,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:36,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:36,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:36,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:36,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349301049] [2022-01-11 03:30:36,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349301049] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:36,354 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:36,354 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:36,354 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535897103] [2022-01-11 03:30:36,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:36,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:36,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:36,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:36,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:36,355 INFO L87 Difference]: Start difference. First operand 34309 states and 43011 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:36,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:36,698 INFO L93 Difference]: Finished difference Result 51465 states and 64261 transitions. [2022-01-11 03:30:36,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:36,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-01-11 03:30:36,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:36,741 INFO L225 Difference]: With dead ends: 51465 [2022-01-11 03:30:36,742 INFO L226 Difference]: Without dead ends: 34823 [2022-01-11 03:30:36,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:36,761 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 51 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:36,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:36,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34823 states. [2022-01-11 03:30:37,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34823 to 34821. [2022-01-11 03:30:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34821 states, 34820 states have (on average 1.23523836875359) internal successors, (43011), 34820 states have internal predecessors, (43011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:37,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 43011 transitions. [2022-01-11 03:30:37,387 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 43011 transitions. Word has length 29 [2022-01-11 03:30:37,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:37,387 INFO L470 AbstractCegarLoop]: Abstraction has 34821 states and 43011 transitions. [2022-01-11 03:30:37,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:37,387 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 43011 transitions. [2022-01-11 03:30:37,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-11 03:30:37,405 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:37,405 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] [2022-01-11 03:30:37,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-11 03:30:37,406 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:37,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:37,406 INFO L85 PathProgramCache]: Analyzing trace with hash 2042693191, now seen corresponding path program 1 times [2022-01-11 03:30:37,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:37,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038497656] [2022-01-11 03:30:37,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:37,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:37,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:37,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038497656] [2022-01-11 03:30:37,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038497656] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:37,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:37,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:37,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260632117] [2022-01-11 03:30:37,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:37,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:37,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:37,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:37,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:37,421 INFO L87 Difference]: Start difference. First operand 34821 states and 43011 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:37,885 INFO L93 Difference]: Finished difference Result 57353 states and 71173 transitions. [2022-01-11 03:30:37,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:37,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-01-11 03:30:37,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:37,948 INFO L225 Difference]: With dead ends: 57353 [2022-01-11 03:30:37,949 INFO L226 Difference]: Without dead ends: 57351 [2022-01-11 03:30:37,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:37,968 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 28 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:37,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:38,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57351 states. [2022-01-11 03:30:38,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57351 to 53253. [2022-01-11 03:30:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53253 states, 53252 states have (on average 1.2018891309246602) internal successors, (64003), 53252 states have internal predecessors, (64003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53253 states to 53253 states and 64003 transitions. [2022-01-11 03:30:38,894 INFO L78 Accepts]: Start accepts. Automaton has 53253 states and 64003 transitions. Word has length 29 [2022-01-11 03:30:38,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:38,895 INFO L470 AbstractCegarLoop]: Abstraction has 53253 states and 64003 transitions. [2022-01-11 03:30:38,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:38,895 INFO L276 IsEmpty]: Start isEmpty. Operand 53253 states and 64003 transitions. [2022-01-11 03:30:38,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-11 03:30:38,926 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:38,926 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] [2022-01-11 03:30:38,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-11 03:30:38,926 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:38,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:38,926 INFO L85 PathProgramCache]: Analyzing trace with hash -744722296, now seen corresponding path program 1 times [2022-01-11 03:30:38,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:38,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859106827] [2022-01-11 03:30:38,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:38,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:38,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:38,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859106827] [2022-01-11 03:30:38,943 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859106827] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:38,943 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:38,943 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:38,943 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490524217] [2022-01-11 03:30:38,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:38,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:38,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:38,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:38,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:38,944 INFO L87 Difference]: Start difference. First operand 53253 states and 64003 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:39,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:39,676 INFO L93 Difference]: Finished difference Result 119817 states and 142853 transitions. [2022-01-11 03:30:39,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:39,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2022-01-11 03:30:39,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:39,750 INFO L225 Difference]: With dead ends: 119817 [2022-01-11 03:30:39,750 INFO L226 Difference]: Without dead ends: 67591 [2022-01-11 03:30:39,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:39,790 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 48 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:39,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 181 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:39,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67591 states. [2022-01-11 03:30:40,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67591 to 67589. [2022-01-11 03:30:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67589 states, 67588 states have (on average 1.166642007456945) internal successors, (78851), 67588 states have internal predecessors, (78851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67589 states to 67589 states and 78851 transitions. [2022-01-11 03:30:41,168 INFO L78 Accepts]: Start accepts. Automaton has 67589 states and 78851 transitions. Word has length 29 [2022-01-11 03:30:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:41,168 INFO L470 AbstractCegarLoop]: Abstraction has 67589 states and 78851 transitions. [2022-01-11 03:30:41,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 67589 states and 78851 transitions. [2022-01-11 03:30:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-11 03:30:41,284 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:41,284 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] [2022-01-11 03:30:41,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-11 03:30:41,285 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:41,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:41,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1100987233, now seen corresponding path program 1 times [2022-01-11 03:30:41,285 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:41,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181684951] [2022-01-11 03:30:41,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:41,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:41,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:41,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181684951] [2022-01-11 03:30:41,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181684951] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:41,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:41,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:41,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003188668] [2022-01-11 03:30:41,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:41,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:41,299 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:41,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:41,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:41,300 INFO L87 Difference]: Start difference. First operand 67589 states and 78851 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:41,863 INFO L93 Difference]: Finished difference Result 101385 states and 117765 transitions. [2022-01-11 03:30:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:41,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-01-11 03:30:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:41,935 INFO L225 Difference]: With dead ends: 101385 [2022-01-11 03:30:41,935 INFO L226 Difference]: Without dead ends: 68615 [2022-01-11 03:30:41,958 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:41,958 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 50 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:41,959 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:41,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68615 states. [2022-01-11 03:30:42,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68615 to 68613. [2022-01-11 03:30:42,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68613 states, 68612 states have (on average 1.1492304553139392) internal successors, (78851), 68612 states have internal predecessors, (78851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68613 states to 68613 states and 78851 transitions. [2022-01-11 03:30:43,051 INFO L78 Accepts]: Start accepts. Automaton has 68613 states and 78851 transitions. Word has length 30 [2022-01-11 03:30:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:43,051 INFO L470 AbstractCegarLoop]: Abstraction has 68613 states and 78851 transitions. [2022-01-11 03:30:43,053 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:43,053 INFO L276 IsEmpty]: Start isEmpty. Operand 68613 states and 78851 transitions. [2022-01-11 03:30:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-11 03:30:43,097 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:43,097 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] [2022-01-11 03:30:43,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-11 03:30:43,097 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:43,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:43,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1611521410, now seen corresponding path program 1 times [2022-01-11 03:30:43,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:43,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681873245] [2022-01-11 03:30:43,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:43,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:43,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:43,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681873245] [2022-01-11 03:30:43,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681873245] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:43,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:43,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:43,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645994199] [2022-01-11 03:30:43,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:43,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:43,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:43,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:43,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:43,113 INFO L87 Difference]: Start difference. First operand 68613 states and 78851 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:44,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:44,139 INFO L93 Difference]: Finished difference Result 110599 states and 125956 transitions. [2022-01-11 03:30:44,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:44,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-01-11 03:30:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:44,269 INFO L225 Difference]: With dead ends: 110599 [2022-01-11 03:30:44,269 INFO L226 Difference]: Without dead ends: 110597 [2022-01-11 03:30:44,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:44,287 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 24 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:44,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:44,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110597 states. [2022-01-11 03:30:45,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110597 to 106501. [2022-01-11 03:30:46,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106501 states, 106500 states have (on average 1.1249859154929578) internal successors, (119811), 106500 states have internal predecessors, (119811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106501 states to 106501 states and 119811 transitions. [2022-01-11 03:30:46,276 INFO L78 Accepts]: Start accepts. Automaton has 106501 states and 119811 transitions. Word has length 30 [2022-01-11 03:30:46,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:46,276 INFO L470 AbstractCegarLoop]: Abstraction has 106501 states and 119811 transitions. [2022-01-11 03:30:46,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:46,276 INFO L276 IsEmpty]: Start isEmpty. Operand 106501 states and 119811 transitions. [2022-01-11 03:30:46,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-11 03:30:46,349 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 03:30:46,349 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] [2022-01-11 03:30:46,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-11 03:30:46,349 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 03:30:46,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 03:30:46,350 INFO L85 PathProgramCache]: Analyzing trace with hash -103969601, now seen corresponding path program 1 times [2022-01-11 03:30:46,350 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 03:30:46,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654992581] [2022-01-11 03:30:46,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 03:30:46,350 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 03:30:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 03:30:46,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 03:30:46,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 03:30:46,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654992581] [2022-01-11 03:30:46,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654992581] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 03:30:46,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 03:30:46,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 03:30:46,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556002529] [2022-01-11 03:30:46,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 03:30:46,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 03:30:46,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 03:30:46,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 03:30:46,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:46,365 INFO L87 Difference]: Start difference. First operand 106501 states and 119811 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 03:30:47,772 INFO L93 Difference]: Finished difference Result 237573 states and 263171 transitions. [2022-01-11 03:30:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 03:30:47,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-01-11 03:30:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 03:30:47,773 INFO L225 Difference]: With dead ends: 237573 [2022-01-11 03:30:47,773 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 03:30:47,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 03:30:47,848 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 03:30:47,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 03:30:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 03:30:47,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 03:30:47,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:47,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 03:30:47,849 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-01-11 03:30:47,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 03:30:47,849 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 03:30:47,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 03:30:47,849 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 03:30:47,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 03:30:47,852 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 03:30:47,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-11 03:30:47,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-11 03:30:47,865 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-11 03:30:47,866 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-11 03:30:47,866 INFO L861 garLoopResultBuilder]: At program point L183-1(lines 47 188) the Hoare annotation is: true [2022-01-11 03:30:47,866 INFO L861 garLoopResultBuilder]: At program point L189(lines 7 193) the Hoare annotation is: true [2022-01-11 03:30:47,866 INFO L858 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2022-01-11 03:30:47,866 INFO L861 garLoopResultBuilder]: At program point L192(lines 6 193) the Hoare annotation is: true [2022-01-11 03:30:47,866 INFO L858 garLoopResultBuilder]: For program point L78(lines 78 80) no Hoare annotation was computed. [2022-01-11 03:30:47,866 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-11 03:30:47,866 INFO L858 garLoopResultBuilder]: For program point L78-2(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,866 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-11 03:30:47,866 INFO L858 garLoopResultBuilder]: For program point L82-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,866 INFO L858 garLoopResultBuilder]: For program point L86-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,866 INFO L858 garLoopResultBuilder]: For program point L90-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,866 INFO L858 garLoopResultBuilder]: For program point L94-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,867 INFO L858 garLoopResultBuilder]: For program point L98-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,867 INFO L858 garLoopResultBuilder]: For program point L102-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,867 INFO L858 garLoopResultBuilder]: For program point L106-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,867 INFO L858 garLoopResultBuilder]: For program point L110-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,867 INFO L858 garLoopResultBuilder]: For program point L114-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,867 INFO L858 garLoopResultBuilder]: For program point L118-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,867 INFO L858 garLoopResultBuilder]: For program point L122-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,867 INFO L858 garLoopResultBuilder]: For program point L129(line 129) no Hoare annotation was computed. [2022-01-11 03:30:47,867 INFO L858 garLoopResultBuilder]: For program point L128-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,867 INFO L854 garLoopResultBuilder]: At program point L184-1(lines 7 193) the Hoare annotation is: false [2022-01-11 03:30:47,867 INFO L858 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2022-01-11 03:30:47,867 INFO L858 garLoopResultBuilder]: For program point L133-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,867 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 191) no Hoare annotation was computed. [2022-01-11 03:30:47,867 INFO L858 garLoopResultBuilder]: For program point L139(line 139) no Hoare annotation was computed. [2022-01-11 03:30:47,868 INFO L858 garLoopResultBuilder]: For program point L138-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,868 INFO L858 garLoopResultBuilder]: For program point L144(line 144) no Hoare annotation was computed. [2022-01-11 03:30:47,868 INFO L858 garLoopResultBuilder]: For program point L143-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,868 INFO L858 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2022-01-11 03:30:47,868 INFO L858 garLoopResultBuilder]: For program point L148-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,868 INFO L858 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2022-01-11 03:30:47,868 INFO L858 garLoopResultBuilder]: For program point L153-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,868 INFO L858 garLoopResultBuilder]: For program point L159(line 159) no Hoare annotation was computed. [2022-01-11 03:30:47,868 INFO L858 garLoopResultBuilder]: For program point L158-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,868 INFO L858 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2022-01-11 03:30:47,868 INFO L858 garLoopResultBuilder]: For program point L163-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,868 INFO L858 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2022-01-11 03:30:47,868 INFO L858 garLoopResultBuilder]: For program point L168-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,868 INFO L858 garLoopResultBuilder]: For program point L174(line 174) no Hoare annotation was computed. [2022-01-11 03:30:47,868 INFO L858 garLoopResultBuilder]: For program point L173-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,868 INFO L858 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2022-01-11 03:30:47,869 INFO L858 garLoopResultBuilder]: For program point L178-1(lines 47 188) no Hoare annotation was computed. [2022-01-11 03:30:47,869 INFO L858 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2022-01-11 03:30:47,871 INFO L732 BasicCegarLoop]: Path program 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] [2022-01-11 03:30:47,872 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 03:30:47,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 03:30:47 BasicIcfg [2022-01-11 03:30:47,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 03:30:47,879 INFO L158 Benchmark]: Toolchain (without parser) took 18403.65ms. Allocated memory was 197.1MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 145.9MB in the beginning and 5.0GB in the end (delta: -4.8GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-01-11 03:30:47,879 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 197.1MB. Free memory is still 162.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 03:30:47,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.01ms. Allocated memory is still 197.1MB. Free memory was 145.7MB in the beginning and 170.4MB in the end (delta: -24.7MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-01-11 03:30:47,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.28ms. Allocated memory is still 197.1MB. Free memory was 170.4MB in the beginning and 168.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-11 03:30:47,879 INFO L158 Benchmark]: Boogie Preprocessor took 37.56ms. Allocated memory is still 197.1MB. Free memory was 168.8MB in the beginning and 167.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-11 03:30:47,879 INFO L158 Benchmark]: RCFGBuilder took 406.29ms. Allocated memory is still 197.1MB. Free memory was 167.3MB in the beginning and 155.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-11 03:30:47,879 INFO L158 Benchmark]: IcfgTransformer took 88.24ms. Allocated memory is still 197.1MB. Free memory was 155.1MB in the beginning and 150.3MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-01-11 03:30:47,880 INFO L158 Benchmark]: TraceAbstraction took 17621.81ms. Allocated memory was 197.1MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 149.5MB in the beginning and 5.0GB in the end (delta: -4.8GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2022-01-11 03:30:47,880 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 197.1MB. Free memory is still 162.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.01ms. Allocated memory is still 197.1MB. Free memory was 145.7MB in the beginning and 170.4MB in the end (delta: -24.7MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.28ms. Allocated memory is still 197.1MB. Free memory was 170.4MB in the beginning and 168.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.56ms. Allocated memory is still 197.1MB. Free memory was 168.8MB in the beginning and 167.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 406.29ms. Allocated memory is still 197.1MB. Free memory was 167.3MB in the beginning and 155.1MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 88.24ms. Allocated memory is still 197.1MB. Free memory was 155.1MB in the beginning and 150.3MB in the end (delta: 4.9MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 17621.81ms. Allocated memory was 197.1MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 149.5MB in the beginning and 5.0GB in the end (delta: -4.8GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 191]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.6s, OverallIterations: 34, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1683 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1683 mSDsluCounter, 5552 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2239 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181 IncrementalHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 3313 mSDtfsCounter, 181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106501occurred in iteration=33, InterpolantAutomatonStates: 102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.6s AutomataMinimizationTime, 34 MinimizatonAttempts, 16420 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 4105 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 836 NumberOfCodeBlocks, 836 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 802 ConstructedInterpolants, 0 QuantifiedInterpolants, 2048 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-01-11 03:30:47,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...