/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9bbddad6b14272d9691b7fb6f1c011d15ab18596-9bbddad [2021-06-12 17:26:02,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-12 17:26:02,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-12 17:26:02,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-12 17:26:02,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-12 17:26:02,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-12 17:26:02,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-12 17:26:02,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-12 17:26:02,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-12 17:26:02,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-12 17:26:02,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-12 17:26:02,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-12 17:26:02,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-12 17:26:02,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-12 17:26:02,959 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-12 17:26:02,960 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-12 17:26:02,961 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-12 17:26:02,962 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-12 17:26:02,963 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-12 17:26:02,965 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-12 17:26:02,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-12 17:26:02,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-12 17:26:02,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-12 17:26:02,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-12 17:26:02,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-12 17:26:02,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-12 17:26:02,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-12 17:26:02,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-12 17:26:02,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-12 17:26:02,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-12 17:26:02,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-12 17:26:02,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-12 17:26:02,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-12 17:26:02,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-12 17:26:02,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-12 17:26:02,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-12 17:26:02,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-12 17:26:02,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-12 17:26:02,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-12 17:26:02,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-12 17:26:02,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-12 17:26:02,991 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-06-12 17:26:03,018 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-12 17:26:03,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-12 17:26:03,019 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-12 17:26:03,019 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-12 17:26:03,020 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-12 17:26:03,020 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-12 17:26:03,020 INFO L138 SettingsManager]: * Use SBE=true [2021-06-12 17:26:03,020 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-12 17:26:03,021 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-12 17:26:03,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-12 17:26:03,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-12 17:26:03,021 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-12 17:26:03,021 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-12 17:26:03,021 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-12 17:26:03,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-12 17:26:03,022 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-12 17:26:03,022 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-12 17:26:03,022 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-12 17:26:03,022 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-12 17:26:03,022 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-12 17:26:03,022 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-12 17:26:03,023 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-12 17:26:03,023 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-12 17:26:03,023 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 17:26:03,023 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-12 17:26:03,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-12 17:26:03,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-12 17:26:03,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-12 17:26:03,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-12 17:26:03,024 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-12 17:26:03,024 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-12 17:26:03,024 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2021-06-12 17:26:03,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-12 17:26:03,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-12 17:26:03,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-12 17:26:03,326 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-12 17:26:03,326 INFO L275 PluginConnector]: CDTParser initialized [2021-06-12 17:26:03,327 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2021-06-12 17:26:03,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cea7fbee/e1b3c7ebc4324e5d95993d06d4299fc1/FLAG8e2488c84 [2021-06-12 17:26:04,011 INFO L306 CDTParser]: Found 1 translation units. [2021-06-12 17:26:04,011 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2021-06-12 17:26:04,034 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cea7fbee/e1b3c7ebc4324e5d95993d06d4299fc1/FLAG8e2488c84 [2021-06-12 17:26:04,375 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cea7fbee/e1b3c7ebc4324e5d95993d06d4299fc1 [2021-06-12 17:26:04,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-12 17:26:04,378 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-12 17:26:04,380 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-12 17:26:04,380 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-12 17:26:04,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-12 17:26:04,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 05:26:04" (1/1) ... [2021-06-12 17:26:04,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e1ab615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:26:04, skipping insertion in model container [2021-06-12 17:26:04,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.06 05:26:04" (1/1) ... [2021-06-12 17:26:04,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-12 17:26:04,458 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-12 17:26:04,573 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-12 17:26:05,101 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2021-06-12 17:26:05,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 17:26:05,137 INFO L203 MainTranslator]: Completed pre-run [2021-06-12 17:26:05,148 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-06-12 17:26:05,181 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[75009,75022] [2021-06-12 17:26:05,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-12 17:26:05,438 INFO L208 MainTranslator]: Completed translation [2021-06-12 17:26:05,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:26:05 WrapperNode [2021-06-12 17:26:05,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-12 17:26:05,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-12 17:26:05,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-12 17:26:05,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-12 17:26:05,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:26:05" (1/1) ... [2021-06-12 17:26:05,470 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:26:05" (1/1) ... [2021-06-12 17:26:05,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-12 17:26:05,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-12 17:26:05,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-12 17:26:05,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-12 17:26:05,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:26:05" (1/1) ... [2021-06-12 17:26:05,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:26:05" (1/1) ... [2021-06-12 17:26:05,537 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:26:05" (1/1) ... [2021-06-12 17:26:05,537 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:26:05" (1/1) ... [2021-06-12 17:26:05,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:26:05" (1/1) ... [2021-06-12 17:26:05,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:26:05" (1/1) ... [2021-06-12 17:26:05,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:26:05" (1/1) ... [2021-06-12 17:26:05,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-12 17:26:05,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-12 17:26:05,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-12 17:26:05,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-12 17:26:05,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:26:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-12 17:26:05,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-12 17:26:05,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-12 17:26:05,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-12 17:26:05,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-12 17:26:05,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-06-12 17:26:05,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-12 17:26:05,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-12 17:26:05,670 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2021-06-12 17:26:05,670 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2021-06-12 17:26:05,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-12 17:26:05,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-12 17:26:05,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-12 17:26:05,671 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-12 17:26:06,254 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-12 17:26:06,255 INFO L299 CfgBuilder]: Removed 24 assume(true) statements. [2021-06-12 17:26:06,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:26:06 BoogieIcfgContainer [2021-06-12 17:26:06,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-12 17:26:06,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-12 17:26:06,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-12 17:26:06,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-12 17:26:06,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.06 05:26:04" (1/3) ... [2021-06-12 17:26:06,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d908c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 05:26:06, skipping insertion in model container [2021-06-12 17:26:06,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.06 05:26:05" (2/3) ... [2021-06-12 17:26:06,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d908c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.06 05:26:06, skipping insertion in model container [2021-06-12 17:26:06,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.06 05:26:06" (3/3) ... [2021-06-12 17:26:06,265 INFO L111 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2021-06-12 17:26:06,270 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-12 17:26:06,270 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-12 17:26:06,270 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2021-06-12 17:26:06,271 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-12 17:26:06,308 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,309 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,309 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,309 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,310 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,310 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,310 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,310 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,310 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,311 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,311 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,311 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,311 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,311 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,311 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,311 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,311 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,311 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,312 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,312 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,312 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,312 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,312 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,312 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,312 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,313 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,313 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,313 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,313 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,313 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,313 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,314 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,314 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,314 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,314 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,314 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,315 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,315 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,315 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,315 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,315 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,315 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,315 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,315 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,315 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,316 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,316 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,316 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,316 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,316 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,316 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,316 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,316 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,317 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,317 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,317 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,317 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,317 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,317 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,317 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,318 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,318 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,318 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,318 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,318 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,318 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,318 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,318 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,318 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,318 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,319 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,319 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,319 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,319 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,319 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,319 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,319 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,319 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,320 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,320 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,320 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,320 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,320 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,320 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,320 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,321 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,321 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,321 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,321 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,321 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,321 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,321 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,323 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,323 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,324 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,325 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,326 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,327 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,328 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,328 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,329 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,334 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork0_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,336 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,336 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,337 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~data~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,337 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,337 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,337 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~lb~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,337 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,337 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,337 WARN L313 ript$VariableManager]: TermVariabe my_callbackThread1of1ForFork1_~__mptr~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,337 WARN L313 ript$VariableManager]: TermVariabe |my_callbackThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-12 17:26:06,347 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-06-12 17:26:06,364 INFO L255 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2021-06-12 17:26:06,378 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-12 17:26:06,378 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-12 17:26:06,378 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-12 17:26:06,378 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-12 17:26:06,378 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-12 17:26:06,378 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-12 17:26:06,378 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-12 17:26:06,378 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-12 17:26:06,390 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 158 places, 162 transitions, 346 flow [2021-06-12 17:26:06,533 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4278 states, 4267 states have (on average 2.7492383407546286) internal successors, (11731), 4277 states have internal predecessors, (11731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 4278 states, 4267 states have (on average 2.7492383407546286) internal successors, (11731), 4277 states have internal predecessors, (11731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-06-12 17:26:06,552 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:06,553 INFO L472 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] [2021-06-12 17:26:06,554 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:06,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:06,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1369970770, now seen corresponding path program 1 times [2021-06-12 17:26:06,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:06,569 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219185316] [2021-06-12 17:26:06,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:06,963 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:06,963 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219185316] [2021-06-12 17:26:06,964 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219185316] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:06,964 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:06,964 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 17:26:06,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398878560] [2021-06-12 17:26:06,968 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 17:26:06,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:06,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 17:26:06,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 17:26:06,989 INFO L87 Difference]: Start difference. First operand has 4278 states, 4267 states have (on average 2.7492383407546286) internal successors, (11731), 4277 states have internal predecessors, (11731), 0 states have call successors, (0), 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 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:07,221 INFO L93 Difference]: Finished difference Result 4075 states and 10961 transitions. [2021-06-12 17:26:07,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-12 17:26:07,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2021-06-12 17:26:07,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:07,257 INFO L225 Difference]: With dead ends: 4075 [2021-06-12 17:26:07,257 INFO L226 Difference]: Without dead ends: 3358 [2021-06-12 17:26:07,259 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 67.8ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-06-12 17:26:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3358 states. [2021-06-12 17:26:07,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3358 to 3357. [2021-06-12 17:26:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3357 states, 3350 states have (on average 2.681492537313433) internal successors, (8983), 3356 states have internal predecessors, (8983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:07,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3357 states to 3357 states and 8983 transitions. [2021-06-12 17:26:07,454 INFO L78 Accepts]: Start accepts. Automaton has 3357 states and 8983 transitions. Word has length 36 [2021-06-12 17:26:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:07,454 INFO L482 AbstractCegarLoop]: Abstraction has 3357 states and 8983 transitions. [2021-06-12 17:26:07,455 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3357 states and 8983 transitions. [2021-06-12 17:26:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-12 17:26:07,456 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:07,456 INFO L472 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] [2021-06-12 17:26:07,456 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-12 17:26:07,457 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:07,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:07,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1499060535, now seen corresponding path program 1 times [2021-06-12 17:26:07,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:07,460 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686889160] [2021-06-12 17:26:07,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:07,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:07,615 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:07,615 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686889160] [2021-06-12 17:26:07,615 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686889160] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:07,616 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:07,616 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 17:26:07,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516934010] [2021-06-12 17:26:07,617 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 17:26:07,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:07,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 17:26:07,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 17:26:07,620 INFO L87 Difference]: Start difference. First operand 3357 states and 8983 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:07,813 INFO L93 Difference]: Finished difference Result 3359 states and 8985 transitions. [2021-06-12 17:26:07,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-12 17:26:07,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2021-06-12 17:26:07,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:07,828 INFO L225 Difference]: With dead ends: 3359 [2021-06-12 17:26:07,828 INFO L226 Difference]: Without dead ends: 3359 [2021-06-12 17:26:07,830 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 60.9ms TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-06-12 17:26:07,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3359 states. [2021-06-12 17:26:07,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3359 to 3355. [2021-06-12 17:26:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3355 states, 3349 states have (on average 2.6816960286652733) internal successors, (8981), 3354 states have internal predecessors, (8981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 8981 transitions. [2021-06-12 17:26:07,920 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 8981 transitions. Word has length 42 [2021-06-12 17:26:07,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:07,920 INFO L482 AbstractCegarLoop]: Abstraction has 3355 states and 8981 transitions. [2021-06-12 17:26:07,920 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:07,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 8981 transitions. [2021-06-12 17:26:07,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-06-12 17:26:07,922 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:07,922 INFO L472 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] [2021-06-12 17:26:07,922 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-12 17:26:07,922 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:07,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:07,923 INFO L82 PathProgramCache]: Analyzing trace with hash 709377487, now seen corresponding path program 1 times [2021-06-12 17:26:07,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:07,923 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133142262] [2021-06-12 17:26:07,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:08,006 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:08,006 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133142262] [2021-06-12 17:26:08,006 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133142262] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:08,006 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:08,007 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 17:26:08,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397931510] [2021-06-12 17:26:08,007 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 17:26:08,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:08,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 17:26:08,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 17:26:08,008 INFO L87 Difference]: Start difference. First operand 3355 states and 8981 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:08,309 INFO L93 Difference]: Finished difference Result 4878 states and 13059 transitions. [2021-06-12 17:26:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-12 17:26:08,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-06-12 17:26:08,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:08,332 INFO L225 Difference]: With dead ends: 4878 [2021-06-12 17:26:08,333 INFO L226 Difference]: Without dead ends: 4878 [2021-06-12 17:26:08,333 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 94.9ms TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-06-12 17:26:08,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4878 states. [2021-06-12 17:26:08,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4878 to 3753. [2021-06-12 17:26:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3753 states, 3748 states have (on average 2.683831376734258) internal successors, (10059), 3752 states have internal predecessors, (10059), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:08,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3753 states to 3753 states and 10059 transitions. [2021-06-12 17:26:08,489 INFO L78 Accepts]: Start accepts. Automaton has 3753 states and 10059 transitions. Word has length 60 [2021-06-12 17:26:08,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:08,492 INFO L482 AbstractCegarLoop]: Abstraction has 3753 states and 10059 transitions. [2021-06-12 17:26:08,492 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:08,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3753 states and 10059 transitions. [2021-06-12 17:26:08,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-06-12 17:26:08,499 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:08,499 INFO L472 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] [2021-06-12 17:26:08,499 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-12 17:26:08,499 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:08,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:08,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1924610094, now seen corresponding path program 1 times [2021-06-12 17:26:08,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:08,501 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374668565] [2021-06-12 17:26:08,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:08,631 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:08,631 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374668565] [2021-06-12 17:26:08,632 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374668565] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:08,632 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:08,632 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-12 17:26:08,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901797039] [2021-06-12 17:26:08,633 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-12 17:26:08,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:08,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-12 17:26:08,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-12 17:26:08,637 INFO L87 Difference]: Start difference. First operand 3753 states and 10059 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:08,861 INFO L93 Difference]: Finished difference Result 5276 states and 14062 transitions. [2021-06-12 17:26:08,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-12 17:26:08,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-06-12 17:26:08,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:08,880 INFO L225 Difference]: With dead ends: 5276 [2021-06-12 17:26:08,880 INFO L226 Difference]: Without dead ends: 4475 [2021-06-12 17:26:08,881 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 65.5ms TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2021-06-12 17:26:08,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4475 states. [2021-06-12 17:26:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4475 to 4325. [2021-06-12 17:26:08,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4325 states, 4321 states have (on average 2.6931265910668825) internal successors, (11637), 4324 states have internal predecessors, (11637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 11637 transitions. [2021-06-12 17:26:08,988 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 11637 transitions. Word has length 66 [2021-06-12 17:26:08,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:08,990 INFO L482 AbstractCegarLoop]: Abstraction has 4325 states and 11637 transitions. [2021-06-12 17:26:08,990 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 11637 transitions. [2021-06-12 17:26:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-06-12 17:26:08,996 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:08,996 INFO L472 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] [2021-06-12 17:26:08,997 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-12 17:26:08,997 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:08,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:08,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1721881747, now seen corresponding path program 1 times [2021-06-12 17:26:08,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:08,997 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474964547] [2021-06-12 17:26:08,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:09,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:09,138 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:09,138 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474964547] [2021-06-12 17:26:09,138 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474964547] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:09,138 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:09,138 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-12 17:26:09,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374028593] [2021-06-12 17:26:09,139 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-12 17:26:09,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:09,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-12 17:26:09,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-12 17:26:09,140 INFO L87 Difference]: Start difference. First operand 4325 states and 11637 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:09,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:09,177 INFO L93 Difference]: Finished difference Result 1631 states and 4196 transitions. [2021-06-12 17:26:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-12 17:26:09,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2021-06-12 17:26:09,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:09,185 INFO L225 Difference]: With dead ends: 1631 [2021-06-12 17:26:09,185 INFO L226 Difference]: Without dead ends: 1631 [2021-06-12 17:26:09,185 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 27.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-06-12 17:26:09,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2021-06-12 17:26:09,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1631. [2021-06-12 17:26:09,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1629 states have (on average 2.575813382443217) internal successors, (4196), 1630 states have internal predecessors, (4196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 4196 transitions. [2021-06-12 17:26:09,217 INFO L78 Accepts]: Start accepts. Automaton has 1631 states and 4196 transitions. Word has length 78 [2021-06-12 17:26:09,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:09,217 INFO L482 AbstractCegarLoop]: Abstraction has 1631 states and 4196 transitions. [2021-06-12 17:26:09,218 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:09,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1631 states and 4196 transitions. [2021-06-12 17:26:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:09,221 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:09,221 INFO L472 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] [2021-06-12 17:26:09,221 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-12 17:26:09,222 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:09,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:09,222 INFO L82 PathProgramCache]: Analyzing trace with hash -735382200, now seen corresponding path program 1 times [2021-06-12 17:26:09,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:09,222 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62300750] [2021-06-12 17:26:09,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:09,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:09,980 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:09,980 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62300750] [2021-06-12 17:26:09,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62300750] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:09,980 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:09,980 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-06-12 17:26:09,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428657014] [2021-06-12 17:26:09,981 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-12 17:26:09,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:09,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-12 17:26:09,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2021-06-12 17:26:09,982 INFO L87 Difference]: Start difference. First operand 1631 states and 4196 transitions. Second operand has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:12,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:12,895 INFO L93 Difference]: Finished difference Result 2666 states and 6940 transitions. [2021-06-12 17:26:12,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-06-12 17:26:12,895 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:12,901 INFO L225 Difference]: With dead ends: 2666 [2021-06-12 17:26:12,901 INFO L226 Difference]: Without dead ends: 2666 [2021-06-12 17:26:12,902 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 2291.2ms TimeCoverageRelationStatistics Valid=842, Invalid=2464, Unknown=0, NotChecked=0, Total=3306 [2021-06-12 17:26:12,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2021-06-12 17:26:12,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2566. [2021-06-12 17:26:12,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2564 states have (on average 2.6326053042121687) internal successors, (6750), 2565 states have internal predecessors, (6750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 6750 transitions. [2021-06-12 17:26:12,948 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 6750 transitions. Word has length 105 [2021-06-12 17:26:12,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:12,949 INFO L482 AbstractCegarLoop]: Abstraction has 2566 states and 6750 transitions. [2021-06-12 17:26:12,949 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 6750 transitions. [2021-06-12 17:26:12,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:12,954 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:12,954 INFO L472 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] [2021-06-12 17:26:12,954 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-12 17:26:12,954 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:12,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:12,954 INFO L82 PathProgramCache]: Analyzing trace with hash 488844778, now seen corresponding path program 1 times [2021-06-12 17:26:12,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:12,955 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828649870] [2021-06-12 17:26:12,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:13,378 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:13,378 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828649870] [2021-06-12 17:26:13,378 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828649870] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:13,378 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:13,378 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-12 17:26:13,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919440738] [2021-06-12 17:26:13,379 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-12 17:26:13,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:13,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-12 17:26:13,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2021-06-12 17:26:13,379 INFO L87 Difference]: Start difference. First operand 2566 states and 6750 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:14,152 INFO L93 Difference]: Finished difference Result 3789 states and 9757 transitions. [2021-06-12 17:26:14,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-12 17:26:14,153 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:14,161 INFO L225 Difference]: With dead ends: 3789 [2021-06-12 17:26:14,161 INFO L226 Difference]: Without dead ends: 3789 [2021-06-12 17:26:14,162 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 525.8ms TimeCoverageRelationStatistics Valid=213, Invalid=489, Unknown=0, NotChecked=0, Total=702 [2021-06-12 17:26:14,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3789 states. [2021-06-12 17:26:14,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3789 to 3036. [2021-06-12 17:26:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3036 states, 3034 states have (on average 2.584377059986816) internal successors, (7841), 3035 states have internal predecessors, (7841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3036 states to 3036 states and 7841 transitions. [2021-06-12 17:26:14,232 INFO L78 Accepts]: Start accepts. Automaton has 3036 states and 7841 transitions. Word has length 105 [2021-06-12 17:26:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:14,232 INFO L482 AbstractCegarLoop]: Abstraction has 3036 states and 7841 transitions. [2021-06-12 17:26:14,232 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:14,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3036 states and 7841 transitions. [2021-06-12 17:26:14,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:14,239 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:14,239 INFO L472 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] [2021-06-12 17:26:14,240 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-12 17:26:14,240 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:14,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:14,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1787721726, now seen corresponding path program 2 times [2021-06-12 17:26:14,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:14,243 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887244189] [2021-06-12 17:26:14,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:14,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:14,631 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:14,631 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887244189] [2021-06-12 17:26:14,631 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887244189] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:14,632 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:14,632 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-12 17:26:14,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481538155] [2021-06-12 17:26:14,632 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-12 17:26:14,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:14,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-12 17:26:14,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-12 17:26:14,633 INFO L87 Difference]: Start difference. First operand 3036 states and 7841 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:15,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:15,376 INFO L93 Difference]: Finished difference Result 4077 states and 10298 transitions. [2021-06-12 17:26:15,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-12 17:26:15,377 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:15,385 INFO L225 Difference]: With dead ends: 4077 [2021-06-12 17:26:15,385 INFO L226 Difference]: Without dead ends: 4077 [2021-06-12 17:26:15,386 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 514.6ms TimeCoverageRelationStatistics Valid=232, Invalid=580, Unknown=0, NotChecked=0, Total=812 [2021-06-12 17:26:15,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4077 states. [2021-06-12 17:26:15,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4077 to 3066. [2021-06-12 17:26:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3066 states, 3064 states have (on average 2.5842036553524803) internal successors, (7918), 3065 states have internal predecessors, (7918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:15,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3066 states to 3066 states and 7918 transitions. [2021-06-12 17:26:15,455 INFO L78 Accepts]: Start accepts. Automaton has 3066 states and 7918 transitions. Word has length 105 [2021-06-12 17:26:15,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:15,456 INFO L482 AbstractCegarLoop]: Abstraction has 3066 states and 7918 transitions. [2021-06-12 17:26:15,456 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 3066 states and 7918 transitions. [2021-06-12 17:26:15,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:15,462 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:15,462 INFO L472 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] [2021-06-12 17:26:15,463 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-12 17:26:15,463 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:15,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:15,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1759874518, now seen corresponding path program 3 times [2021-06-12 17:26:15,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:15,463 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899898780] [2021-06-12 17:26:15,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:15,998 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:15,998 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899898780] [2021-06-12 17:26:15,998 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899898780] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:15,999 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:15,999 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-12 17:26:15,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121049284] [2021-06-12 17:26:15,999 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 17:26:15,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:16,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 17:26:16,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-06-12 17:26:16,000 INFO L87 Difference]: Start difference. First operand 3066 states and 7918 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:17,566 INFO L93 Difference]: Finished difference Result 4299 states and 10825 transitions. [2021-06-12 17:26:17,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-12 17:26:17,567 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:17,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:17,574 INFO L225 Difference]: With dead ends: 4299 [2021-06-12 17:26:17,574 INFO L226 Difference]: Without dead ends: 4299 [2021-06-12 17:26:17,575 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1366.4ms TimeCoverageRelationStatistics Valid=417, Invalid=1143, Unknown=0, NotChecked=0, Total=1560 [2021-06-12 17:26:17,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4299 states. [2021-06-12 17:26:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4299 to 3356. [2021-06-12 17:26:17,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3356 states, 3354 states have (on average 2.5837805605247466) internal successors, (8666), 3355 states have internal predecessors, (8666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:17,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 8666 transitions. [2021-06-12 17:26:17,647 INFO L78 Accepts]: Start accepts. Automaton has 3356 states and 8666 transitions. Word has length 105 [2021-06-12 17:26:17,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:17,648 INFO L482 AbstractCegarLoop]: Abstraction has 3356 states and 8666 transitions. [2021-06-12 17:26:17,648 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:17,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3356 states and 8666 transitions. [2021-06-12 17:26:17,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:17,655 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:17,655 INFO L472 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] [2021-06-12 17:26:17,655 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-12 17:26:17,655 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:17,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:17,656 INFO L82 PathProgramCache]: Analyzing trace with hash 187169344, now seen corresponding path program 4 times [2021-06-12 17:26:17,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:17,656 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60195342] [2021-06-12 17:26:17,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:18,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:18,046 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:18,046 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60195342] [2021-06-12 17:26:18,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60195342] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:18,046 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:18,046 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:18,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888755412] [2021-06-12 17:26:18,046 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:18,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:18,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:18,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:18,047 INFO L87 Difference]: Start difference. First operand 3356 states and 8666 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:19,285 INFO L93 Difference]: Finished difference Result 4498 states and 11407 transitions. [2021-06-12 17:26:19,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-12 17:26:19,286 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:19,292 INFO L225 Difference]: With dead ends: 4498 [2021-06-12 17:26:19,292 INFO L226 Difference]: Without dead ends: 4498 [2021-06-12 17:26:19,293 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1025.0ms TimeCoverageRelationStatistics Valid=288, Invalid=704, Unknown=0, NotChecked=0, Total=992 [2021-06-12 17:26:19,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4498 states. [2021-06-12 17:26:19,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4498 to 3551. [2021-06-12 17:26:19,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3551 states, 3549 states have (on average 2.5998872921949845) internal successors, (9227), 3550 states have internal predecessors, (9227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3551 states to 3551 states and 9227 transitions. [2021-06-12 17:26:19,361 INFO L78 Accepts]: Start accepts. Automaton has 3551 states and 9227 transitions. Word has length 105 [2021-06-12 17:26:19,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:19,361 INFO L482 AbstractCegarLoop]: Abstraction has 3551 states and 9227 transitions. [2021-06-12 17:26:19,361 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:19,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3551 states and 9227 transitions. [2021-06-12 17:26:19,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:19,369 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:19,369 INFO L472 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] [2021-06-12 17:26:19,369 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-12 17:26:19,369 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:19,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:19,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1971920312, now seen corresponding path program 5 times [2021-06-12 17:26:19,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:19,370 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410713366] [2021-06-12 17:26:19,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:19,755 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:19,755 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410713366] [2021-06-12 17:26:19,755 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410713366] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:19,755 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:19,755 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:19,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372059628] [2021-06-12 17:26:19,756 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:19,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:19,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:19,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:19,757 INFO L87 Difference]: Start difference. First operand 3551 states and 9227 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:21,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:21,072 INFO L93 Difference]: Finished difference Result 4275 states and 10837 transitions. [2021-06-12 17:26:21,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-12 17:26:21,073 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:21,079 INFO L225 Difference]: With dead ends: 4275 [2021-06-12 17:26:21,079 INFO L226 Difference]: Without dead ends: 4275 [2021-06-12 17:26:21,080 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1067.2ms TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2021-06-12 17:26:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2021-06-12 17:26:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 3553. [2021-06-12 17:26:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3553 states, 3551 states have (on average 2.5998310335116868) internal successors, (9232), 3552 states have internal predecessors, (9232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:21,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3553 states to 3553 states and 9232 transitions. [2021-06-12 17:26:21,167 INFO L78 Accepts]: Start accepts. Automaton has 3553 states and 9232 transitions. Word has length 105 [2021-06-12 17:26:21,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:21,167 INFO L482 AbstractCegarLoop]: Abstraction has 3553 states and 9232 transitions. [2021-06-12 17:26:21,168 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:21,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3553 states and 9232 transitions. [2021-06-12 17:26:21,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:21,175 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:21,175 INFO L472 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] [2021-06-12 17:26:21,175 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-12 17:26:21,176 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:21,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:21,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1033652586, now seen corresponding path program 6 times [2021-06-12 17:26:21,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:21,177 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775338043] [2021-06-12 17:26:21,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:21,732 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:21,733 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775338043] [2021-06-12 17:26:21,733 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775338043] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:21,733 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:21,733 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-12 17:26:21,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717377802] [2021-06-12 17:26:21,733 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 17:26:21,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:21,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 17:26:21,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2021-06-12 17:26:21,734 INFO L87 Difference]: Start difference. First operand 3553 states and 9232 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:23,414 INFO L93 Difference]: Finished difference Result 5180 states and 12800 transitions. [2021-06-12 17:26:23,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-12 17:26:23,415 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:23,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:23,418 INFO L225 Difference]: With dead ends: 5180 [2021-06-12 17:26:23,418 INFO L226 Difference]: Without dead ends: 5180 [2021-06-12 17:26:23,419 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1472.0ms TimeCoverageRelationStatistics Valid=423, Invalid=1217, Unknown=0, NotChecked=0, Total=1640 [2021-06-12 17:26:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5180 states. [2021-06-12 17:26:23,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5180 to 3529. [2021-06-12 17:26:23,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3529 states, 3527 states have (on average 2.5971080238162743) internal successors, (9160), 3528 states have internal predecessors, (9160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 3529 states and 9160 transitions. [2021-06-12 17:26:23,488 INFO L78 Accepts]: Start accepts. Automaton has 3529 states and 9160 transitions. Word has length 105 [2021-06-12 17:26:23,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:23,488 INFO L482 AbstractCegarLoop]: Abstraction has 3529 states and 9160 transitions. [2021-06-12 17:26:23,488 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 3529 states and 9160 transitions. [2021-06-12 17:26:23,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:23,496 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:23,496 INFO L472 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] [2021-06-12 17:26:23,496 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-12 17:26:23,496 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:23,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:23,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1654948062, now seen corresponding path program 7 times [2021-06-12 17:26:23,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:23,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414264617] [2021-06-12 17:26:23,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:24,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:24,131 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:24,131 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414264617] [2021-06-12 17:26:24,131 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414264617] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:24,131 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:24,131 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-12 17:26:24,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995656543] [2021-06-12 17:26:24,131 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 17:26:24,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:24,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 17:26:24,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2021-06-12 17:26:24,132 INFO L87 Difference]: Start difference. First operand 3529 states and 9160 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:25,572 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 53 [2021-06-12 17:26:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:25,948 INFO L93 Difference]: Finished difference Result 4434 states and 11097 transitions. [2021-06-12 17:26:25,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-12 17:26:25,950 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:25,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:25,954 INFO L225 Difference]: With dead ends: 4434 [2021-06-12 17:26:25,954 INFO L226 Difference]: Without dead ends: 4434 [2021-06-12 17:26:25,954 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1664.2ms TimeCoverageRelationStatistics Valid=326, Invalid=1006, Unknown=0, NotChecked=0, Total=1332 [2021-06-12 17:26:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4434 states. [2021-06-12 17:26:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4434 to 3537. [2021-06-12 17:26:26,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3537 states, 3535 states have (on average 2.596888260254597) internal successors, (9180), 3536 states have internal predecessors, (9180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3537 states to 3537 states and 9180 transitions. [2021-06-12 17:26:26,018 INFO L78 Accepts]: Start accepts. Automaton has 3537 states and 9180 transitions. Word has length 105 [2021-06-12 17:26:26,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:26,018 INFO L482 AbstractCegarLoop]: Abstraction has 3537 states and 9180 transitions. [2021-06-12 17:26:26,018 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:26,018 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states and 9180 transitions. [2021-06-12 17:26:26,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:26,028 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:26,028 INFO L472 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] [2021-06-12 17:26:26,028 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-12 17:26:26,029 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:26,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:26,029 INFO L82 PathProgramCache]: Analyzing trace with hash -594054976, now seen corresponding path program 8 times [2021-06-12 17:26:26,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:26,029 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316159507] [2021-06-12 17:26:26,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:26,422 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:26,422 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316159507] [2021-06-12 17:26:26,422 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316159507] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:26,422 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:26,422 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:26,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651011493] [2021-06-12 17:26:26,423 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:26,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:26,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:26,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:26,423 INFO L87 Difference]: Start difference. First operand 3537 states and 9180 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:28,414 INFO L93 Difference]: Finished difference Result 5067 states and 12513 transitions. [2021-06-12 17:26:28,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-12 17:26:28,415 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:28,419 INFO L225 Difference]: With dead ends: 5067 [2021-06-12 17:26:28,420 INFO L226 Difference]: Without dead ends: 5067 [2021-06-12 17:26:28,420 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1682.6ms TimeCoverageRelationStatistics Valid=459, Invalid=1263, Unknown=0, NotChecked=0, Total=1722 [2021-06-12 17:26:28,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2021-06-12 17:26:28,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 3531. [2021-06-12 17:26:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3531 states, 3529 states have (on average 2.5970529895154435) internal successors, (9165), 3530 states have internal predecessors, (9165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3531 states to 3531 states and 9165 transitions. [2021-06-12 17:26:28,507 INFO L78 Accepts]: Start accepts. Automaton has 3531 states and 9165 transitions. Word has length 105 [2021-06-12 17:26:28,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:28,508 INFO L482 AbstractCegarLoop]: Abstraction has 3531 states and 9165 transitions. [2021-06-12 17:26:28,508 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3531 states and 9165 transitions. [2021-06-12 17:26:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:28,514 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:28,514 INFO L472 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] [2021-06-12 17:26:28,515 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-12 17:26:28,515 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:28,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:28,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1036005680, now seen corresponding path program 9 times [2021-06-12 17:26:28,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:28,515 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677935196] [2021-06-12 17:26:28,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:28,821 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:28,821 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677935196] [2021-06-12 17:26:28,821 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677935196] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:28,821 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:28,821 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-12 17:26:28,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665955718] [2021-06-12 17:26:28,822 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-12 17:26:28,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:28,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-12 17:26:28,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-12 17:26:28,823 INFO L87 Difference]: Start difference. First operand 3531 states and 9165 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:29,430 INFO L93 Difference]: Finished difference Result 3944 states and 9981 transitions. [2021-06-12 17:26:29,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-12 17:26:29,431 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:29,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:29,436 INFO L225 Difference]: With dead ends: 3944 [2021-06-12 17:26:29,436 INFO L226 Difference]: Without dead ends: 3944 [2021-06-12 17:26:29,436 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 491.9ms TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2021-06-12 17:26:29,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2021-06-12 17:26:29,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3527. [2021-06-12 17:26:29,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3527 states, 3525 states have (on average 2.5988652482269505) internal successors, (9161), 3526 states have internal predecessors, (9161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3527 states to 3527 states and 9161 transitions. [2021-06-12 17:26:29,506 INFO L78 Accepts]: Start accepts. Automaton has 3527 states and 9161 transitions. Word has length 105 [2021-06-12 17:26:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:29,506 INFO L482 AbstractCegarLoop]: Abstraction has 3527 states and 9161 transitions. [2021-06-12 17:26:29,506 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3527 states and 9161 transitions. [2021-06-12 17:26:29,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:29,512 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:29,512 INFO L472 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] [2021-06-12 17:26:29,512 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-12 17:26:29,512 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:29,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:29,513 INFO L82 PathProgramCache]: Analyzing trace with hash 419287134, now seen corresponding path program 10 times [2021-06-12 17:26:29,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:29,513 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517646493] [2021-06-12 17:26:29,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:29,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:29,955 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:29,955 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517646493] [2021-06-12 17:26:29,956 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517646493] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:29,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:29,957 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:29,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330576193] [2021-06-12 17:26:29,957 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:29,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:29,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:29,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:29,959 INFO L87 Difference]: Start difference. First operand 3527 states and 9161 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:31,201 INFO L93 Difference]: Finished difference Result 4153 states and 10417 transitions. [2021-06-12 17:26:31,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-12 17:26:31,202 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:31,206 INFO L225 Difference]: With dead ends: 4153 [2021-06-12 17:26:31,206 INFO L226 Difference]: Without dead ends: 4153 [2021-06-12 17:26:31,206 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1079.8ms TimeCoverageRelationStatistics Valid=284, Invalid=838, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 17:26:31,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4153 states. [2021-06-12 17:26:31,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4153 to 3533. [2021-06-12 17:26:31,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3533 states, 3531 states have (on average 2.5986972529028605) internal successors, (9176), 3532 states have internal predecessors, (9176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:31,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3533 states to 3533 states and 9176 transitions. [2021-06-12 17:26:31,263 INFO L78 Accepts]: Start accepts. Automaton has 3533 states and 9176 transitions. Word has length 105 [2021-06-12 17:26:31,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:31,264 INFO L482 AbstractCegarLoop]: Abstraction has 3533 states and 9176 transitions. [2021-06-12 17:26:31,264 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:31,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3533 states and 9176 transitions. [2021-06-12 17:26:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:31,270 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:31,270 INFO L472 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] [2021-06-12 17:26:31,270 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-12 17:26:31,271 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:31,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:31,271 INFO L82 PathProgramCache]: Analyzing trace with hash -796621898, now seen corresponding path program 11 times [2021-06-12 17:26:31,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:31,271 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500384734] [2021-06-12 17:26:31,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:31,567 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:31,567 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500384734] [2021-06-12 17:26:31,567 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500384734] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:31,567 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:31,567 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-12 17:26:31,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481383208] [2021-06-12 17:26:31,568 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-12 17:26:31,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:31,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-12 17:26:31,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-06-12 17:26:31,569 INFO L87 Difference]: Start difference. First operand 3533 states and 9176 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:32,262 INFO L93 Difference]: Finished difference Result 4509 states and 11212 transitions. [2021-06-12 17:26:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-12 17:26:32,263 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:32,268 INFO L225 Difference]: With dead ends: 4509 [2021-06-12 17:26:32,268 INFO L226 Difference]: Without dead ends: 4509 [2021-06-12 17:26:32,269 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 544.7ms TimeCoverageRelationStatistics Valid=232, Invalid=580, Unknown=0, NotChecked=0, Total=812 [2021-06-12 17:26:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4509 states. [2021-06-12 17:26:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4509 to 3520. [2021-06-12 17:26:32,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3520 states, 3518 states have (on average 2.5974985787379192) internal successors, (9138), 3519 states have internal predecessors, (9138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3520 states to 3520 states and 9138 transitions. [2021-06-12 17:26:32,327 INFO L78 Accepts]: Start accepts. Automaton has 3520 states and 9138 transitions. Word has length 105 [2021-06-12 17:26:32,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:32,327 INFO L482 AbstractCegarLoop]: Abstraction has 3520 states and 9138 transitions. [2021-06-12 17:26:32,327 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:32,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3520 states and 9138 transitions. [2021-06-12 17:26:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:32,333 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:32,333 INFO L472 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] [2021-06-12 17:26:32,333 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-12 17:26:32,333 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:32,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:32,334 INFO L82 PathProgramCache]: Analyzing trace with hash 832988194, now seen corresponding path program 12 times [2021-06-12 17:26:32,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:32,334 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397251557] [2021-06-12 17:26:32,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:32,821 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:32,821 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397251557] [2021-06-12 17:26:32,821 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397251557] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:32,822 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:32,822 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-06-12 17:26:32,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466291976] [2021-06-12 17:26:32,824 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-06-12 17:26:32,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:32,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-06-12 17:26:32,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-06-12 17:26:32,825 INFO L87 Difference]: Start difference. First operand 3520 states and 9138 transitions. Second operand has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:34,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:34,059 INFO L93 Difference]: Finished difference Result 5120 states and 12988 transitions. [2021-06-12 17:26:34,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-12 17:26:34,060 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:34,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:34,064 INFO L225 Difference]: With dead ends: 5120 [2021-06-12 17:26:34,064 INFO L226 Difference]: Without dead ends: 5120 [2021-06-12 17:26:34,064 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1096.9ms TimeCoverageRelationStatistics Valid=286, Invalid=836, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 17:26:34,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5120 states. [2021-06-12 17:26:34,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5120 to 3619. [2021-06-12 17:26:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3619 states, 3617 states have (on average 2.6018800110588884) internal successors, (9411), 3618 states have internal predecessors, (9411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3619 states to 3619 states and 9411 transitions. [2021-06-12 17:26:34,125 INFO L78 Accepts]: Start accepts. Automaton has 3619 states and 9411 transitions. Word has length 105 [2021-06-12 17:26:34,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:34,126 INFO L482 AbstractCegarLoop]: Abstraction has 3619 states and 9411 transitions. [2021-06-12 17:26:34,126 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.25) internal successors, (105), 20 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:34,126 INFO L276 IsEmpty]: Start isEmpty. Operand 3619 states and 9411 transitions. [2021-06-12 17:26:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:34,131 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:34,132 INFO L472 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] [2021-06-12 17:26:34,132 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-12 17:26:34,132 INFO L430 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:34,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:34,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2142019302, now seen corresponding path program 13 times [2021-06-12 17:26:34,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:34,132 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528820566] [2021-06-12 17:26:34,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:34,502 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:34,502 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528820566] [2021-06-12 17:26:34,503 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528820566] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:34,503 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:34,503 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:34,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441820802] [2021-06-12 17:26:34,504 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:34,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:34,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:34,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:34,505 INFO L87 Difference]: Start difference. First operand 3619 states and 9411 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:35,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:35,844 INFO L93 Difference]: Finished difference Result 5756 states and 14572 transitions. [2021-06-12 17:26:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-12 17:26:35,844 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:35,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:35,849 INFO L225 Difference]: With dead ends: 5756 [2021-06-12 17:26:35,849 INFO L226 Difference]: Without dead ends: 5756 [2021-06-12 17:26:35,849 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1207.5ms TimeCoverageRelationStatistics Valid=288, Invalid=704, Unknown=0, NotChecked=0, Total=992 [2021-06-12 17:26:35,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5756 states. [2021-06-12 17:26:35,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5756 to 3655. [2021-06-12 17:26:35,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3655 states, 3653 states have (on average 2.6058034492198194) internal successors, (9519), 3654 states have internal predecessors, (9519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 3655 states and 9519 transitions. [2021-06-12 17:26:35,918 INFO L78 Accepts]: Start accepts. Automaton has 3655 states and 9519 transitions. Word has length 105 [2021-06-12 17:26:35,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:35,918 INFO L482 AbstractCegarLoop]: Abstraction has 3655 states and 9519 transitions. [2021-06-12 17:26:35,919 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:35,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 9519 transitions. [2021-06-12 17:26:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:35,925 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:35,925 INFO L472 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] [2021-06-12 17:26:35,925 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-12 17:26:35,925 INFO L430 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:35,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:35,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1456313546, now seen corresponding path program 14 times [2021-06-12 17:26:35,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:35,926 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878031154] [2021-06-12 17:26:35,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:36,296 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:36,296 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878031154] [2021-06-12 17:26:36,296 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878031154] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:36,296 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:36,296 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:36,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442629767] [2021-06-12 17:26:36,297 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:36,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:36,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:36,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:36,297 INFO L87 Difference]: Start difference. First operand 3655 states and 9519 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:37,663 INFO L93 Difference]: Finished difference Result 5527 states and 13989 transitions. [2021-06-12 17:26:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-12 17:26:37,664 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:37,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:37,668 INFO L225 Difference]: With dead ends: 5527 [2021-06-12 17:26:37,668 INFO L226 Difference]: Without dead ends: 5527 [2021-06-12 17:26:37,668 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1128.9ms TimeCoverageRelationStatistics Valid=286, Invalid=770, Unknown=0, NotChecked=0, Total=1056 [2021-06-12 17:26:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5527 states. [2021-06-12 17:26:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5527 to 3619. [2021-06-12 17:26:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3619 states, 3617 states have (on average 2.6018800110588884) internal successors, (9411), 3618 states have internal predecessors, (9411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3619 states to 3619 states and 9411 transitions. [2021-06-12 17:26:37,721 INFO L78 Accepts]: Start accepts. Automaton has 3619 states and 9411 transitions. Word has length 105 [2021-06-12 17:26:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:37,721 INFO L482 AbstractCegarLoop]: Abstraction has 3619 states and 9411 transitions. [2021-06-12 17:26:37,722 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:37,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3619 states and 9411 transitions. [2021-06-12 17:26:37,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:37,728 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:37,728 INFO L472 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] [2021-06-12 17:26:37,728 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-12 17:26:37,728 INFO L430 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:37,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:37,729 INFO L82 PathProgramCache]: Analyzing trace with hash 837734198, now seen corresponding path program 15 times [2021-06-12 17:26:37,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:37,729 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379301326] [2021-06-12 17:26:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:37,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:37,991 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:37,991 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379301326] [2021-06-12 17:26:37,991 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379301326] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:37,991 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:37,991 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-12 17:26:37,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806481106] [2021-06-12 17:26:37,991 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-12 17:26:37,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:37,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-12 17:26:37,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-06-12 17:26:37,992 INFO L87 Difference]: Start difference. First operand 3619 states and 9411 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:38,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:38,605 INFO L93 Difference]: Finished difference Result 4625 states and 11444 transitions. [2021-06-12 17:26:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-12 17:26:38,606 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:38,609 INFO L225 Difference]: With dead ends: 4625 [2021-06-12 17:26:38,610 INFO L226 Difference]: Without dead ends: 4625 [2021-06-12 17:26:38,610 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 501.1ms TimeCoverageRelationStatistics Valid=221, Invalid=591, Unknown=0, NotChecked=0, Total=812 [2021-06-12 17:26:38,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4625 states. [2021-06-12 17:26:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4625 to 3622. [2021-06-12 17:26:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3622 states, 3620 states have (on average 2.600276243093923) internal successors, (9413), 3621 states have internal predecessors, (9413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3622 states to 3622 states and 9413 transitions. [2021-06-12 17:26:38,659 INFO L78 Accepts]: Start accepts. Automaton has 3622 states and 9413 transitions. Word has length 105 [2021-06-12 17:26:38,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:38,660 INFO L482 AbstractCegarLoop]: Abstraction has 3622 states and 9413 transitions. [2021-06-12 17:26:38,660 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3622 states and 9413 transitions. [2021-06-12 17:26:38,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:38,666 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:38,666 INFO L472 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] [2021-06-12 17:26:38,666 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-12 17:26:38,666 INFO L430 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:38,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:38,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1042359838, now seen corresponding path program 16 times [2021-06-12 17:26:38,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:38,667 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756949875] [2021-06-12 17:26:38,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:39,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:39,038 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:39,038 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756949875] [2021-06-12 17:26:39,039 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756949875] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:39,039 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:39,039 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:39,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586031303] [2021-06-12 17:26:39,039 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:39,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:39,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:39,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:39,040 INFO L87 Difference]: Start difference. First operand 3622 states and 9413 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:40,237 INFO L93 Difference]: Finished difference Result 5127 states and 12920 transitions. [2021-06-12 17:26:40,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-12 17:26:40,237 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:40,241 INFO L225 Difference]: With dead ends: 5127 [2021-06-12 17:26:40,241 INFO L226 Difference]: Without dead ends: 5127 [2021-06-12 17:26:40,241 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1075.9ms TimeCoverageRelationStatistics Valid=295, Invalid=827, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 17:26:40,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5127 states. [2021-06-12 17:26:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5127 to 3624. [2021-06-12 17:26:40,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 3622 states have (on average 2.600220872446162) internal successors, (9418), 3623 states have internal predecessors, (9418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:40,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 9418 transitions. [2021-06-12 17:26:40,285 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 9418 transitions. Word has length 105 [2021-06-12 17:26:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:40,285 INFO L482 AbstractCegarLoop]: Abstraction has 3624 states and 9418 transitions. [2021-06-12 17:26:40,286 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:40,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 9418 transitions. [2021-06-12 17:26:40,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:40,291 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:40,291 INFO L472 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] [2021-06-12 17:26:40,292 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-12 17:26:40,292 INFO L430 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:40,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:40,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1725152698, now seen corresponding path program 17 times [2021-06-12 17:26:40,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:40,292 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775699323] [2021-06-12 17:26:40,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:40,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:40,695 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:40,695 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775699323] [2021-06-12 17:26:40,695 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775699323] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:40,695 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:40,695 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:40,695 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398984758] [2021-06-12 17:26:40,696 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:40,696 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:40,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:40,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:40,696 INFO L87 Difference]: Start difference. First operand 3624 states and 9418 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:42,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:42,452 INFO L93 Difference]: Finished difference Result 6511 states and 16225 transitions. [2021-06-12 17:26:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-12 17:26:42,453 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:42,459 INFO L225 Difference]: With dead ends: 6511 [2021-06-12 17:26:42,459 INFO L226 Difference]: Without dead ends: 6511 [2021-06-12 17:26:42,459 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1538.6ms TimeCoverageRelationStatistics Valid=449, Invalid=1033, Unknown=0, NotChecked=0, Total=1482 [2021-06-12 17:26:42,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6511 states. [2021-06-12 17:26:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6511 to 3672. [2021-06-12 17:26:42,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3672 states, 3670 states have (on average 2.605449591280654) internal successors, (9562), 3671 states have internal predecessors, (9562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:42,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 9562 transitions. [2021-06-12 17:26:42,510 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 9562 transitions. Word has length 105 [2021-06-12 17:26:42,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:42,511 INFO L482 AbstractCegarLoop]: Abstraction has 3672 states and 9562 transitions. [2021-06-12 17:26:42,511 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:42,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 9562 transitions. [2021-06-12 17:26:42,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:42,516 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:42,516 INFO L472 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] [2021-06-12 17:26:42,516 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-12 17:26:42,516 INFO L430 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:42,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:42,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1039446942, now seen corresponding path program 18 times [2021-06-12 17:26:42,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:42,517 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002888122] [2021-06-12 17:26:42,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:42,903 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:42,903 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002888122] [2021-06-12 17:26:42,903 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002888122] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:42,903 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:42,903 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:42,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085327630] [2021-06-12 17:26:42,904 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:42,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:42,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:42,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:42,904 INFO L87 Difference]: Start difference. First operand 3672 states and 9562 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:44,792 INFO L93 Difference]: Finished difference Result 6278 states and 15634 transitions. [2021-06-12 17:26:44,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-12 17:26:44,794 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:44,798 INFO L225 Difference]: With dead ends: 6278 [2021-06-12 17:26:44,798 INFO L226 Difference]: Without dead ends: 6278 [2021-06-12 17:26:44,798 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1548.4ms TimeCoverageRelationStatistics Valid=434, Invalid=1126, Unknown=0, NotChecked=0, Total=1560 [2021-06-12 17:26:44,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6278 states. [2021-06-12 17:26:44,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6278 to 3636. [2021-06-12 17:26:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3636 states, 3634 states have (on average 2.601541001651073) internal successors, (9454), 3635 states have internal predecessors, (9454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:44,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 9454 transitions. [2021-06-12 17:26:44,841 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 9454 transitions. Word has length 105 [2021-06-12 17:26:44,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:44,842 INFO L482 AbstractCegarLoop]: Abstraction has 3636 states and 9454 transitions. [2021-06-12 17:26:44,842 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 9454 transitions. [2021-06-12 17:26:44,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:44,845 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:44,845 INFO L472 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] [2021-06-12 17:26:44,845 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-12 17:26:44,845 INFO L430 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:44,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:44,846 INFO L82 PathProgramCache]: Analyzing trace with hash -792087630, now seen corresponding path program 19 times [2021-06-12 17:26:44,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:44,846 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099052642] [2021-06-12 17:26:44,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:45,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:45,212 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:45,212 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099052642] [2021-06-12 17:26:45,212 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099052642] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:45,212 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:45,212 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:45,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923342627] [2021-06-12 17:26:45,213 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:45,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:45,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:45,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:45,213 INFO L87 Difference]: Start difference. First operand 3636 states and 9454 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:46,691 INFO L93 Difference]: Finished difference Result 5693 states and 14188 transitions. [2021-06-12 17:26:46,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-12 17:26:46,691 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:46,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:46,696 INFO L225 Difference]: With dead ends: 5693 [2021-06-12 17:26:46,696 INFO L226 Difference]: Without dead ends: 5693 [2021-06-12 17:26:46,696 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1160.5ms TimeCoverageRelationStatistics Valid=320, Invalid=870, Unknown=0, NotChecked=0, Total=1190 [2021-06-12 17:26:46,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5693 states. [2021-06-12 17:26:46,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5693 to 3624. [2021-06-12 17:26:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3624 states, 3622 states have (on average 2.600220872446162) internal successors, (9418), 3623 states have internal predecessors, (9418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:46,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3624 states to 3624 states and 9418 transitions. [2021-06-12 17:26:46,747 INFO L78 Accepts]: Start accepts. Automaton has 3624 states and 9418 transitions. Word has length 105 [2021-06-12 17:26:46,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:46,747 INFO L482 AbstractCegarLoop]: Abstraction has 3624 states and 9418 transitions. [2021-06-12 17:26:46,747 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:46,747 INFO L276 IsEmpty]: Start isEmpty. Operand 3624 states and 9418 transitions. [2021-06-12 17:26:46,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:46,750 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:46,750 INFO L472 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] [2021-06-12 17:26:46,750 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-12 17:26:46,751 INFO L430 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:46,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:46,751 INFO L82 PathProgramCache]: Analyzing trace with hash -2082746550, now seen corresponding path program 20 times [2021-06-12 17:26:46,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:46,751 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690817962] [2021-06-12 17:26:46,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:47,185 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:47,185 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690817962] [2021-06-12 17:26:47,185 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690817962] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:47,185 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:47,185 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:47,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888848843] [2021-06-12 17:26:47,185 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:47,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:47,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:47,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:47,186 INFO L87 Difference]: Start difference. First operand 3624 states and 9418 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:48,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:48,500 INFO L93 Difference]: Finished difference Result 4795 states and 11953 transitions. [2021-06-12 17:26:48,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-12 17:26:48,501 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:48,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:48,506 INFO L225 Difference]: With dead ends: 4795 [2021-06-12 17:26:48,506 INFO L226 Difference]: Without dead ends: 4795 [2021-06-12 17:26:48,507 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1172.9ms TimeCoverageRelationStatistics Valid=284, Invalid=838, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 17:26:48,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4795 states. [2021-06-12 17:26:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4795 to 3626. [2021-06-12 17:26:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3626 states, 3624 states have (on average 2.600165562913907) internal successors, (9423), 3625 states have internal predecessors, (9423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 9423 transitions. [2021-06-12 17:26:48,562 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 9423 transitions. Word has length 105 [2021-06-12 17:26:48,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:48,562 INFO L482 AbstractCegarLoop]: Abstraction has 3626 states and 9423 transitions. [2021-06-12 17:26:48,562 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 9423 transitions. [2021-06-12 17:26:48,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:48,566 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:48,566 INFO L472 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] [2021-06-12 17:26:48,566 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-12 17:26:48,566 INFO L430 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:48,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:48,567 INFO L82 PathProgramCache]: Analyzing trace with hash -635137250, now seen corresponding path program 21 times [2021-06-12 17:26:48,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:48,567 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183414824] [2021-06-12 17:26:48,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:48,909 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:48,909 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183414824] [2021-06-12 17:26:48,909 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183414824] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:48,909 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:48,909 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:48,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239218457] [2021-06-12 17:26:48,910 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:48,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:48,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:48,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:48,910 INFO L87 Difference]: Start difference. First operand 3626 states and 9423 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:50,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:50,165 INFO L93 Difference]: Finished difference Result 4735 states and 11824 transitions. [2021-06-12 17:26:50,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-12 17:26:50,166 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:50,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:50,170 INFO L225 Difference]: With dead ends: 4735 [2021-06-12 17:26:50,170 INFO L226 Difference]: Without dead ends: 4735 [2021-06-12 17:26:50,171 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1054.2ms TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2021-06-12 17:26:50,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4735 states. [2021-06-12 17:26:50,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4735 to 3626. [2021-06-12 17:26:50,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3626 states, 3624 states have (on average 2.600165562913907) internal successors, (9423), 3625 states have internal predecessors, (9423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3626 states to 3626 states and 9423 transitions. [2021-06-12 17:26:50,217 INFO L78 Accepts]: Start accepts. Automaton has 3626 states and 9423 transitions. Word has length 105 [2021-06-12 17:26:50,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:50,218 INFO L482 AbstractCegarLoop]: Abstraction has 3626 states and 9423 transitions. [2021-06-12 17:26:50,218 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3626 states and 9423 transitions. [2021-06-12 17:26:50,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:50,221 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:50,221 INFO L472 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] [2021-06-12 17:26:50,221 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-12 17:26:50,221 INFO L430 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:50,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:50,222 INFO L82 PathProgramCache]: Analyzing trace with hash -2114633644, now seen corresponding path program 22 times [2021-06-12 17:26:50,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:50,222 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641421637] [2021-06-12 17:26:50,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:50,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:50,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:50,612 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:50,612 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641421637] [2021-06-12 17:26:50,612 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641421637] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:50,612 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:50,613 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:50,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365716398] [2021-06-12 17:26:50,613 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:50,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:50,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:50,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:50,617 INFO L87 Difference]: Start difference. First operand 3626 states and 9423 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:51,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:51,577 INFO L93 Difference]: Finished difference Result 4621 states and 11441 transitions. [2021-06-12 17:26:51,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-12 17:26:51,577 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:51,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:51,581 INFO L225 Difference]: With dead ends: 4621 [2021-06-12 17:26:51,581 INFO L226 Difference]: Without dead ends: 4621 [2021-06-12 17:26:51,582 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 804.1ms TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 17:26:51,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4621 states. [2021-06-12 17:26:51,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4621 to 3620. [2021-06-12 17:26:51,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3620 states, 3618 states have (on average 2.600331674958541) internal successors, (9408), 3619 states have internal predecessors, (9408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 3620 states and 9408 transitions. [2021-06-12 17:26:51,625 INFO L78 Accepts]: Start accepts. Automaton has 3620 states and 9408 transitions. Word has length 105 [2021-06-12 17:26:51,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:51,625 INFO L482 AbstractCegarLoop]: Abstraction has 3620 states and 9408 transitions. [2021-06-12 17:26:51,625 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:51,625 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 9408 transitions. [2021-06-12 17:26:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:51,628 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:51,628 INFO L472 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] [2021-06-12 17:26:51,629 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-12 17:26:51,629 INFO L430 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:51,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:51,629 INFO L82 PathProgramCache]: Analyzing trace with hash -318688926, now seen corresponding path program 23 times [2021-06-12 17:26:51,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:51,629 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17916158] [2021-06-12 17:26:51,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:52,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:52,021 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:52,021 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17916158] [2021-06-12 17:26:52,022 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17916158] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:52,022 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:52,022 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:52,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064913209] [2021-06-12 17:26:52,022 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:52,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:52,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:52,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:52,023 INFO L87 Difference]: Start difference. First operand 3620 states and 9408 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:53,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:53,149 INFO L93 Difference]: Finished difference Result 4396 states and 10944 transitions. [2021-06-12 17:26:53,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-12 17:26:53,150 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:53,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:53,154 INFO L225 Difference]: With dead ends: 4396 [2021-06-12 17:26:53,154 INFO L226 Difference]: Without dead ends: 4396 [2021-06-12 17:26:53,155 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 987.8ms TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 17:26:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4396 states. [2021-06-12 17:26:53,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4396 to 3620. [2021-06-12 17:26:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3620 states, 3618 states have (on average 2.600331674958541) internal successors, (9408), 3619 states have internal predecessors, (9408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:53,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3620 states to 3620 states and 9408 transitions. [2021-06-12 17:26:53,196 INFO L78 Accepts]: Start accepts. Automaton has 3620 states and 9408 transitions. Word has length 105 [2021-06-12 17:26:53,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:53,196 INFO L482 AbstractCegarLoop]: Abstraction has 3620 states and 9408 transitions. [2021-06-12 17:26:53,197 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:53,197 INFO L276 IsEmpty]: Start isEmpty. Operand 3620 states and 9408 transitions. [2021-06-12 17:26:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:53,200 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:53,200 INFO L472 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] [2021-06-12 17:26:53,200 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-12 17:26:53,200 INFO L430 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:53,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:53,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1667670798, now seen corresponding path program 24 times [2021-06-12 17:26:53,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:53,200 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103607566] [2021-06-12 17:26:53,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:53,553 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:53,553 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103607566] [2021-06-12 17:26:53,553 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103607566] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:53,553 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:53,553 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:53,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747496290] [2021-06-12 17:26:53,553 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:53,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:53,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:53,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:53,554 INFO L87 Difference]: Start difference. First operand 3620 states and 9408 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:54,745 INFO L93 Difference]: Finished difference Result 4479 states and 11103 transitions. [2021-06-12 17:26:54,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-12 17:26:54,746 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:54,750 INFO L225 Difference]: With dead ends: 4479 [2021-06-12 17:26:54,750 INFO L226 Difference]: Without dead ends: 4479 [2021-06-12 17:26:54,751 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1032.7ms TimeCoverageRelationStatistics Valid=298, Invalid=892, Unknown=0, NotChecked=0, Total=1190 [2021-06-12 17:26:54,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4479 states. [2021-06-12 17:26:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4479 to 3616. [2021-06-12 17:26:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3616 states, 3614 states have (on average 2.600442722744881) internal successors, (9398), 3615 states have internal predecessors, (9398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:54,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 3616 states and 9398 transitions. [2021-06-12 17:26:54,794 INFO L78 Accepts]: Start accepts. Automaton has 3616 states and 9398 transitions. Word has length 105 [2021-06-12 17:26:54,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:54,794 INFO L482 AbstractCegarLoop]: Abstraction has 3616 states and 9398 transitions. [2021-06-12 17:26:54,794 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3616 states and 9398 transitions. [2021-06-12 17:26:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:54,797 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:54,797 INFO L472 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] [2021-06-12 17:26:54,797 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-12 17:26:54,797 INFO L430 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:54,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:54,798 INFO L82 PathProgramCache]: Analyzing trace with hash -369811618, now seen corresponding path program 25 times [2021-06-12 17:26:54,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:54,798 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51175762] [2021-06-12 17:26:54,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:55,060 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:55,061 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51175762] [2021-06-12 17:26:55,061 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51175762] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:55,061 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:55,061 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-06-12 17:26:55,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164682176] [2021-06-12 17:26:55,061 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-12 17:26:55,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:55,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-12 17:26:55,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-06-12 17:26:55,062 INFO L87 Difference]: Start difference. First operand 3616 states and 9398 transitions. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:55,688 INFO L93 Difference]: Finished difference Result 4063 states and 10283 transitions. [2021-06-12 17:26:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-12 17:26:55,688 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:55,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:55,692 INFO L225 Difference]: With dead ends: 4063 [2021-06-12 17:26:55,692 INFO L226 Difference]: Without dead ends: 4063 [2021-06-12 17:26:55,692 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 492.3ms TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2021-06-12 17:26:55,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2021-06-12 17:26:55,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 3548. [2021-06-12 17:26:55,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3548 states, 3546 states have (on average 2.604624929498026) internal successors, (9236), 3547 states have internal predecessors, (9236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3548 states to 3548 states and 9236 transitions. [2021-06-12 17:26:55,738 INFO L78 Accepts]: Start accepts. Automaton has 3548 states and 9236 transitions. Word has length 105 [2021-06-12 17:26:55,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:55,738 INFO L482 AbstractCegarLoop]: Abstraction has 3548 states and 9236 transitions. [2021-06-12 17:26:55,738 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3548 states and 9236 transitions. [2021-06-12 17:26:55,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:55,741 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:55,742 INFO L472 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] [2021-06-12 17:26:55,742 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-12 17:26:55,742 INFO L430 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:55,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:55,742 INFO L82 PathProgramCache]: Analyzing trace with hash -124075606, now seen corresponding path program 26 times [2021-06-12 17:26:55,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:55,743 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916243403] [2021-06-12 17:26:55,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:56,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:56,121 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:56,121 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916243403] [2021-06-12 17:26:56,122 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916243403] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:56,122 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:56,122 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:56,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236801203] [2021-06-12 17:26:56,122 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:56,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:56,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:56,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:56,123 INFO L87 Difference]: Start difference. First operand 3548 states and 9236 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:57,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:57,316 INFO L93 Difference]: Finished difference Result 5792 states and 14693 transitions. [2021-06-12 17:26:57,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-12 17:26:57,316 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:57,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:57,320 INFO L225 Difference]: With dead ends: 5792 [2021-06-12 17:26:57,320 INFO L226 Difference]: Without dead ends: 5792 [2021-06-12 17:26:57,321 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1015.5ms TimeCoverageRelationStatistics Valid=290, Invalid=702, Unknown=0, NotChecked=0, Total=992 [2021-06-12 17:26:57,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5792 states. [2021-06-12 17:26:57,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5792 to 3774. [2021-06-12 17:26:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3774 states, 3772 states have (on average 2.627253446447508) internal successors, (9910), 3773 states have internal predecessors, (9910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 9910 transitions. [2021-06-12 17:26:57,373 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 9910 transitions. Word has length 105 [2021-06-12 17:26:57,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:57,373 INFO L482 AbstractCegarLoop]: Abstraction has 3774 states and 9910 transitions. [2021-06-12 17:26:57,373 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 9910 transitions. [2021-06-12 17:26:57,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:57,377 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:57,377 INFO L472 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] [2021-06-12 17:26:57,377 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-06-12 17:26:57,377 INFO L430 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:57,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:57,378 INFO L82 PathProgramCache]: Analyzing trace with hash -809781362, now seen corresponding path program 27 times [2021-06-12 17:26:57,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:57,378 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121054411] [2021-06-12 17:26:57,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:57,717 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:57,717 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121054411] [2021-06-12 17:26:57,717 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121054411] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:57,717 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:57,717 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:57,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979438358] [2021-06-12 17:26:57,718 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:57,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:57,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:57,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:57,718 INFO L87 Difference]: Start difference. First operand 3774 states and 9910 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:26:58,915 INFO L93 Difference]: Finished difference Result 5338 states and 13542 transitions. [2021-06-12 17:26:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-12 17:26:58,915 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:26:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:26:58,919 INFO L225 Difference]: With dead ends: 5338 [2021-06-12 17:26:58,919 INFO L226 Difference]: Without dead ends: 5338 [2021-06-12 17:26:58,919 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1031.0ms TimeCoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2021-06-12 17:26:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5338 states. [2021-06-12 17:26:58,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5338 to 3743. [2021-06-12 17:26:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3743 states, 3741 states have (on average 2.623630045442395) internal successors, (9815), 3742 states have internal predecessors, (9815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3743 states to 3743 states and 9815 transitions. [2021-06-12 17:26:58,976 INFO L78 Accepts]: Start accepts. Automaton has 3743 states and 9815 transitions. Word has length 105 [2021-06-12 17:26:58,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:26:58,976 INFO L482 AbstractCegarLoop]: Abstraction has 3743 states and 9815 transitions. [2021-06-12 17:26:58,976 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:26:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3743 states and 9815 transitions. [2021-06-12 17:26:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:26:58,980 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:26:58,980 INFO L472 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] [2021-06-12 17:26:58,980 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-06-12 17:26:58,981 INFO L430 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:26:58,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:26:58,981 INFO L82 PathProgramCache]: Analyzing trace with hash 889122722, now seen corresponding path program 28 times [2021-06-12 17:26:58,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:26:58,981 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021050] [2021-06-12 17:26:58,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:26:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:26:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:26:59,297 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:26:59,297 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021050] [2021-06-12 17:26:59,297 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021050] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:26:59,297 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:26:59,297 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:26:59,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207960969] [2021-06-12 17:26:59,297 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:26:59,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:26:59,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:26:59,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:26:59,298 INFO L87 Difference]: Start difference. First operand 3743 states and 9815 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:00,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:00,472 INFO L93 Difference]: Finished difference Result 5534 states and 13944 transitions. [2021-06-12 17:27:00,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-12 17:27:00,472 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:00,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:00,476 INFO L225 Difference]: With dead ends: 5534 [2021-06-12 17:27:00,476 INFO L226 Difference]: Without dead ends: 5534 [2021-06-12 17:27:00,477 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1001.4ms TimeCoverageRelationStatistics Valid=297, Invalid=825, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 17:27:00,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5534 states. [2021-06-12 17:27:00,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5534 to 3712. [2021-06-12 17:27:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3712 states, 3710 states have (on average 2.6199460916442048) internal successors, (9720), 3711 states have internal predecessors, (9720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 9720 transitions. [2021-06-12 17:27:00,523 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 9720 transitions. Word has length 105 [2021-06-12 17:27:00,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:00,524 INFO L482 AbstractCegarLoop]: Abstraction has 3712 states and 9720 transitions. [2021-06-12 17:27:00,524 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 9720 transitions. [2021-06-12 17:27:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:00,527 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:00,527 INFO L472 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] [2021-06-12 17:27:00,527 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-06-12 17:27:00,527 INFO L430 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:00,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:00,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2013372850, now seen corresponding path program 29 times [2021-06-12 17:27:00,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:00,527 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160827148] [2021-06-12 17:27:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:00,913 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:00,913 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160827148] [2021-06-12 17:27:00,913 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160827148] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:00,914 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:00,914 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:00,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005000101] [2021-06-12 17:27:00,914 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:00,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:00,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:00,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:00,915 INFO L87 Difference]: Start difference. First operand 3712 states and 9720 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:02,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:02,051 INFO L93 Difference]: Finished difference Result 4556 states and 11438 transitions. [2021-06-12 17:27:02,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-12 17:27:02,052 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:02,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:02,055 INFO L225 Difference]: With dead ends: 4556 [2021-06-12 17:27:02,055 INFO L226 Difference]: Without dead ends: 4556 [2021-06-12 17:27:02,056 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 922.3ms TimeCoverageRelationStatistics Valid=286, Invalid=836, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 17:27:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4556 states. [2021-06-12 17:27:02,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4556 to 3742. [2021-06-12 17:27:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3740 states have (on average 2.6189839572192515) internal successors, (9795), 3741 states have internal predecessors, (9795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:02,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 9795 transitions. [2021-06-12 17:27:02,099 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 9795 transitions. Word has length 105 [2021-06-12 17:27:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:02,099 INFO L482 AbstractCegarLoop]: Abstraction has 3742 states and 9795 transitions. [2021-06-12 17:27:02,099 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 9795 transitions. [2021-06-12 17:27:02,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:02,103 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:02,103 INFO L472 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] [2021-06-12 17:27:02,103 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-06-12 17:27:02,104 INFO L430 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:02,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:02,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2032954612, now seen corresponding path program 30 times [2021-06-12 17:27:02,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:02,104 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448903772] [2021-06-12 17:27:02,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:02,433 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:02,433 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448903772] [2021-06-12 17:27:02,433 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448903772] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:02,434 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:02,434 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:02,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249668872] [2021-06-12 17:27:02,434 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:02,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:02,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:02,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:02,435 INFO L87 Difference]: Start difference. First operand 3742 states and 9795 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:03,063 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2021-06-12 17:27:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:03,747 INFO L93 Difference]: Finished difference Result 7647 states and 19247 transitions. [2021-06-12 17:27:03,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-06-12 17:27:03,747 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:03,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:03,753 INFO L225 Difference]: With dead ends: 7647 [2021-06-12 17:27:03,754 INFO L226 Difference]: Without dead ends: 7647 [2021-06-12 17:27:03,754 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1109.7ms TimeCoverageRelationStatistics Valid=289, Invalid=703, Unknown=0, NotChecked=0, Total=992 [2021-06-12 17:27:03,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7647 states. [2021-06-12 17:27:03,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7647 to 3814. [2021-06-12 17:27:03,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3814 states, 3812 states have (on average 2.626180482686254) internal successors, (10011), 3813 states have internal predecessors, (10011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3814 states to 3814 states and 10011 transitions. [2021-06-12 17:27:03,807 INFO L78 Accepts]: Start accepts. Automaton has 3814 states and 10011 transitions. Word has length 105 [2021-06-12 17:27:03,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:03,808 INFO L482 AbstractCegarLoop]: Abstraction has 3814 states and 10011 transitions. [2021-06-12 17:27:03,808 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:03,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3814 states and 10011 transitions. [2021-06-12 17:27:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:03,811 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:03,811 INFO L472 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] [2021-06-12 17:27:03,811 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-06-12 17:27:03,811 INFO L430 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:03,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:03,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1347248856, now seen corresponding path program 31 times [2021-06-12 17:27:03,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:03,812 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144761605] [2021-06-12 17:27:03,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:04,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:04,100 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:04,100 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144761605] [2021-06-12 17:27:04,100 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144761605] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:04,100 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:04,100 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:04,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949056085] [2021-06-12 17:27:04,101 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:04,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:04,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:04,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:04,102 INFO L87 Difference]: Start difference. First operand 3814 states and 10011 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:05,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:05,343 INFO L93 Difference]: Finished difference Result 7193 states and 18096 transitions. [2021-06-12 17:27:05,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-12 17:27:05,343 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:05,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:05,350 INFO L225 Difference]: With dead ends: 7193 [2021-06-12 17:27:05,350 INFO L226 Difference]: Without dead ends: 7193 [2021-06-12 17:27:05,350 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1021.1ms TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2021-06-12 17:27:05,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7193 states. [2021-06-12 17:27:05,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7193 to 3742. [2021-06-12 17:27:05,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3740 states have (on average 2.6189839572192515) internal successors, (9795), 3741 states have internal predecessors, (9795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 9795 transitions. [2021-06-12 17:27:05,405 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 9795 transitions. Word has length 105 [2021-06-12 17:27:05,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:05,405 INFO L482 AbstractCegarLoop]: Abstraction has 3742 states and 9795 transitions. [2021-06-12 17:27:05,406 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:05,406 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 9795 transitions. [2021-06-12 17:27:05,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:05,410 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:05,410 INFO L472 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] [2021-06-12 17:27:05,410 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-06-12 17:27:05,410 INFO L430 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:05,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:05,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1248814356, now seen corresponding path program 32 times [2021-06-12 17:27:05,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:05,411 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830864933] [2021-06-12 17:27:05,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:05,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:05,732 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:05,732 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830864933] [2021-06-12 17:27:05,732 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830864933] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:05,732 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:05,732 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:05,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468219143] [2021-06-12 17:27:05,733 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:05,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:05,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:05,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:05,733 INFO L87 Difference]: Start difference. First operand 3742 states and 9795 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:06,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:06,935 INFO L93 Difference]: Finished difference Result 6538 states and 16410 transitions. [2021-06-12 17:27:06,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-12 17:27:06,935 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:06,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:06,941 INFO L225 Difference]: With dead ends: 6538 [2021-06-12 17:27:06,941 INFO L226 Difference]: Without dead ends: 6538 [2021-06-12 17:27:06,941 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1017.5ms TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 17:27:06,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2021-06-12 17:27:06,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 3669. [2021-06-12 17:27:06,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3669 states, 3667 states have (on average 2.61139896373057) internal successors, (9576), 3668 states have internal predecessors, (9576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:06,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3669 states to 3669 states and 9576 transitions. [2021-06-12 17:27:06,991 INFO L78 Accepts]: Start accepts. Automaton has 3669 states and 9576 transitions. Word has length 105 [2021-06-12 17:27:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:06,991 INFO L482 AbstractCegarLoop]: Abstraction has 3669 states and 9576 transitions. [2021-06-12 17:27:06,992 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 3669 states and 9576 transitions. [2021-06-12 17:27:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:06,995 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:06,995 INFO L472 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] [2021-06-12 17:27:06,995 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-06-12 17:27:06,995 INFO L430 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:06,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:06,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1616088008, now seen corresponding path program 33 times [2021-06-12 17:27:06,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:06,995 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615410236] [2021-06-12 17:27:06,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:07,358 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:07,358 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615410236] [2021-06-12 17:27:07,358 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615410236] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:07,358 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:07,358 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:07,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693300130] [2021-06-12 17:27:07,359 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:07,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:07,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:07,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:07,359 INFO L87 Difference]: Start difference. First operand 3669 states and 9576 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:09,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:09,077 INFO L93 Difference]: Finished difference Result 6413 states and 15962 transitions. [2021-06-12 17:27:09,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-06-12 17:27:09,078 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:09,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:09,083 INFO L225 Difference]: With dead ends: 6413 [2021-06-12 17:27:09,083 INFO L226 Difference]: Without dead ends: 6413 [2021-06-12 17:27:09,084 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1477.5ms TimeCoverageRelationStatistics Valid=450, Invalid=1032, Unknown=0, NotChecked=0, Total=1482 [2021-06-12 17:27:09,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6413 states. [2021-06-12 17:27:09,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6413 to 2966. [2021-06-12 17:27:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2966 states, 2964 states have (on average 2.6039136302294197) internal successors, (7718), 2965 states have internal predecessors, (7718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2966 states to 2966 states and 7718 transitions. [2021-06-12 17:27:09,138 INFO L78 Accepts]: Start accepts. Automaton has 2966 states and 7718 transitions. Word has length 105 [2021-06-12 17:27:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:09,138 INFO L482 AbstractCegarLoop]: Abstraction has 2966 states and 7718 transitions. [2021-06-12 17:27:09,138 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2966 states and 7718 transitions. [2021-06-12 17:27:09,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:09,141 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:09,141 INFO L472 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] [2021-06-12 17:27:09,141 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-06-12 17:27:09,142 INFO L430 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:09,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:09,142 INFO L82 PathProgramCache]: Analyzing trace with hash 930382252, now seen corresponding path program 34 times [2021-06-12 17:27:09,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:09,142 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888524803] [2021-06-12 17:27:09,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:09,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:09,437 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:09,437 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888524803] [2021-06-12 17:27:09,437 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888524803] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:09,437 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:09,438 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:09,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822367198] [2021-06-12 17:27:09,438 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:09,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:09,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:09,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:09,438 INFO L87 Difference]: Start difference. First operand 2966 states and 7718 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:11,197 INFO L93 Difference]: Finished difference Result 5916 states and 14711 transitions. [2021-06-12 17:27:11,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-12 17:27:11,197 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:11,200 INFO L225 Difference]: With dead ends: 5916 [2021-06-12 17:27:11,200 INFO L226 Difference]: Without dead ends: 5916 [2021-06-12 17:27:11,201 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1489.0ms TimeCoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2021-06-12 17:27:11,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5916 states. [2021-06-12 17:27:11,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5916 to 2891. [2021-06-12 17:27:11,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2891 states, 2889 states have (on average 2.593631014191762) internal successors, (7493), 2890 states have internal predecessors, (7493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:11,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2891 states to 2891 states and 7493 transitions. [2021-06-12 17:27:11,238 INFO L78 Accepts]: Start accepts. Automaton has 2891 states and 7493 transitions. Word has length 105 [2021-06-12 17:27:11,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:11,238 INFO L482 AbstractCegarLoop]: Abstraction has 2891 states and 7493 transitions. [2021-06-12 17:27:11,238 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:11,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 7493 transitions. [2021-06-12 17:27:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:11,241 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:11,241 INFO L472 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] [2021-06-12 17:27:11,241 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-06-12 17:27:11,242 INFO L430 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:11,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:11,242 INFO L82 PathProgramCache]: Analyzing trace with hash -901152320, now seen corresponding path program 35 times [2021-06-12 17:27:11,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:11,242 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128866270] [2021-06-12 17:27:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:11,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:11,553 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:11,553 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128866270] [2021-06-12 17:27:11,553 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128866270] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:11,553 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:11,554 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:11,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678780307] [2021-06-12 17:27:11,554 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:11,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:11,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:11,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:11,554 INFO L87 Difference]: Start difference. First operand 2891 states and 7493 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:12,873 INFO L93 Difference]: Finished difference Result 4866 states and 12039 transitions. [2021-06-12 17:27:12,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-12 17:27:12,874 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:12,878 INFO L225 Difference]: With dead ends: 4866 [2021-06-12 17:27:12,878 INFO L226 Difference]: Without dead ends: 4866 [2021-06-12 17:27:12,878 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1098.5ms TimeCoverageRelationStatistics Valid=321, Invalid=869, Unknown=0, NotChecked=0, Total=1190 [2021-06-12 17:27:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4866 states. [2021-06-12 17:27:12,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4866 to 2880. [2021-06-12 17:27:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2880 states, 2878 states have (on average 2.592077831827658) internal successors, (7460), 2879 states have internal predecessors, (7460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2880 states to 2880 states and 7460 transitions. [2021-06-12 17:27:12,916 INFO L78 Accepts]: Start accepts. Automaton has 2880 states and 7460 transitions. Word has length 105 [2021-06-12 17:27:12,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:12,916 INFO L482 AbstractCegarLoop]: Abstraction has 2880 states and 7460 transitions. [2021-06-12 17:27:12,916 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:12,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2880 states and 7460 transitions. [2021-06-12 17:27:12,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:12,918 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:12,918 INFO L472 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] [2021-06-12 17:27:12,919 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-06-12 17:27:12,919 INFO L430 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:12,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:12,919 INFO L82 PathProgramCache]: Analyzing trace with hash 2103156056, now seen corresponding path program 36 times [2021-06-12 17:27:12,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:12,919 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451088291] [2021-06-12 17:27:12,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:13,222 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:13,222 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451088291] [2021-06-12 17:27:13,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451088291] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:13,222 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:13,222 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:13,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425408509] [2021-06-12 17:27:13,222 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:13,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:13,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:13,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:13,223 INFO L87 Difference]: Start difference. First operand 2880 states and 7460 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:14,370 INFO L93 Difference]: Finished difference Result 4695 states and 11568 transitions. [2021-06-12 17:27:14,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-12 17:27:14,371 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:14,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:14,375 INFO L225 Difference]: With dead ends: 4695 [2021-06-12 17:27:14,375 INFO L226 Difference]: Without dead ends: 4695 [2021-06-12 17:27:14,376 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 931.2ms TimeCoverageRelationStatistics Valid=285, Invalid=837, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 17:27:14,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4695 states. [2021-06-12 17:27:14,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4695 to 2883. [2021-06-12 17:27:14,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2883 states, 2881 states have (on average 2.5921555015619577) internal successors, (7468), 2882 states have internal predecessors, (7468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 7468 transitions. [2021-06-12 17:27:14,414 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 7468 transitions. Word has length 105 [2021-06-12 17:27:14,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:14,414 INFO L482 AbstractCegarLoop]: Abstraction has 2883 states and 7468 transitions. [2021-06-12 17:27:14,414 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 7468 transitions. [2021-06-12 17:27:14,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:14,416 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:14,416 INFO L472 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] [2021-06-12 17:27:14,416 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-06-12 17:27:14,416 INFO L430 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:14,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:14,417 INFO L82 PathProgramCache]: Analyzing trace with hash -744201940, now seen corresponding path program 37 times [2021-06-12 17:27:14,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:14,417 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472278172] [2021-06-12 17:27:14,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:14,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:14,722 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:14,723 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472278172] [2021-06-12 17:27:14,723 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472278172] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:14,723 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:14,723 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:14,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372179291] [2021-06-12 17:27:14,723 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:14,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:14,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:14,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:14,724 INFO L87 Difference]: Start difference. First operand 2883 states and 7468 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:15,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:15,945 INFO L93 Difference]: Finished difference Result 4584 states and 11319 transitions. [2021-06-12 17:27:15,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-12 17:27:15,945 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:15,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:15,949 INFO L225 Difference]: With dead ends: 4584 [2021-06-12 17:27:15,949 INFO L226 Difference]: Without dead ends: 4584 [2021-06-12 17:27:15,950 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1016.6ms TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2021-06-12 17:27:15,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4584 states. [2021-06-12 17:27:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 2869. [2021-06-12 17:27:15,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 2867 states have (on average 2.590512731077782) internal successors, (7427), 2868 states have internal predecessors, (7427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:15,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 7427 transitions. [2021-06-12 17:27:15,987 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 7427 transitions. Word has length 105 [2021-06-12 17:27:15,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:15,988 INFO L482 AbstractCegarLoop]: Abstraction has 2869 states and 7427 transitions. [2021-06-12 17:27:15,988 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 7427 transitions. [2021-06-12 17:27:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:15,990 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:15,990 INFO L472 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] [2021-06-12 17:27:15,990 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-06-12 17:27:15,991 INFO L430 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:15,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:15,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1181505182, now seen corresponding path program 38 times [2021-06-12 17:27:15,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:15,991 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552090608] [2021-06-12 17:27:15,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:16,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:16,314 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:16,314 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552090608] [2021-06-12 17:27:16,315 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552090608] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:16,315 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:16,315 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:16,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191815124] [2021-06-12 17:27:16,315 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:16,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:16,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:16,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:16,316 INFO L87 Difference]: Start difference. First operand 2869 states and 7427 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:17,232 INFO L93 Difference]: Finished difference Result 3786 states and 9295 transitions. [2021-06-12 17:27:17,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-12 17:27:17,232 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:17,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:17,236 INFO L225 Difference]: With dead ends: 3786 [2021-06-12 17:27:17,236 INFO L226 Difference]: Without dead ends: 3786 [2021-06-12 17:27:17,236 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 746.5ms TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 17:27:17,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2021-06-12 17:27:17,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 2848. [2021-06-12 17:27:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2846 states have (on average 2.590653548840478) internal successors, (7373), 2847 states have internal predecessors, (7373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 7373 transitions. [2021-06-12 17:27:17,269 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 7373 transitions. Word has length 105 [2021-06-12 17:27:17,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:17,269 INFO L482 AbstractCegarLoop]: Abstraction has 2848 states and 7373 transitions. [2021-06-12 17:27:17,269 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:17,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 7373 transitions. [2021-06-12 17:27:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:17,272 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:17,272 INFO L472 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] [2021-06-12 17:27:17,272 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-12 17:27:17,272 INFO L430 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:17,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:17,272 INFO L82 PathProgramCache]: Analyzing trace with hash 139173676, now seen corresponding path program 39 times [2021-06-12 17:27:17,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:17,273 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933729861] [2021-06-12 17:27:17,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:17,575 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:17,576 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933729861] [2021-06-12 17:27:17,576 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933729861] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:17,576 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:17,576 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:17,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159510929] [2021-06-12 17:27:17,576 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:17,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:17,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:17,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:17,577 INFO L87 Difference]: Start difference. First operand 2848 states and 7373 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:18,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:18,543 INFO L93 Difference]: Finished difference Result 3813 states and 9309 transitions. [2021-06-12 17:27:18,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-12 17:27:18,544 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:18,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:18,546 INFO L225 Difference]: With dead ends: 3813 [2021-06-12 17:27:18,546 INFO L226 Difference]: Without dead ends: 3813 [2021-06-12 17:27:18,547 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 747.6ms TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 17:27:18,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2021-06-12 17:27:18,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 2841. [2021-06-12 17:27:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2841 states, 2839 states have (on average 2.590700951039098) internal successors, (7355), 2840 states have internal predecessors, (7355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:18,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 7355 transitions. [2021-06-12 17:27:18,579 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 7355 transitions. Word has length 105 [2021-06-12 17:27:18,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:18,579 INFO L482 AbstractCegarLoop]: Abstraction has 2841 states and 7355 transitions. [2021-06-12 17:27:18,579 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:18,579 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 7355 transitions. [2021-06-12 17:27:18,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:18,581 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:18,581 INFO L472 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] [2021-06-12 17:27:18,581 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-12 17:27:18,582 INFO L430 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:18,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:18,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1586782976, now seen corresponding path program 40 times [2021-06-12 17:27:18,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:18,582 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848180769] [2021-06-12 17:27:18,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:18,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:18,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:18,934 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:18,934 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848180769] [2021-06-12 17:27:18,934 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848180769] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:18,935 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:18,935 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:18,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383327523] [2021-06-12 17:27:18,935 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:18,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:18,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:18,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:18,936 INFO L87 Difference]: Start difference. First operand 2841 states and 7355 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:20,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:20,005 INFO L93 Difference]: Finished difference Result 3580 states and 8823 transitions. [2021-06-12 17:27:20,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-06-12 17:27:20,005 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:20,008 INFO L225 Difference]: With dead ends: 3580 [2021-06-12 17:27:20,008 INFO L226 Difference]: Without dead ends: 3580 [2021-06-12 17:27:20,008 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 871.6ms TimeCoverageRelationStatistics Valid=299, Invalid=891, Unknown=0, NotChecked=0, Total=1190 [2021-06-12 17:27:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2021-06-12 17:27:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 2723. [2021-06-12 17:27:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2723 states, 2721 states have (on average 2.606027195883866) internal successors, (7091), 2722 states have internal predecessors, (7091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:20,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2723 states to 2723 states and 7091 transitions. [2021-06-12 17:27:20,040 INFO L78 Accepts]: Start accepts. Automaton has 2723 states and 7091 transitions. Word has length 105 [2021-06-12 17:27:20,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:20,040 INFO L482 AbstractCegarLoop]: Abstraction has 2723 states and 7091 transitions. [2021-06-12 17:27:20,040 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:20,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2723 states and 7091 transitions. [2021-06-12 17:27:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:20,042 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:20,042 INFO L472 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] [2021-06-12 17:27:20,042 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-06-12 17:27:20,042 INFO L430 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:20,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:20,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1795359232, now seen corresponding path program 41 times [2021-06-12 17:27:20,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:20,043 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724214488] [2021-06-12 17:27:20,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:20,351 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:20,351 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724214488] [2021-06-12 17:27:20,351 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724214488] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:20,351 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:20,352 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:20,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066288947] [2021-06-12 17:27:20,352 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:20,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:20,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:20,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:20,353 INFO L87 Difference]: Start difference. First operand 2723 states and 7091 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:21,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:21,263 INFO L93 Difference]: Finished difference Result 3197 states and 8060 transitions. [2021-06-12 17:27:21,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-12 17:27:21,263 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:21,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:21,266 INFO L225 Difference]: With dead ends: 3197 [2021-06-12 17:27:21,266 INFO L226 Difference]: Without dead ends: 3197 [2021-06-12 17:27:21,266 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 723.5ms TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 17:27:21,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2021-06-12 17:27:21,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 2705. [2021-06-12 17:27:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2705 states, 2703 states have (on average 2.6067332593414725) internal successors, (7046), 2704 states have internal predecessors, (7046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2705 states to 2705 states and 7046 transitions. [2021-06-12 17:27:21,293 INFO L78 Accepts]: Start accepts. Automaton has 2705 states and 7046 transitions. Word has length 105 [2021-06-12 17:27:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:21,293 INFO L482 AbstractCegarLoop]: Abstraction has 2705 states and 7046 transitions. [2021-06-12 17:27:21,293 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2705 states and 7046 transitions. [2021-06-12 17:27:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:21,295 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:21,295 INFO L472 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] [2021-06-12 17:27:21,295 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-12 17:27:21,295 INFO L430 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:21,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:21,295 INFO L82 PathProgramCache]: Analyzing trace with hash 585486, now seen corresponding path program 42 times [2021-06-12 17:27:21,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:21,296 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406227283] [2021-06-12 17:27:21,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:21,622 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:21,622 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406227283] [2021-06-12 17:27:21,622 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406227283] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:21,622 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:21,623 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:21,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491471944] [2021-06-12 17:27:21,623 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:21,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:21,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:21,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:21,624 INFO L87 Difference]: Start difference. First operand 2705 states and 7046 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:22,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:22,573 INFO L93 Difference]: Finished difference Result 3419 states and 8516 transitions. [2021-06-12 17:27:22,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-12 17:27:22,573 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:22,576 INFO L225 Difference]: With dead ends: 3419 [2021-06-12 17:27:22,576 INFO L226 Difference]: Without dead ends: 3419 [2021-06-12 17:27:22,576 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 751.4ms TimeCoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 17:27:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3419 states. [2021-06-12 17:27:22,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3419 to 2707. [2021-06-12 17:27:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2707 states, 2705 states have (on average 2.6066543438077634) internal successors, (7051), 2706 states have internal predecessors, (7051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2707 states to 2707 states and 7051 transitions. [2021-06-12 17:27:22,604 INFO L78 Accepts]: Start accepts. Automaton has 2707 states and 7051 transitions. Word has length 105 [2021-06-12 17:27:22,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:22,604 INFO L482 AbstractCegarLoop]: Abstraction has 2707 states and 7051 transitions. [2021-06-12 17:27:22,604 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2707 states and 7051 transitions. [2021-06-12 17:27:22,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:22,606 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:22,606 INFO L472 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] [2021-06-12 17:27:22,607 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-12 17:27:22,607 INFO L430 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:22,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:22,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1986945210, now seen corresponding path program 43 times [2021-06-12 17:27:22,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:22,607 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562329781] [2021-06-12 17:27:22,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:22,972 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:22,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562329781] [2021-06-12 17:27:22,972 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562329781] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:22,972 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:22,972 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:22,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063453027] [2021-06-12 17:27:22,972 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:22,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:22,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:22,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:22,973 INFO L87 Difference]: Start difference. First operand 2707 states and 7051 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:24,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:24,033 INFO L93 Difference]: Finished difference Result 3502 states and 8675 transitions. [2021-06-12 17:27:24,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-12 17:27:24,033 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:24,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:24,036 INFO L225 Difference]: With dead ends: 3502 [2021-06-12 17:27:24,036 INFO L226 Difference]: Without dead ends: 3502 [2021-06-12 17:27:24,037 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 873.3ms TimeCoverageRelationStatistics Valid=287, Invalid=903, Unknown=0, NotChecked=0, Total=1190 [2021-06-12 17:27:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2021-06-12 17:27:24,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 2699. [2021-06-12 17:27:24,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2699 states, 2697 states have (on average 2.60697070819429) internal successors, (7031), 2698 states have internal predecessors, (7031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:24,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2699 states to 2699 states and 7031 transitions. [2021-06-12 17:27:24,093 INFO L78 Accepts]: Start accepts. Automaton has 2699 states and 7031 transitions. Word has length 105 [2021-06-12 17:27:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:24,093 INFO L482 AbstractCegarLoop]: Abstraction has 2699 states and 7031 transitions. [2021-06-12 17:27:24,094 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:24,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 7031 transitions. [2021-06-12 17:27:24,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:24,096 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:24,096 INFO L472 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] [2021-06-12 17:27:24,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-06-12 17:27:24,096 INFO L430 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:24,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:24,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1605592104, now seen corresponding path program 44 times [2021-06-12 17:27:24,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:24,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107670885] [2021-06-12 17:27:24,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:24,431 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:24,431 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107670885] [2021-06-12 17:27:24,431 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107670885] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:24,431 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:24,431 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:24,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057667960] [2021-06-12 17:27:24,431 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:24,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:24,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:24,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:24,432 INFO L87 Difference]: Start difference. First operand 2699 states and 7031 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:25,339 INFO L93 Difference]: Finished difference Result 3084 states and 7796 transitions. [2021-06-12 17:27:25,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-12 17:27:25,339 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:25,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:25,342 INFO L225 Difference]: With dead ends: 3084 [2021-06-12 17:27:25,342 INFO L226 Difference]: Without dead ends: 3084 [2021-06-12 17:27:25,343 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 720.9ms TimeCoverageRelationStatistics Valid=264, Invalid=858, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 17:27:25,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2021-06-12 17:27:25,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 2681. [2021-06-12 17:27:25,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2681 states, 2679 states have (on average 2.6076894363568495) internal successors, (6986), 2680 states have internal predecessors, (6986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:25,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2681 states to 2681 states and 6986 transitions. [2021-06-12 17:27:25,370 INFO L78 Accepts]: Start accepts. Automaton has 2681 states and 6986 transitions. Word has length 105 [2021-06-12 17:27:25,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:25,370 INFO L482 AbstractCegarLoop]: Abstraction has 2681 states and 6986 transitions. [2021-06-12 17:27:25,370 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:25,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2681 states and 6986 transitions. [2021-06-12 17:27:25,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:25,372 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:25,372 INFO L472 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] [2021-06-12 17:27:25,373 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-06-12 17:27:25,373 INFO L430 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:25,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:25,373 INFO L82 PathProgramCache]: Analyzing trace with hash -291468002, now seen corresponding path program 45 times [2021-06-12 17:27:25,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:25,373 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645050203] [2021-06-12 17:27:25,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:25,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:25,708 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:25,708 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645050203] [2021-06-12 17:27:25,708 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645050203] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:25,708 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:25,708 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:25,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144885658] [2021-06-12 17:27:25,708 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:25,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:25,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:25,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:25,709 INFO L87 Difference]: Start difference. First operand 2681 states and 6986 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:26,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:26,600 INFO L93 Difference]: Finished difference Result 3297 states and 8221 transitions. [2021-06-12 17:27:26,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-12 17:27:26,600 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:26,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:26,603 INFO L225 Difference]: With dead ends: 3297 [2021-06-12 17:27:26,603 INFO L226 Difference]: Without dead ends: 3297 [2021-06-12 17:27:26,603 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 725.3ms TimeCoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2021-06-12 17:27:26,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2021-06-12 17:27:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 2675. [2021-06-12 17:27:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2675 states, 2673 states have (on average 2.607931163486719) internal successors, (6971), 2674 states have internal predecessors, (6971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:26,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 6971 transitions. [2021-06-12 17:27:26,630 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 6971 transitions. Word has length 105 [2021-06-12 17:27:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:26,631 INFO L482 AbstractCegarLoop]: Abstraction has 2675 states and 6971 transitions. [2021-06-12 17:27:26,631 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 6971 transitions. [2021-06-12 17:27:26,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-06-12 17:27:26,633 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:26,633 INFO L472 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] [2021-06-12 17:27:26,633 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-12 17:27:26,633 INFO L430 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:26,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:26,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1694891722, now seen corresponding path program 46 times [2021-06-12 17:27:26,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:26,633 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865743765] [2021-06-12 17:27:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:27,024 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:27,024 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865743765] [2021-06-12 17:27:27,024 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865743765] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:27,024 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:27,024 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-06-12 17:27:27,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554758530] [2021-06-12 17:27:27,025 INFO L462 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-06-12 17:27:27,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:27,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-06-12 17:27:27,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2021-06-12 17:27:27,025 INFO L87 Difference]: Start difference. First operand 2675 states and 6971 transitions. Second operand has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:28,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:28,105 INFO L93 Difference]: Finished difference Result 3154 states and 7933 transitions. [2021-06-12 17:27:28,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-12 17:27:28,105 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-06-12 17:27:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:28,108 INFO L225 Difference]: With dead ends: 3154 [2021-06-12 17:27:28,108 INFO L226 Difference]: Without dead ends: 3154 [2021-06-12 17:27:28,108 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 890.5ms TimeCoverageRelationStatistics Valid=288, Invalid=902, Unknown=0, NotChecked=0, Total=1190 [2021-06-12 17:27:28,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2021-06-12 17:27:28,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 2564. [2021-06-12 17:27:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2563 states have (on average 2.6328521264143583) internal successors, (6748), 2563 states have internal predecessors, (6748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:28,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 6748 transitions. [2021-06-12 17:27:28,130 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 6748 transitions. Word has length 105 [2021-06-12 17:27:28,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:28,130 INFO L482 AbstractCegarLoop]: Abstraction has 2564 states and 6748 transitions. [2021-06-12 17:27:28,130 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 18 states, 18 states have (on average 5.833333333333333) internal successors, (105), 18 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:28,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 6748 transitions. [2021-06-12 17:27:28,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-12 17:27:28,132 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:28,132 INFO L472 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] [2021-06-12 17:27:28,132 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-06-12 17:27:28,132 INFO L430 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:28,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:28,133 INFO L82 PathProgramCache]: Analyzing trace with hash -976559947, now seen corresponding path program 1 times [2021-06-12 17:27:28,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:28,133 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175757559] [2021-06-12 17:27:28,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:28,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:28,865 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:28,865 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175757559] [2021-06-12 17:27:28,865 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175757559] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:28,865 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:28,865 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-12 17:27:28,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781443149] [2021-06-12 17:27:28,866 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-12 17:27:28,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:28,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-12 17:27:28,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2021-06-12 17:27:28,866 INFO L87 Difference]: Start difference. First operand 2564 states and 6748 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:31,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:31,346 INFO L93 Difference]: Finished difference Result 3806 states and 9659 transitions. [2021-06-12 17:27:31,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-12 17:27:31,347 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-06-12 17:27:31,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:31,354 INFO L225 Difference]: With dead ends: 3806 [2021-06-12 17:27:31,354 INFO L226 Difference]: Without dead ends: 3649 [2021-06-12 17:27:31,355 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 2231.4ms TimeCoverageRelationStatistics Valid=433, Invalid=2017, Unknown=0, NotChecked=0, Total=2450 [2021-06-12 17:27:31,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3649 states. [2021-06-12 17:27:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3649 to 2708. [2021-06-12 17:27:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2708 states, 2707 states have (on average 2.621352050240118) internal successors, (7096), 2707 states have internal predecessors, (7096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2708 states to 2708 states and 7096 transitions. [2021-06-12 17:27:31,390 INFO L78 Accepts]: Start accepts. Automaton has 2708 states and 7096 transitions. Word has length 111 [2021-06-12 17:27:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:31,390 INFO L482 AbstractCegarLoop]: Abstraction has 2708 states and 7096 transitions. [2021-06-12 17:27:31,390 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2708 states and 7096 transitions. [2021-06-12 17:27:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-12 17:27:31,394 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:31,394 INFO L472 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] [2021-06-12 17:27:31,394 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2021-06-12 17:27:31,394 INFO L430 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:31,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:31,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1141043849, now seen corresponding path program 2 times [2021-06-12 17:27:31,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:31,395 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608076681] [2021-06-12 17:27:31,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:32,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:32,164 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:32,164 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608076681] [2021-06-12 17:27:32,165 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608076681] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:32,165 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:32,165 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-12 17:27:32,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916709322] [2021-06-12 17:27:32,165 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-12 17:27:32,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:32,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-12 17:27:32,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-06-12 17:27:32,165 INFO L87 Difference]: Start difference. First operand 2708 states and 7096 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:33,833 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2021-06-12 17:27:34,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:34,719 INFO L93 Difference]: Finished difference Result 3704 states and 9384 transitions. [2021-06-12 17:27:34,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-12 17:27:34,719 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-06-12 17:27:34,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:34,723 INFO L225 Difference]: With dead ends: 3704 [2021-06-12 17:27:34,723 INFO L226 Difference]: Without dead ends: 3613 [2021-06-12 17:27:34,724 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 2408.0ms TimeCoverageRelationStatistics Valid=450, Invalid=2100, Unknown=0, NotChecked=0, Total=2550 [2021-06-12 17:27:34,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2021-06-12 17:27:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 2672. [2021-06-12 17:27:34,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2672 states, 2671 states have (on average 2.6207412953949834) internal successors, (7000), 2671 states have internal predecessors, (7000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:34,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2672 states and 7000 transitions. [2021-06-12 17:27:34,754 INFO L78 Accepts]: Start accepts. Automaton has 2672 states and 7000 transitions. Word has length 111 [2021-06-12 17:27:34,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:34,754 INFO L482 AbstractCegarLoop]: Abstraction has 2672 states and 7000 transitions. [2021-06-12 17:27:34,754 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:34,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2672 states and 7000 transitions. [2021-06-12 17:27:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-12 17:27:34,756 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:34,756 INFO L472 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] [2021-06-12 17:27:34,756 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-06-12 17:27:34,756 INFO L430 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:34,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:34,756 INFO L82 PathProgramCache]: Analyzing trace with hash -659116491, now seen corresponding path program 3 times [2021-06-12 17:27:34,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:34,757 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994443993] [2021-06-12 17:27:34,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:35,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:35,429 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:35,429 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994443993] [2021-06-12 17:27:35,429 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994443993] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:35,429 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:35,429 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-12 17:27:35,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530158402] [2021-06-12 17:27:35,429 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-12 17:27:35,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:35,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-12 17:27:35,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2021-06-12 17:27:35,430 INFO L87 Difference]: Start difference. First operand 2672 states and 7000 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:37,031 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 63 [2021-06-12 17:27:37,249 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2021-06-12 17:27:37,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:37,923 INFO L93 Difference]: Finished difference Result 3643 states and 9251 transitions. [2021-06-12 17:27:37,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-12 17:27:37,923 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-06-12 17:27:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:37,927 INFO L225 Difference]: With dead ends: 3643 [2021-06-12 17:27:37,927 INFO L226 Difference]: Without dead ends: 3504 [2021-06-12 17:27:37,927 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 2245.9ms TimeCoverageRelationStatistics Valid=402, Invalid=1950, Unknown=0, NotChecked=0, Total=2352 [2021-06-12 17:27:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2021-06-12 17:27:37,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 2600. [2021-06-12 17:27:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2600 states, 2599 states have (on average 2.6194690265486726) internal successors, (6808), 2599 states have internal predecessors, (6808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2600 states to 2600 states and 6808 transitions. [2021-06-12 17:27:37,960 INFO L78 Accepts]: Start accepts. Automaton has 2600 states and 6808 transitions. Word has length 111 [2021-06-12 17:27:37,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:37,960 INFO L482 AbstractCegarLoop]: Abstraction has 2600 states and 6808 transitions. [2021-06-12 17:27:37,960 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 6808 transitions. [2021-06-12 17:27:37,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-12 17:27:37,962 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:37,962 INFO L472 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] [2021-06-12 17:27:37,962 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-06-12 17:27:37,962 INFO L430 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:37,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:37,963 INFO L82 PathProgramCache]: Analyzing trace with hash 198046965, now seen corresponding path program 4 times [2021-06-12 17:27:37,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:37,963 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537389912] [2021-06-12 17:27:37,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:38,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:38,684 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:38,684 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537389912] [2021-06-12 17:27:38,684 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537389912] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:38,684 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:38,684 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2021-06-12 17:27:38,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727394040] [2021-06-12 17:27:38,684 INFO L462 AbstractCegarLoop]: Interpolant automaton has 26 states [2021-06-12 17:27:38,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:38,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-06-12 17:27:38,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2021-06-12 17:27:38,685 INFO L87 Difference]: Start difference. First operand 2600 states and 6808 transitions. Second operand has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:40,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:40,947 INFO L93 Difference]: Finished difference Result 3577 states and 9072 transitions. [2021-06-12 17:27:40,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-12 17:27:40,948 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-06-12 17:27:40,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:40,951 INFO L225 Difference]: With dead ends: 3577 [2021-06-12 17:27:40,951 INFO L226 Difference]: Without dead ends: 3468 [2021-06-12 17:27:40,951 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 2128.3ms TimeCoverageRelationStatistics Valid=405, Invalid=1947, Unknown=0, NotChecked=0, Total=2352 [2021-06-12 17:27:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2021-06-12 17:27:40,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 2564. [2021-06-12 17:27:40,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2564 states, 2563 states have (on average 2.6188060866172456) internal successors, (6712), 2563 states have internal predecessors, (6712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 6712 transitions. [2021-06-12 17:27:40,976 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 6712 transitions. Word has length 111 [2021-06-12 17:27:40,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:40,976 INFO L482 AbstractCegarLoop]: Abstraction has 2564 states and 6712 transitions. [2021-06-12 17:27:40,977 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 26 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:40,977 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 6712 transitions. [2021-06-12 17:27:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-12 17:27:40,978 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:40,979 INFO L472 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] [2021-06-12 17:27:40,979 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-06-12 17:27:40,979 INFO L430 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:40,979 INFO L82 PathProgramCache]: Analyzing trace with hash -699849197, now seen corresponding path program 5 times [2021-06-12 17:27:40,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:40,979 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802110433] [2021-06-12 17:27:40,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-12 17:27:41,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-12 17:27:41,796 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-12 17:27:41,797 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802110433] [2021-06-12 17:27:41,797 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802110433] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-12 17:27:41,797 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-12 17:27:41,797 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2021-06-12 17:27:41,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298669990] [2021-06-12 17:27:41,797 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-12 17:27:41,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-12 17:27:41,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-12 17:27:41,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2021-06-12 17:27:41,797 INFO L87 Difference]: Start difference. First operand 2564 states and 6712 transitions. Second operand has 28 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 28 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:44,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-12 17:27:44,236 INFO L93 Difference]: Finished difference Result 3671 states and 9215 transitions. [2021-06-12 17:27:44,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-12 17:27:44,237 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 28 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-06-12 17:27:44,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-12 17:27:44,241 INFO L225 Difference]: With dead ends: 3671 [2021-06-12 17:27:44,241 INFO L226 Difference]: Without dead ends: 3472 [2021-06-12 17:27:44,241 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 2289.4ms TimeCoverageRelationStatistics Valid=464, Invalid=2398, Unknown=0, NotChecked=0, Total=2862 [2021-06-12 17:27:44,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2021-06-12 17:27:44,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 2456. [2021-06-12 17:27:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2456 states, 2455 states have (on average 2.616700610997963) internal successors, (6424), 2455 states have internal predecessors, (6424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2456 states to 2456 states and 6424 transitions. [2021-06-12 17:27:44,278 INFO L78 Accepts]: Start accepts. Automaton has 2456 states and 6424 transitions. Word has length 111 [2021-06-12 17:27:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-12 17:27:44,279 INFO L482 AbstractCegarLoop]: Abstraction has 2456 states and 6424 transitions. [2021-06-12 17:27:44,279 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 3.9642857142857144) internal successors, (111), 28 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-12 17:27:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2456 states and 6424 transitions. [2021-06-12 17:27:44,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-12 17:27:44,281 INFO L464 BasicCegarLoop]: Found error trace [2021-06-12 17:27:44,282 INFO L472 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] [2021-06-12 17:27:44,282 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2021-06-12 17:27:44,282 INFO L430 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-12 17:27:44,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-12 17:27:44,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1566479499, now seen corresponding path program 6 times [2021-06-12 17:27:44,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-12 17:27:44,282 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063297820] [2021-06-12 17:27:44,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-12 17:27:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 17:27:44,305 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 17:27:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-12 17:27:44,333 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-12 17:27:44,380 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-12 17:27:44,381 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-12 17:27:44,381 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2021-06-12 17:27:44,383 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-12 17:27:44,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.06 05:27:44 BasicIcfg [2021-06-12 17:27:44,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-12 17:27:44,475 INFO L168 Benchmark]: Toolchain (without parser) took 100096.69 ms. Allocated memory was 207.6 MB in the beginning and 721.4 MB in the end (delta: 513.8 MB). Free memory was 168.8 MB in the beginning and 321.0 MB in the end (delta: -152.2 MB). Peak memory consumption was 362.2 MB. Max. memory is 8.0 GB. [2021-06-12 17:27:44,475 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 207.6 MB. Free memory is still 188.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-12 17:27:44,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1058.96 ms. Allocated memory is still 207.6 MB. Free memory was 168.6 MB in the beginning and 178.7 MB in the end (delta: -10.1 MB). Peak memory consumption was 101.9 MB. Max. memory is 8.0 GB. [2021-06-12 17:27:44,475 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.69 ms. Allocated memory is still 207.6 MB. Free memory was 178.7 MB in the beginning and 175.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-06-12 17:27:44,475 INFO L168 Benchmark]: Boogie Preprocessor took 58.86 ms. Allocated memory is still 207.6 MB. Free memory was 175.5 MB in the beginning and 172.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-06-12 17:27:44,475 INFO L168 Benchmark]: RCFGBuilder took 687.84 ms. Allocated memory is still 207.6 MB. Free memory was 172.3 MB in the beginning and 123.6 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.2 MB. Max. memory is 8.0 GB. [2021-06-12 17:27:44,476 INFO L168 Benchmark]: TraceAbstraction took 98215.40 ms. Allocated memory was 207.6 MB in the beginning and 721.4 MB in the end (delta: 513.8 MB). Free memory was 123.1 MB in the beginning and 321.0 MB in the end (delta: -197.9 MB). Peak memory consumption was 315.9 MB. Max. memory is 8.0 GB. [2021-06-12 17:27:44,476 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 207.6 MB. Free memory is still 188.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1058.96 ms. Allocated memory is still 207.6 MB. Free memory was 168.6 MB in the beginning and 178.7 MB in the end (delta: -10.1 MB). Peak memory consumption was 101.9 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 69.69 ms. Allocated memory is still 207.6 MB. Free memory was 178.7 MB in the beginning and 175.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 58.86 ms. Allocated memory is still 207.6 MB. Free memory was 175.5 MB in the beginning and 172.3 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 687.84 ms. Allocated memory is still 207.6 MB. Free memory was 172.3 MB in the beginning and 123.6 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 98215.40 ms. Allocated memory was 207.6 MB in the beginning and 721.4 MB in the end (delta: 513.8 MB). Free memory was 123.1 MB in the beginning and 321.0 MB in the end (delta: -197.9 MB). Peak memory consumption was 315.9 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; VAL [t1={7:0}, t2={8:0}] [L1688] 0 struct device *my_dev; VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1727] 0 return 0; VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1733] 0 int ret = my_drv_init(); VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1734] COND TRUE 0 ret==0 VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1735] 0 int probe_ret; VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1736] 0 struct my_data data; VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1705] 0 data->shared.a = 0 VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1706] 0 data->shared.b = 0 VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1707] 0 data->shared.a VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1675] COND FALSE 0 !(!expression) VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1708] 0 data->shared.b VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1675] COND FALSE 0 !(!expression) VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1709] 0 int res = __VERIFIER_nondet_int(); VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1710] COND FALSE 0 !(\read(res)) VAL [my_dev={0:0}, t1={7:0}, t2={8:0}] [L1712] 0 my_dev = &data->dev VAL [my_dev={9:24}, t1={7:0}, t2={8:0}] [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1690] 1 struct my_data *data; VAL [arg={0:0}, arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1690] 2 struct my_data *data; VAL [arg={0:0}, arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1693] 2 data->shared.a = 1 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1715] 0 return 0; VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1737] 0 probe_ret = my_drv_probe(&data) VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1738] COND TRUE 0 probe_ret==0 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1693] 1 data->shared.a = 1 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1699] 1 data->shared.b = lb + 1 VAL [__mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1701] 1 return 0; VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1699] 2 data->shared.b = lb + 1 VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1701] 2 return 0; VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1721] 0 void *status; VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1722] 0 \read(t1) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1723] 0 \read(t2) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1740] 0 data.shared.a VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1675] COND FALSE 0 !(!expression) VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1741] 0 data.shared.b VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1675] COND TRUE 0 !expression VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] [L1675] 0 reach_error() VAL [\result={0:0}, __mptr={9:24}, arg={0:0}, arg={0:0}, data={9:0}, lb=0, my_dev={9:24}, t1={7:0}, t2={8:0}] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 4 procedures, 164 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 98004.8ms, OverallIterations: 58, TraceHistogramMax: 1, EmptinessCheckTime: 241.8ms, AutomataDifference: 71944.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 155.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 11066 SDtfs, 33047 SDslu, 74961 SDs, 0 SdLazy, 36278 SolverSat, 2818 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18674.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2077 GetRequests, 184 SyntacticMatches, 63 SemanticMatches, 1830 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10168 ImplicationChecksByTransitivity, 60331.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4325occurred in iteration=4, InterpolantAutomatonStates: 1216, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 3079.0ms AutomataMinimizationTime, 57 MinimizatonAttempts, 72347 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 138.3ms SsaConstructionTime, 1110.3ms SatisfiabilityAnalysisTime, 20480.9ms InterpolantComputationTime, 5883 NumberOfCodeBlocks, 5883 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 5715 ConstructedInterpolants, 0 QuantifiedInterpolants, 78358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 57 InterpolantComputations, 57 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...