/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem03_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 21:50:17,917 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 21:50:17,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 21:50:17,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 21:50:17,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 21:50:17,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 21:50:17,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 21:50:17,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 21:50:17,981 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 21:50:17,982 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 21:50:17,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 21:50:17,983 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 21:50:17,983 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 21:50:17,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 21:50:17,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 21:50:17,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 21:50:17,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 21:50:17,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 21:50:17,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 21:50:17,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 21:50:17,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 21:50:17,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 21:50:17,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 21:50:17,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 21:50:17,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 21:50:17,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 21:50:17,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 21:50:17,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 21:50:17,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 21:50:17,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 21:50:17,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 21:50:17,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 21:50:17,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 21:50:17,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 21:50:17,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 21:50:17,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 21:50:17,998 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 21:50:17,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 21:50:17,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 21:50:17,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 21:50:17,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 21:50:18,000 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 21:50:18,026 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 21:50:18,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 21:50:18,027 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 21:50:18,027 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 21:50:18,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 21:50:18,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 21:50:18,028 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 21:50:18,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 21:50:18,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 21:50:18,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 21:50:18,028 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 21:50:18,028 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 21:50:18,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 21:50:18,029 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 21:50:18,029 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 21:50:18,029 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 21:50:18,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 21:50:18,029 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 21:50:18,029 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 21:50:18,029 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 21:50:18,029 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 21:50:18,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:50:18,030 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 21:50:18,030 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 21:50:18,030 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 21:50:18,030 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 21:50:18,030 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 21:50:18,030 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 21:50:18,030 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 21:50:18,030 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 21:50:18,030 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 21:50:18,031 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 21:50:18,031 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 21:50:18,031 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 21:50:18,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 21:50:18,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 21:50:18,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 21:50:18,266 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 21:50:18,266 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 21:50:18,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem03_label28.c [2022-01-10 21:50:18,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b854bf433/72b3404bd8454c199d4e40234953ce69/FLAG0f2c27ad4 [2022-01-10 21:50:18,770 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 21:50:18,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label28.c [2022-01-10 21:50:18,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b854bf433/72b3404bd8454c199d4e40234953ce69/FLAG0f2c27ad4 [2022-01-10 21:50:19,299 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b854bf433/72b3404bd8454c199d4e40234953ce69 [2022-01-10 21:50:19,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 21:50:19,304 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 21:50:19,306 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 21:50:19,306 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 21:50:19,308 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 21:50:19,308 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:50:19" (1/1) ... [2022-01-10 21:50:19,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38086586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:50:19, skipping insertion in model container [2022-01-10 21:50:19,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 09:50:19" (1/1) ... [2022-01-10 21:50:19,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 21:50:19,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 21:50:19,743 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label28.c[54731,54744] [2022-01-10 21:50:19,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:50:19,786 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 21:50:19,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem03_label28.c[54731,54744] [2022-01-10 21:50:19,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 21:50:19,955 INFO L208 MainTranslator]: Completed translation [2022-01-10 21:50:19,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:50:19 WrapperNode [2022-01-10 21:50:19,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 21:50:19,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 21:50:19,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 21:50:19,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 21:50:19,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:50:19" (1/1) ... [2022-01-10 21:50:19,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:50:19" (1/1) ... [2022-01-10 21:50:20,053 INFO L137 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2022-01-10 21:50:20,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 21:50:20,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 21:50:20,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 21:50:20,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 21:50:20,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:50:19" (1/1) ... [2022-01-10 21:50:20,065 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:50:19" (1/1) ... [2022-01-10 21:50:20,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:50:19" (1/1) ... [2022-01-10 21:50:20,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:50:19" (1/1) ... [2022-01-10 21:50:20,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:50:19" (1/1) ... [2022-01-10 21:50:20,128 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:50:19" (1/1) ... [2022-01-10 21:50:20,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:50:19" (1/1) ... [2022-01-10 21:50:20,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 21:50:20,157 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 21:50:20,157 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 21:50:20,157 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 21:50:20,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:50:19" (1/1) ... [2022-01-10 21:50:20,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 21:50:20,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 21:50:20,181 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 21:50:20,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 21:50:20,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 21:50:20,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 21:50:20,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 21:50:20,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 21:50:20,290 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 21:50:20,291 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 21:50:21,714 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 21:50:21,722 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 21:50:21,723 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 21:50:21,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:50:21 BoogieIcfgContainer [2022-01-10 21:50:21,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 21:50:21,730 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 21:50:21,730 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 21:50:21,731 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 21:50:21,733 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:50:21" (1/1) ... [2022-01-10 21:50:22,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:50:22 BasicIcfg [2022-01-10 21:50:22,087 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 21:50:22,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 21:50:22,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 21:50:22,091 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 21:50:22,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 09:50:19" (1/4) ... [2022-01-10 21:50:22,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3ae4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:50:22, skipping insertion in model container [2022-01-10 21:50:22,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 09:50:19" (2/4) ... [2022-01-10 21:50:22,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3ae4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 09:50:22, skipping insertion in model container [2022-01-10 21:50:22,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 09:50:21" (3/4) ... [2022-01-10 21:50:22,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3ae4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 09:50:22, skipping insertion in model container [2022-01-10 21:50:22,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 09:50:22" (4/4) ... [2022-01-10 21:50:22,093 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem03_label28.cTransformedIcfg [2022-01-10 21:50:22,098 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 21:50:22,098 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 21:50:22,148 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 21:50:22,154 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 21:50:22,154 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 21:50:22,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:22,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-01-10 21:50:22,194 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:50:22,195 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:50:22,195 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:50:22,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:50:22,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1486989068, now seen corresponding path program 1 times [2022-01-10 21:50:22,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:50:22,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918304188] [2022-01-10 21:50:22,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:50:22,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:50:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:50:22,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:50:22,862 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:50:22,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918304188] [2022-01-10 21:50:22,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918304188] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:50:22,863 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:50:22,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 21:50:22,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172382669] [2022-01-10 21:50:22,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:50:22,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:50:22,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:50:22,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:50:22,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:50:22,893 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 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 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:50:24,146 INFO L93 Difference]: Finished difference Result 816 states and 1453 transitions. [2022-01-10 21:50:24,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:50:24,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2022-01-10 21:50:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:50:24,163 INFO L225 Difference]: With dead ends: 816 [2022-01-10 21:50:24,163 INFO L226 Difference]: Without dead ends: 450 [2022-01-10 21:50:24,167 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:50:24,171 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 158 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:50:24,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 130 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 21:50:24,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-01-10 21:50:24,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2022-01-10 21:50:24,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 447 states have (on average 1.621923937360179) internal successors, (725), 447 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 725 transitions. [2022-01-10 21:50:24,226 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 725 transitions. Word has length 152 [2022-01-10 21:50:24,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:50:24,227 INFO L470 AbstractCegarLoop]: Abstraction has 448 states and 725 transitions. [2022-01-10 21:50:24,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 725 transitions. [2022-01-10 21:50:24,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-10 21:50:24,231 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:50:24,231 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:50:24,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 21:50:24,232 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:50:24,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:50:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash 901101086, now seen corresponding path program 1 times [2022-01-10 21:50:24,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:50:24,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882871976] [2022-01-10 21:50:24,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:50:24,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:50:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:50:24,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:50:24,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:50:24,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882871976] [2022-01-10 21:50:24,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882871976] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:50:24,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:50:24,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 21:50:24,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546318968] [2022-01-10 21:50:24,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:50:24,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:50:24,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:50:24,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:50:24,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:50:24,397 INFO L87 Difference]: Start difference. First operand 448 states and 725 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:24,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:50:24,751 INFO L93 Difference]: Finished difference Result 1327 states and 2154 transitions. [2022-01-10 21:50:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:50:24,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-01-10 21:50:24,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:50:24,755 INFO L225 Difference]: With dead ends: 1327 [2022-01-10 21:50:24,756 INFO L226 Difference]: Without dead ends: 881 [2022-01-10 21:50:24,757 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:50:24,757 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 360 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 21:50:24,758 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [360 Valid, 555 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 21:50:24,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2022-01-10 21:50:24,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 879. [2022-01-10 21:50:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 1.6207289293849658) internal successors, (1423), 878 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1423 transitions. [2022-01-10 21:50:24,796 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1423 transitions. Word has length 157 [2022-01-10 21:50:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:50:24,798 INFO L470 AbstractCegarLoop]: Abstraction has 879 states and 1423 transitions. [2022-01-10 21:50:24,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1423 transitions. [2022-01-10 21:50:24,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-10 21:50:24,807 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:50:24,807 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:50:24,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 21:50:24,810 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:50:24,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:50:24,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1253037016, now seen corresponding path program 1 times [2022-01-10 21:50:24,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:50:24,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320354531] [2022-01-10 21:50:24,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:50:24,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:50:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:50:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:50:24,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:50:24,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320354531] [2022-01-10 21:50:24,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320354531] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:50:24,924 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:50:24,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 21:50:24,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165850236] [2022-01-10 21:50:24,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:50:24,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:50:24,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:50:24,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:50:24,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:50:24,926 INFO L87 Difference]: Start difference. First operand 879 states and 1423 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:25,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:50:25,910 INFO L93 Difference]: Finished difference Result 2601 states and 4231 transitions. [2022-01-10 21:50:25,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:50:25,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2022-01-10 21:50:25,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:50:25,915 INFO L225 Difference]: With dead ends: 2601 [2022-01-10 21:50:25,915 INFO L226 Difference]: Without dead ends: 1724 [2022-01-10 21:50:25,916 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:50:25,917 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 21:50:25,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 95 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 21:50:25,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2022-01-10 21:50:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1699. [2022-01-10 21:50:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1698 states have (on average 1.588339222614841) internal successors, (2697), 1698 states have internal predecessors, (2697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2697 transitions. [2022-01-10 21:50:25,944 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2697 transitions. Word has length 160 [2022-01-10 21:50:25,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:50:25,945 INFO L470 AbstractCegarLoop]: Abstraction has 1699 states and 2697 transitions. [2022-01-10 21:50:25,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:25,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2697 transitions. [2022-01-10 21:50:25,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-10 21:50:25,947 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:50:25,947 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:50:25,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 21:50:25,947 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:50:25,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:50:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1592473754, now seen corresponding path program 1 times [2022-01-10 21:50:25,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:50:25,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696754823] [2022-01-10 21:50:25,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:50:25,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:50:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:50:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:50:26,100 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:50:26,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696754823] [2022-01-10 21:50:26,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696754823] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:50:26,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:50:26,101 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 21:50:26,101 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108424607] [2022-01-10 21:50:26,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:50:26,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:50:26,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:50:26,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:50:26,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:50:26,102 INFO L87 Difference]: Start difference. First operand 1699 states and 2697 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:50:27,021 INFO L93 Difference]: Finished difference Result 5046 states and 8023 transitions. [2022-01-10 21:50:27,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:50:27,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2022-01-10 21:50:27,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:50:27,031 INFO L225 Difference]: With dead ends: 5046 [2022-01-10 21:50:27,031 INFO L226 Difference]: Without dead ends: 3349 [2022-01-10 21:50:27,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:50:27,034 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 255 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 21:50:27,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 137 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 21:50:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3349 states. [2022-01-10 21:50:27,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3349 to 3345. [2022-01-10 21:50:27,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3345 states, 3344 states have (on average 1.500598086124402) internal successors, (5018), 3344 states have internal predecessors, (5018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 3345 states and 5018 transitions. [2022-01-10 21:50:27,088 INFO L78 Accepts]: Start accepts. Automaton has 3345 states and 5018 transitions. Word has length 161 [2022-01-10 21:50:27,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:50:27,088 INFO L470 AbstractCegarLoop]: Abstraction has 3345 states and 5018 transitions. [2022-01-10 21:50:27,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3345 states and 5018 transitions. [2022-01-10 21:50:27,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-01-10 21:50:27,091 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:50:27,092 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:50:27,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 21:50:27,092 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:50:27,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:50:27,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1124444630, now seen corresponding path program 1 times [2022-01-10 21:50:27,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:50:27,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727577278] [2022-01-10 21:50:27,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:50:27,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:50:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:50:27,188 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:50:27,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:50:27,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727577278] [2022-01-10 21:50:27,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727577278] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:50:27,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:50:27,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 21:50:27,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829216135] [2022-01-10 21:50:27,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:50:27,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:50:27,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:50:27,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:50:27,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:50:27,190 INFO L87 Difference]: Start difference. First operand 3345 states and 5018 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:28,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:50:28,131 INFO L93 Difference]: Finished difference Result 8332 states and 12446 transitions. [2022-01-10 21:50:28,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:50:28,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2022-01-10 21:50:28,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:50:28,145 INFO L225 Difference]: With dead ends: 8332 [2022-01-10 21:50:28,145 INFO L226 Difference]: Without dead ends: 4989 [2022-01-10 21:50:28,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:50:28,154 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 236 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 21:50:28,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 116 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 21:50:28,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4989 states. [2022-01-10 21:50:28,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4989 to 4987. [2022-01-10 21:50:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4987 states, 4986 states have (on average 1.4705174488567991) internal successors, (7332), 4986 states have internal predecessors, (7332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:28,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4987 states to 4987 states and 7332 transitions. [2022-01-10 21:50:28,226 INFO L78 Accepts]: Start accepts. Automaton has 4987 states and 7332 transitions. Word has length 162 [2022-01-10 21:50:28,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:50:28,227 INFO L470 AbstractCegarLoop]: Abstraction has 4987 states and 7332 transitions. [2022-01-10 21:50:28,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4987 states and 7332 transitions. [2022-01-10 21:50:28,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-01-10 21:50:28,237 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:50:28,237 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:50:28,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 21:50:28,237 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:50:28,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:50:28,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1829862976, now seen corresponding path program 1 times [2022-01-10 21:50:28,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:50:28,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995156108] [2022-01-10 21:50:28,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:50:28,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:50:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:50:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 21:50:28,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:50:28,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995156108] [2022-01-10 21:50:28,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995156108] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:50:28,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:50:28,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:50:28,524 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400848390] [2022-01-10 21:50:28,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:50:28,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:50:28,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:50:28,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:50:28,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:50:28,525 INFO L87 Difference]: Start difference. First operand 4987 states and 7332 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:50:29,603 INFO L93 Difference]: Finished difference Result 9964 states and 14648 transitions. [2022-01-10 21:50:29,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:50:29,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2022-01-10 21:50:29,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:50:29,619 INFO L225 Difference]: With dead ends: 9964 [2022-01-10 21:50:29,619 INFO L226 Difference]: Without dead ends: 4979 [2022-01-10 21:50:29,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-10 21:50:29,626 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 134 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:50:29,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 382 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 21:50:29,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4979 states. [2022-01-10 21:50:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4979 to 4977. [2022-01-10 21:50:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4977 states, 4976 states have (on average 1.345056270096463) internal successors, (6693), 4976 states have internal predecessors, (6693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:29,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4977 states to 4977 states and 6693 transitions. [2022-01-10 21:50:29,694 INFO L78 Accepts]: Start accepts. Automaton has 4977 states and 6693 transitions. Word has length 167 [2022-01-10 21:50:29,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:50:29,696 INFO L470 AbstractCegarLoop]: Abstraction has 4977 states and 6693 transitions. [2022-01-10 21:50:29,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:29,696 INFO L276 IsEmpty]: Start isEmpty. Operand 4977 states and 6693 transitions. [2022-01-10 21:50:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-01-10 21:50:29,703 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:50:29,703 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:50:29,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 21:50:29,703 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:50:29,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:50:29,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1403411006, now seen corresponding path program 1 times [2022-01-10 21:50:29,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:50:29,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838986147] [2022-01-10 21:50:29,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:50:29,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:50:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:50:29,820 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:50:29,820 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:50:29,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838986147] [2022-01-10 21:50:29,820 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838986147] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:50:29,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:50:29,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:50:29,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629117588] [2022-01-10 21:50:29,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:50:29,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:50:29,821 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:50:29,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:50:29,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:50:29,822 INFO L87 Difference]: Start difference. First operand 4977 states and 6693 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:50:31,201 INFO L93 Difference]: Finished difference Result 16862 states and 22671 transitions. [2022-01-10 21:50:31,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:50:31,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2022-01-10 21:50:31,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:50:31,228 INFO L225 Difference]: With dead ends: 16862 [2022-01-10 21:50:31,228 INFO L226 Difference]: Without dead ends: 11887 [2022-01-10 21:50:31,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:50:31,236 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 654 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-10 21:50:31,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [654 Valid, 185 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-10 21:50:31,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11887 states. [2022-01-10 21:50:31,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11887 to 11879. [2022-01-10 21:50:31,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11879 states, 11878 states have (on average 1.1538979626199697) internal successors, (13706), 11878 states have internal predecessors, (13706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11879 states to 11879 states and 13706 transitions. [2022-01-10 21:50:31,436 INFO L78 Accepts]: Start accepts. Automaton has 11879 states and 13706 transitions. Word has length 169 [2022-01-10 21:50:31,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:50:31,436 INFO L470 AbstractCegarLoop]: Abstraction has 11879 states and 13706 transitions. [2022-01-10 21:50:31,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:31,437 INFO L276 IsEmpty]: Start isEmpty. Operand 11879 states and 13706 transitions. [2022-01-10 21:50:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-01-10 21:50:31,445 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:50:31,445 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:50:31,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 21:50:31,445 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:50:31,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:50:31,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1201077024, now seen corresponding path program 1 times [2022-01-10 21:50:31,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:50:31,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036308198] [2022-01-10 21:50:31,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:50:31,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:50:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:50:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 21:50:31,545 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:50:31,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036308198] [2022-01-10 21:50:31,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036308198] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:50:31,545 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:50:31,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:50:31,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430353299] [2022-01-10 21:50:31,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:50:31,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:50:31,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:50:31,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:50:31,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:50:31,546 INFO L87 Difference]: Start difference. First operand 11879 states and 13706 transitions. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:33,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:50:33,183 INFO L93 Difference]: Finished difference Result 45772 states and 52795 transitions. [2022-01-10 21:50:33,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:50:33,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 179 [2022-01-10 21:50:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:50:33,245 INFO L225 Difference]: With dead ends: 45772 [2022-01-10 21:50:33,245 INFO L226 Difference]: Without dead ends: 33895 [2022-01-10 21:50:33,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:50:33,261 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 861 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 963 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-10 21:50:33,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [861 Valid, 116 Invalid, 1195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 963 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-10 21:50:33,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33895 states. [2022-01-10 21:50:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33895 to 33891. [2022-01-10 21:50:33,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33891 states, 33890 states have (on average 1.144762466804367) internal successors, (38796), 33890 states have internal predecessors, (38796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33891 states to 33891 states and 38796 transitions. [2022-01-10 21:50:33,728 INFO L78 Accepts]: Start accepts. Automaton has 33891 states and 38796 transitions. Word has length 179 [2022-01-10 21:50:33,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:50:33,729 INFO L470 AbstractCegarLoop]: Abstraction has 33891 states and 38796 transitions. [2022-01-10 21:50:33,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:33,730 INFO L276 IsEmpty]: Start isEmpty. Operand 33891 states and 38796 transitions. [2022-01-10 21:50:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-01-10 21:50:33,734 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:50:33,735 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:50:33,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 21:50:33,735 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:50:33,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:50:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1138171363, now seen corresponding path program 1 times [2022-01-10 21:50:33,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:50:33,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063788940] [2022-01-10 21:50:33,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:50:33,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:50:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:50:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:50:33,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:50:33,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063788940] [2022-01-10 21:50:33,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063788940] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:50:33,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:50:33,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 21:50:33,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354687446] [2022-01-10 21:50:33,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:50:33,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:50:33,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:50:33,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:50:33,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:50:33,826 INFO L87 Difference]: Start difference. First operand 33891 states and 38796 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:50:35,000 INFO L93 Difference]: Finished difference Result 79229 states and 90531 transitions. [2022-01-10 21:50:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:50:35,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 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 180 [2022-01-10 21:50:35,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:50:35,069 INFO L225 Difference]: With dead ends: 79229 [2022-01-10 21:50:35,069 INFO L226 Difference]: Without dead ends: 45340 [2022-01-10 21:50:35,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:50:35,105 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 222 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 21:50:35,105 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [222 Valid, 148 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 21:50:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45340 states. [2022-01-10 21:50:35,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45340 to 45330. [2022-01-10 21:50:35,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45330 states, 45329 states have (on average 1.1398442498179973) internal successors, (51668), 45329 states have internal predecessors, (51668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:35,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45330 states to 45330 states and 51668 transitions. [2022-01-10 21:50:35,762 INFO L78 Accepts]: Start accepts. Automaton has 45330 states and 51668 transitions. Word has length 180 [2022-01-10 21:50:35,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:50:35,763 INFO L470 AbstractCegarLoop]: Abstraction has 45330 states and 51668 transitions. [2022-01-10 21:50:35,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 45330 states and 51668 transitions. [2022-01-10 21:50:35,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-01-10 21:50:35,770 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:50:35,770 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:50:35,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 21:50:35,770 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:50:35,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:50:35,771 INFO L85 PathProgramCache]: Analyzing trace with hash 484672587, now seen corresponding path program 1 times [2022-01-10 21:50:35,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:50:35,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151734742] [2022-01-10 21:50:35,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:50:35,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:50:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:50:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:50:35,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:50:35,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151734742] [2022-01-10 21:50:35,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151734742] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:50:35,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:50:35,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:50:35,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167254661] [2022-01-10 21:50:35,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:50:35,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:50:35,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:50:35,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:50:35,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:50:35,898 INFO L87 Difference]: Start difference. First operand 45330 states and 51668 transitions. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:50:37,282 INFO L93 Difference]: Finished difference Result 101436 states and 115888 transitions. [2022-01-10 21:50:37,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:50:37,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 187 [2022-01-10 21:50:37,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:50:37,354 INFO L225 Difference]: With dead ends: 101436 [2022-01-10 21:50:37,354 INFO L226 Difference]: Without dead ends: 56108 [2022-01-10 21:50:37,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:50:37,390 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 800 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 21:50:37,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [800 Valid, 386 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-10 21:50:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56108 states. [2022-01-10 21:50:38,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56108 to 52033. [2022-01-10 21:50:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52033 states, 52032 states have (on average 1.147736008610086) internal successors, (59719), 52032 states have internal predecessors, (59719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52033 states to 52033 states and 59719 transitions. [2022-01-10 21:50:38,237 INFO L78 Accepts]: Start accepts. Automaton has 52033 states and 59719 transitions. Word has length 187 [2022-01-10 21:50:38,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:50:38,239 INFO L470 AbstractCegarLoop]: Abstraction has 52033 states and 59719 transitions. [2022-01-10 21:50:38,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:38,240 INFO L276 IsEmpty]: Start isEmpty. Operand 52033 states and 59719 transitions. [2022-01-10 21:50:38,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2022-01-10 21:50:38,252 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:50:38,252 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:50:38,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-10 21:50:38,253 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:50:38,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:50:38,254 INFO L85 PathProgramCache]: Analyzing trace with hash -422026227, now seen corresponding path program 1 times [2022-01-10 21:50:38,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:50:38,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100761853] [2022-01-10 21:50:38,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:50:38,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:50:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:50:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 21:50:38,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:50:38,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100761853] [2022-01-10 21:50:38,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100761853] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:50:38,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:50:38,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:50:38,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876707450] [2022-01-10 21:50:38,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:50:38,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:50:38,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:50:38,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:50:38,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:50:38,363 INFO L87 Difference]: Start difference. First operand 52033 states and 59719 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:39,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:50:39,587 INFO L93 Difference]: Finished difference Result 123177 states and 142354 transitions. [2022-01-10 21:50:39,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:50:39,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 197 [2022-01-10 21:50:39,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:50:39,678 INFO L225 Difference]: With dead ends: 123177 [2022-01-10 21:50:39,678 INFO L226 Difference]: Without dead ends: 71146 [2022-01-10 21:50:39,719 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:50:39,720 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 245 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 21:50:39,720 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 349 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-10 21:50:39,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71146 states. [2022-01-10 21:50:40,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71146 to 71128. [2022-01-10 21:50:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71128 states, 71127 states have (on average 1.1371631026192586) internal successors, (80883), 71127 states have internal predecessors, (80883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71128 states to 71128 states and 80883 transitions. [2022-01-10 21:50:40,712 INFO L78 Accepts]: Start accepts. Automaton has 71128 states and 80883 transitions. Word has length 197 [2022-01-10 21:50:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:50:40,712 INFO L470 AbstractCegarLoop]: Abstraction has 71128 states and 80883 transitions. [2022-01-10 21:50:40,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 71128 states and 80883 transitions. [2022-01-10 21:50:40,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-01-10 21:50:40,719 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:50:40,719 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:50:40,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-10 21:50:40,720 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:50:40,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:50:40,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1501670724, now seen corresponding path program 1 times [2022-01-10 21:50:40,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:50:40,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433880342] [2022-01-10 21:50:40,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:50:40,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:50:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:50:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 21:50:41,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:50:41,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433880342] [2022-01-10 21:50:41,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433880342] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:50:41,012 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:50:41,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:50:41,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383237421] [2022-01-10 21:50:41,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:50:41,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:50:41,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:50:41,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:50:41,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:50:41,014 INFO L87 Difference]: Start difference. First operand 71128 states and 80883 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:42,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:50:42,892 INFO L93 Difference]: Finished difference Result 206043 states and 234662 transitions. [2022-01-10 21:50:42,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:50:42,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 200 [2022-01-10 21:50:42,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:50:43,065 INFO L225 Difference]: With dead ends: 206043 [2022-01-10 21:50:43,065 INFO L226 Difference]: Without dead ends: 134917 [2022-01-10 21:50:43,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:50:43,088 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 518 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:50:43,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 574 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 21:50:43,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134917 states. [2022-01-10 21:50:44,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134917 to 134859. [2022-01-10 21:50:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134859 states, 134858 states have (on average 1.1360023135446173) internal successors, (153199), 134858 states have internal predecessors, (153199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134859 states to 134859 states and 153199 transitions. [2022-01-10 21:50:45,162 INFO L78 Accepts]: Start accepts. Automaton has 134859 states and 153199 transitions. Word has length 200 [2022-01-10 21:50:45,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:50:45,162 INFO L470 AbstractCegarLoop]: Abstraction has 134859 states and 153199 transitions. [2022-01-10 21:50:45,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 134859 states and 153199 transitions. [2022-01-10 21:50:45,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-01-10 21:50:45,172 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:50:45,172 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:50:45,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 21:50:45,173 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:50:45,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:50:45,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1277753320, now seen corresponding path program 1 times [2022-01-10 21:50:45,173 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:50:45,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258148120] [2022-01-10 21:50:45,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:50:45,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:50:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:50:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-10 21:50:45,450 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:50:45,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258148120] [2022-01-10 21:50:45,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258148120] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:50:45,451 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:50:45,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:50:45,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681902313] [2022-01-10 21:50:45,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:50:45,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:50:45,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:50:45,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:50:45,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:50:45,452 INFO L87 Difference]: Start difference. First operand 134859 states and 153199 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:47,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:50:47,150 INFO L93 Difference]: Finished difference Result 297156 states and 338396 transitions. [2022-01-10 21:50:47,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 21:50:47,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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 229 [2022-01-10 21:50:47,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:50:47,352 INFO L225 Difference]: With dead ends: 297156 [2022-01-10 21:50:47,352 INFO L226 Difference]: Without dead ends: 162299 [2022-01-10 21:50:47,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:50:47,398 INFO L933 BasicCegarLoop]: 173 mSDtfsCounter, 157 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 21:50:47,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 194 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 21:50:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162299 states. [2022-01-10 21:50:49,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162299 to 161866. [2022-01-10 21:50:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161866 states, 161865 states have (on average 1.1242887591511446) internal successors, (181983), 161865 states have internal predecessors, (181983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161866 states to 161866 states and 181983 transitions. [2022-01-10 21:50:49,891 INFO L78 Accepts]: Start accepts. Automaton has 161866 states and 181983 transitions. Word has length 229 [2022-01-10 21:50:49,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:50:49,891 INFO L470 AbstractCegarLoop]: Abstraction has 161866 states and 181983 transitions. [2022-01-10 21:50:49,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:49,891 INFO L276 IsEmpty]: Start isEmpty. Operand 161866 states and 181983 transitions. [2022-01-10 21:50:49,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-01-10 21:50:49,901 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:50:49,901 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:50:49,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-10 21:50:49,902 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:50:49,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:50:49,902 INFO L85 PathProgramCache]: Analyzing trace with hash 490579, now seen corresponding path program 1 times [2022-01-10 21:50:49,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:50:49,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796251797] [2022-01-10 21:50:49,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:50:49,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:50:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:50:49,998 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-01-10 21:50:49,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:50:49,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796251797] [2022-01-10 21:50:49,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796251797] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:50:49,998 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:50:49,998 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:50:49,998 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793589225] [2022-01-10 21:50:49,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:50:49,999 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:50:49,999 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:50:49,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:50:49,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:50:49,999 INFO L87 Difference]: Start difference. First operand 161866 states and 181983 transitions. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:52,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:50:52,502 INFO L93 Difference]: Finished difference Result 454510 states and 510266 transitions. [2022-01-10 21:50:52,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:50:52,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 234 [2022-01-10 21:50:52,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:50:52,953 INFO L225 Difference]: With dead ends: 454510 [2022-01-10 21:50:52,954 INFO L226 Difference]: Without dead ends: 292646 [2022-01-10 21:50:53,028 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:50:53,029 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 773 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 21:50:53,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [773 Valid, 414 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 21:50:53,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292646 states. [2022-01-10 21:50:56,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292646 to 286514. [2022-01-10 21:50:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286514 states, 286513 states have (on average 1.1157155172714677) internal successors, (319667), 286513 states have internal predecessors, (319667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286514 states to 286514 states and 319667 transitions. [2022-01-10 21:50:57,578 INFO L78 Accepts]: Start accepts. Automaton has 286514 states and 319667 transitions. Word has length 234 [2022-01-10 21:50:57,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:50:57,578 INFO L470 AbstractCegarLoop]: Abstraction has 286514 states and 319667 transitions. [2022-01-10 21:50:57,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:50:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 286514 states and 319667 transitions. [2022-01-10 21:50:57,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-01-10 21:50:57,587 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:50:57,587 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:50:57,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-10 21:50:57,588 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:50:57,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:50:57,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1970351054, now seen corresponding path program 1 times [2022-01-10 21:50:57,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:50:57,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745316179] [2022-01-10 21:50:57,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:50:57,588 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:50:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:50:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 21:50:57,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:50:57,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745316179] [2022-01-10 21:50:57,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745316179] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:50:57,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:50:57,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 21:50:57,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918740444] [2022-01-10 21:50:57,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:50:57,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 21:50:57,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:50:57,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 21:50:57,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:50:57,737 INFO L87 Difference]: Start difference. First operand 286514 states and 319667 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:51:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 21:51:01,575 INFO L93 Difference]: Finished difference Result 727846 states and 810885 transitions. [2022-01-10 21:51:01,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 21:51:01,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2022-01-10 21:51:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 21:51:02,419 INFO L225 Difference]: With dead ends: 727846 [2022-01-10 21:51:02,420 INFO L226 Difference]: Without dead ends: 441334 [2022-01-10 21:51:02,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 21:51:02,528 INFO L933 BasicCegarLoop]: 288 mSDtfsCounter, 509 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-10 21:51:02,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [509 Valid, 569 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-10 21:51:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441334 states. [2022-01-10 21:51:08,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441334 to 438255. [2022-01-10 21:51:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438255 states, 438254 states have (on average 1.1077959356902618) internal successors, (485496), 438254 states have internal predecessors, (485496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:51:10,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438255 states to 438255 states and 485496 transitions. [2022-01-10 21:51:10,285 INFO L78 Accepts]: Start accepts. Automaton has 438255 states and 485496 transitions. Word has length 236 [2022-01-10 21:51:10,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 21:51:10,285 INFO L470 AbstractCegarLoop]: Abstraction has 438255 states and 485496 transitions. [2022-01-10 21:51:10,285 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 21:51:10,285 INFO L276 IsEmpty]: Start isEmpty. Operand 438255 states and 485496 transitions. [2022-01-10 21:51:10,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-01-10 21:51:10,299 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 21:51:10,299 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 21:51:10,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-10 21:51:10,299 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 21:51:10,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 21:51:10,300 INFO L85 PathProgramCache]: Analyzing trace with hash -332244493, now seen corresponding path program 1 times [2022-01-10 21:51:10,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 21:51:10,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336610579] [2022-01-10 21:51:10,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 21:51:10,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 21:51:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 21:51:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-01-10 21:51:10,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 21:51:10,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336610579] [2022-01-10 21:51:10,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336610579] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 21:51:10,928 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 21:51:10,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 21:51:10,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523081071] [2022-01-10 21:51:10,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 21:51:10,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 21:51:10,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 21:51:10,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 21:51:10,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 21:51:10,929 INFO L87 Difference]: Start difference. First operand 438255 states and 485496 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)