/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 11:22:25,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 11:22:25,816 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 11:22:25,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 11:22:25,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 11:22:25,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 11:22:25,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 11:22:25,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 11:22:25,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 11:22:25,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 11:22:25,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 11:22:25,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 11:22:25,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 11:22:25,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 11:22:25,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 11:22:25,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 11:22:25,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 11:22:25,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 11:22:25,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 11:22:25,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 11:22:25,900 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 11:22:25,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 11:22:25,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 11:22:25,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 11:22:25,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 11:22:25,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 11:22:25,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 11:22:25,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 11:22:25,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 11:22:25,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 11:22:25,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 11:22:25,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 11:22:25,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 11:22:25,927 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 11:22:25,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 11:22:25,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 11:22:25,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 11:22:25,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 11:22:25,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 11:22:25,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 11:22:25,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 11:22:25,939 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 11:22:25,995 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 11:22:25,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 11:22:25,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 11:22:26,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 11:22:26,000 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 11:22:26,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 11:22:26,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 11:22:26,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 11:22:26,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 11:22:26,003 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 11:22:26,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 11:22:26,004 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 11:22:26,004 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 11:22:26,005 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 11:22:26,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 11:22:26,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 11:22:26,006 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 11:22:26,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 11:22:26,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 11:22:26,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 11:22:26,007 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 11:22:26,007 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 11:22:26,007 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 11:22:26,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 11:22:26,007 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 11:22:26,008 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 [2020-12-22 11:22:26,410 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 11:22:26,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 11:22:26,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 11:22:26,454 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 11:22:26,455 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 11:22:26,456 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2020-12-22 11:22:26,550 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54cd939e/d7b89c86e10f4059ba2b2dbfae219d70/FLAGf71f517b9 [2020-12-22 11:22:27,269 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 11:22:27,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i [2020-12-22 11:22:27,289 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54cd939e/d7b89c86e10f4059ba2b2dbfae219d70/FLAGf71f517b9 [2020-12-22 11:22:27,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e54cd939e/d7b89c86e10f4059ba2b2dbfae219d70 [2020-12-22 11:22:27,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 11:22:27,481 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 11:22:27,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 11:22:27,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 11:22:27,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 11:22:27,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:22:27" (1/1) ... [2020-12-22 11:22:27,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ac04832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:27, skipping insertion in model container [2020-12-22 11:22:27,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:22:27" (1/1) ... [2020-12-22 11:22:27,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 11:22:27,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 11:22:27,734 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-22 11:22:28,085 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] [2020-12-22 11:22:28,090 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2020-12-22 11:22:28,091 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] [2020-12-22 11:22:28,170 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2020-12-22 11:22:28,172 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2020-12-22 11:22:28,177 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2020-12-22 11:22:28,178 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2020-12-22 11:22:28,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 11:22:28,210 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 11:22:28,225 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-12-22 11:22:28,256 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39095,39108] [2020-12-22 11:22:28,257 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39180,39193] [2020-12-22 11:22:28,258 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[39232,39245] [2020-12-22 11:22:28,273 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49388,49401] [2020-12-22 11:22:28,274 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49437,49450] [2020-12-22 11:22:28,276 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49565,49578] [2020-12-22 11:22:28,277 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-1.i[49623,49636] [2020-12-22 11:22:28,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 11:22:28,555 INFO L208 MainTranslator]: Completed translation [2020-12-22 11:22:28,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:28 WrapperNode [2020-12-22 11:22:28,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 11:22:28,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 11:22:28,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 11:22:28,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 11:22:28,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:28" (1/1) ... [2020-12-22 11:22:28,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:28" (1/1) ... [2020-12-22 11:22:28,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 11:22:28,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 11:22:28,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 11:22:28,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 11:22:28,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:28" (1/1) ... [2020-12-22 11:22:28,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:28" (1/1) ... [2020-12-22 11:22:28,727 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:28" (1/1) ... [2020-12-22 11:22:28,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:28" (1/1) ... [2020-12-22 11:22:28,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:28" (1/1) ... [2020-12-22 11:22:28,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:28" (1/1) ... [2020-12-22 11:22:28,772 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:28" (1/1) ... [2020-12-22 11:22:28,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 11:22:28,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 11:22:28,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 11:22:28,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 11:22:28,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:28" (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 [2020-12-22 11:22:28,906 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2020-12-22 11:22:28,907 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2020-12-22 11:22:28,907 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2020-12-22 11:22:28,907 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2020-12-22 11:22:28,907 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 11:22:28,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-22 11:22:28,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-22 11:22:28,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-22 11:22:28,908 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-12-22 11:22:28,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 11:22:28,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 11:22:28,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 11:22:28,910 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-22 11:22:29,606 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 11:22:29,607 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2020-12-22 11:22:29,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:22:29 BoogieIcfgContainer [2020-12-22 11:22:29,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 11:22:29,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 11:22:29,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 11:22:29,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 11:22:29,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 11:22:27" (1/3) ... [2020-12-22 11:22:29,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf2761f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:22:29, skipping insertion in model container [2020-12-22 11:22:29,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:22:28" (2/3) ... [2020-12-22 11:22:29,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf2761f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:22:29, skipping insertion in model container [2020-12-22 11:22:29,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:22:29" (3/3) ... [2020-12-22 11:22:29,625 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2020-12-22 11:22:29,639 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-22 11:22:29,639 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 11:22:29,646 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-12-22 11:22:29,647 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-22 11:22:29,761 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,762 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,763 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,763 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,763 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,765 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,766 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,766 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,767 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,767 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,767 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,767 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,768 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,768 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,769 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,770 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,770 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,771 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,771 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,771 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,771 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,772 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,772 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,772 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,773 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,774 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,774 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,774 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,775 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,776 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,776 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,777 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,778 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,778 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,778 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,779 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,780 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,780 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,780 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,781 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,781 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,781 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,782 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,782 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,784 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,784 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,785 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,785 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,785 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,785 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,786 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,786 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,786 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,786 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,787 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,787 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,787 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,787 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,788 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,789 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,789 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,789 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,789 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,790 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,790 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,790 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,790 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,791 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,791 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,791 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,792 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,792 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,792 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,792 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,793 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,794 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,794 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,794 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,795 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,795 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,795 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,795 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,795 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,796 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,796 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,796 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,796 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,796 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,798 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,799 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,799 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,803 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,803 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,804 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,804 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,810 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,811 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,811 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,813 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,813 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,813 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,813 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,814 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,814 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,814 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,814 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,814 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,814 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,815 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,815 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,815 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,815 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,816 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,816 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,816 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,816 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,817 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,817 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,817 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,817 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,817 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,818 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,818 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,818 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,818 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,819 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,819 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,819 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,819 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,820 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,820 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,821 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,821 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,822 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,822 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,822 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,823 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,823 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,823 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,823 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,824 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,824 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,824 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,824 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,824 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,825 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,825 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,825 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,825 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,825 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,826 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,826 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,826 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,826 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,826 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,827 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,828 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,828 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,828 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,830 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,831 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,831 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,831 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,831 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,831 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,832 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,832 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,832 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,832 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,832 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,833 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,833 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,833 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,833 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,833 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,834 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,834 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,834 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,834 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,834 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,835 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,835 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,835 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,835 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,836 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,836 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,836 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,836 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,836 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,836 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,837 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,837 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,837 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,837 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,838 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,838 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,838 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,839 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,839 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,839 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,841 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,841 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,841 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,841 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,842 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,842 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,842 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,842 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,842 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,843 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,843 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,844 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,844 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,845 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,845 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,845 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,845 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,847 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,852 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,852 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,852 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,853 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,854 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,854 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,855 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,855 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,863 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,864 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,864 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,864 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,865 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,865 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,865 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,865 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,865 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,865 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,866 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,866 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,866 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,866 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,867 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,867 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,867 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,868 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,868 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,868 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,868 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,868 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,869 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,869 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,869 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,869 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,869 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,870 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,870 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,871 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,871 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,871 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,872 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,872 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,872 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,872 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,873 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,873 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,873 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,873 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,873 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,874 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,874 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,874 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,874 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,875 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,875 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,875 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,875 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,875 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,876 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,876 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,876 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,876 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,877 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,877 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,877 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,877 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,877 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,878 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,878 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,878 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,878 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,879 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,879 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,879 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,879 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,880 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,880 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,880 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,880 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,880 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,881 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,881 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,881 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,881 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,882 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,883 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,883 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,883 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,883 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,883 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,883 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,884 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,884 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,884 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,884 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,884 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,885 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,885 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,885 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,885 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,885 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,886 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,886 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,886 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,886 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,886 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,887 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,887 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,887 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,887 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,888 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,888 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,888 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,888 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,889 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,889 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,889 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,889 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,889 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,890 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,890 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,890 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,890 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,890 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,890 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,891 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,891 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,891 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,891 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,891 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,891 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,892 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,892 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,892 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,892 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,892 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,892 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,893 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,893 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,893 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,893 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,893 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,893 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,894 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,894 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,894 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,894 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,894 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,894 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,895 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,895 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,895 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,895 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,895 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,896 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,896 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,896 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,896 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,896 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,896 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,897 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,897 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,897 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,897 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,899 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,899 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,900 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,900 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,900 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,901 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,901 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,901 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,901 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,901 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,901 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,902 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,902 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,902 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,902 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,902 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,902 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,903 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,903 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,903 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,903 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,903 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,904 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,904 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,904 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,904 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,904 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,905 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,905 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,905 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,905 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,905 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,905 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,906 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,906 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,906 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,906 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,906 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,906 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,907 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,907 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,907 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,907 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,907 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,908 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,908 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,908 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,908 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,908 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,909 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,909 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,909 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,909 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,909 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,909 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,910 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,912 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,912 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,913 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,913 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,913 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,913 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,913 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,914 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,914 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,914 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,914 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,914 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,915 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,915 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,915 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,915 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,915 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,916 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork0_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,916 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork0_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,923 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,923 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,924 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,924 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,924 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,924 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,925 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,925 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,925 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,925 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,925 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,926 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,926 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,926 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,926 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,927 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,927 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,927 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,927 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,927 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,928 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,928 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,928 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,928 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,928 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,929 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,929 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,929 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,929 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,929 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,934 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,935 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,935 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,935 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork1_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,936 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:22:29,948 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-12-22 11:22:29,971 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-12-22 11:22:30,014 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 11:22:30,015 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 11:22:30,015 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 11:22:30,015 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 11:22:30,015 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 11:22:30,016 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 11:22:30,016 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 11:22:30,016 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 11:22:30,040 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-22 11:22:30,043 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 212 transitions, 446 flow [2020-12-22 11:22:30,047 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 212 transitions, 446 flow [2020-12-22 11:22:30,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 200 places, 212 transitions, 446 flow [2020-12-22 11:22:30,195 INFO L129 PetriNetUnfolder]: 18/212 cut-off events. [2020-12-22 11:22:30,196 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-12-22 11:22:30,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 212 events. 18/212 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 474 event pairs, 0 based on Foata normal form. 0/191 useless extension candidates. Maximal degree in co-relation 169. Up to 3 conditions per place. [2020-12-22 11:22:30,225 INFO L116 LiptonReduction]: Number of co-enabled transitions 16584 [2020-12-22 11:22:31,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:22:34,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:22:35,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:22:35,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:22:36,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:22:37,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:22:37,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:22:37,762 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-12-22 11:22:37,980 WARN L197 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-12-22 11:22:38,253 WARN L197 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2020-12-22 11:22:38,489 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2020-12-22 11:22:38,538 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:22:38,953 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:22:39,721 WARN L197 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 147 [2020-12-22 11:22:40,058 WARN L197 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-12-22 11:22:40,809 WARN L197 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 147 [2020-12-22 11:22:41,142 WARN L197 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-12-22 11:22:41,315 INFO L131 LiptonReduction]: Checked pairs total: 43716 [2020-12-22 11:22:41,316 INFO L133 LiptonReduction]: Total number of compositions: 193 [2020-12-22 11:22:41,322 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 60 places, 66 transitions, 154 flow [2020-12-22 11:22:41,503 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2555 states. [2020-12-22 11:22:41,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states. [2020-12-22 11:22:41,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-22 11:22:41,521 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:22:41,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:22:41,523 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:22:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:22:41,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1264230791, now seen corresponding path program 1 times [2020-12-22 11:22:41,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:22:41,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63452351] [2020-12-22 11:22:41,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:22:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:22:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:22:41,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63452351] [2020-12-22 11:22:41,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:22:41,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 11:22:41,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069873418] [2020-12-22 11:22:41,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-22 11:22:41,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:22:41,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-22 11:22:41,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-22 11:22:41,789 INFO L87 Difference]: Start difference. First operand 2555 states. Second operand 2 states. [2020-12-22 11:22:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:22:41,905 INFO L93 Difference]: Finished difference Result 2555 states and 8199 transitions. [2020-12-22 11:22:41,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-22 11:22:41,906 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2020-12-22 11:22:41,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:22:41,960 INFO L225 Difference]: With dead ends: 2555 [2020-12-22 11:22:41,960 INFO L226 Difference]: Without dead ends: 2417 [2020-12-22 11:22:41,961 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-22 11:22:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2020-12-22 11:22:42,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2417. [2020-12-22 11:22:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2417 states. [2020-12-22 11:22:42,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2417 states to 2417 states and 7802 transitions. [2020-12-22 11:22:42,146 INFO L78 Accepts]: Start accepts. Automaton has 2417 states and 7802 transitions. Word has length 13 [2020-12-22 11:22:42,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:22:42,146 INFO L481 AbstractCegarLoop]: Abstraction has 2417 states and 7802 transitions. [2020-12-22 11:22:42,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-22 11:22:42,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2417 states and 7802 transitions. [2020-12-22 11:22:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-22 11:22:42,153 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:22:42,153 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:22:42,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 11:22:42,153 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:22:42,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:22:42,154 INFO L82 PathProgramCache]: Analyzing trace with hash -577657063, now seen corresponding path program 1 times [2020-12-22 11:22:42,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:22:42,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494263703] [2020-12-22 11:22:42,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:22:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:22:42,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:22:42,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494263703] [2020-12-22 11:22:42,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:22:42,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 11:22:42,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182510959] [2020-12-22 11:22:42,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 11:22:42,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:22:42,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 11:22:42,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-22 11:22:42,524 INFO L87 Difference]: Start difference. First operand 2417 states and 7802 transitions. Second operand 6 states. [2020-12-22 11:22:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:22:42,848 INFO L93 Difference]: Finished difference Result 2405 states and 7776 transitions. [2020-12-22 11:22:42,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 11:22:42,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-22 11:22:42,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:22:42,870 INFO L225 Difference]: With dead ends: 2405 [2020-12-22 11:22:42,870 INFO L226 Difference]: Without dead ends: 2405 [2020-12-22 11:22:42,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-12-22 11:22:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2020-12-22 11:22:42,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2405. [2020-12-22 11:22:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2020-12-22 11:22:42,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 7776 transitions. [2020-12-22 11:22:42,965 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 7776 transitions. Word has length 17 [2020-12-22 11:22:42,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:22:42,965 INFO L481 AbstractCegarLoop]: Abstraction has 2405 states and 7776 transitions. [2020-12-22 11:22:42,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 11:22:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 7776 transitions. [2020-12-22 11:22:42,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-22 11:22:42,969 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:22:42,969 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:22:42,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 11:22:42,970 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:22:42,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:22:42,980 INFO L82 PathProgramCache]: Analyzing trace with hash -245887620, now seen corresponding path program 1 times [2020-12-22 11:22:42,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:22:42,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229104772] [2020-12-22 11:22:42,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:22:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:22:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:22:43,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229104772] [2020-12-22 11:22:43,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:22:43,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 11:22:43,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117075843] [2020-12-22 11:22:43,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 11:22:43,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:22:43,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 11:22:43,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-22 11:22:43,175 INFO L87 Difference]: Start difference. First operand 2405 states and 7776 transitions. Second operand 7 states. [2020-12-22 11:22:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:22:43,878 INFO L93 Difference]: Finished difference Result 3979 states and 13124 transitions. [2020-12-22 11:22:43,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 11:22:43,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-12-22 11:22:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:22:43,910 INFO L225 Difference]: With dead ends: 3979 [2020-12-22 11:22:43,910 INFO L226 Difference]: Without dead ends: 3939 [2020-12-22 11:22:43,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-12-22 11:22:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3939 states. [2020-12-22 11:22:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3939 to 2948. [2020-12-22 11:22:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2948 states. [2020-12-22 11:22:44,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 9594 transitions. [2020-12-22 11:22:44,041 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 9594 transitions. Word has length 18 [2020-12-22 11:22:44,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:22:44,041 INFO L481 AbstractCegarLoop]: Abstraction has 2948 states and 9594 transitions. [2020-12-22 11:22:44,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 11:22:44,041 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 9594 transitions. [2020-12-22 11:22:44,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-22 11:22:44,046 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:22:44,046 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:22:44,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 11:22:44,047 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:22:44,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:22:44,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1133171604, now seen corresponding path program 2 times [2020-12-22 11:22:44,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:22:44,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856501643] [2020-12-22 11:22:44,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:22:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:22:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:22:44,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856501643] [2020-12-22 11:22:44,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:22:44,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 11:22:44,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243840268] [2020-12-22 11:22:44,326 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 11:22:44,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:22:44,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 11:22:44,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-22 11:22:44,328 INFO L87 Difference]: Start difference. First operand 2948 states and 9594 transitions. Second operand 7 states. [2020-12-22 11:22:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:22:44,870 INFO L93 Difference]: Finished difference Result 3485 states and 11281 transitions. [2020-12-22 11:22:44,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 11:22:44,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2020-12-22 11:22:44,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:22:44,896 INFO L225 Difference]: With dead ends: 3485 [2020-12-22 11:22:44,896 INFO L226 Difference]: Without dead ends: 3437 [2020-12-22 11:22:44,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-12-22 11:22:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2020-12-22 11:22:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 2898. [2020-12-22 11:22:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2898 states. [2020-12-22 11:22:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 9417 transitions. [2020-12-22 11:22:45,005 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 9417 transitions. Word has length 18 [2020-12-22 11:22:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:22:45,005 INFO L481 AbstractCegarLoop]: Abstraction has 2898 states and 9417 transitions. [2020-12-22 11:22:45,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 11:22:45,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 9417 transitions. [2020-12-22 11:22:45,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:22:45,011 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:22:45,011 INFO L422 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] [2020-12-22 11:22:45,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 11:22:45,012 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:22:45,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:22:45,012 INFO L82 PathProgramCache]: Analyzing trace with hash 41159297, now seen corresponding path program 1 times [2020-12-22 11:22:45,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:22:45,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476114171] [2020-12-22 11:22:45,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:22:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:22:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:22:45,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476114171] [2020-12-22 11:22:45,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:22:45,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 11:22:45,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403688793] [2020-12-22 11:22:45,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 11:22:45,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:22:45,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 11:22:45,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-12-22 11:22:45,474 INFO L87 Difference]: Start difference. First operand 2898 states and 9417 transitions. Second operand 12 states. [2020-12-22 11:22:46,816 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2020-12-22 11:22:47,174 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2020-12-22 11:22:47,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:22:47,454 INFO L93 Difference]: Finished difference Result 3448 states and 11147 transitions. [2020-12-22 11:22:47,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-22 11:22:47,454 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-12-22 11:22:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:22:47,478 INFO L225 Difference]: With dead ends: 3448 [2020-12-22 11:22:47,478 INFO L226 Difference]: Without dead ends: 3448 [2020-12-22 11:22:47,479 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=156, Invalid=306, Unknown=0, NotChecked=0, Total=462 [2020-12-22 11:22:47,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3448 states. [2020-12-22 11:22:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3448 to 3388. [2020-12-22 11:22:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2020-12-22 11:22:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 11017 transitions. [2020-12-22 11:22:47,589 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 11017 transitions. Word has length 25 [2020-12-22 11:22:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:22:47,590 INFO L481 AbstractCegarLoop]: Abstraction has 3388 states and 11017 transitions. [2020-12-22 11:22:47,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 11:22:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 11017 transitions. [2020-12-22 11:22:47,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:22:47,598 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:22:47,598 INFO L422 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] [2020-12-22 11:22:47,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 11:22:47,598 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:22:47,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:22:47,599 INFO L82 PathProgramCache]: Analyzing trace with hash -907878328, now seen corresponding path program 1 times [2020-12-22 11:22:47,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:22:47,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122170767] [2020-12-22 11:22:47,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:22:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:22:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:22:48,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122170767] [2020-12-22 11:22:48,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:22:48,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-22 11:22:48,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531570476] [2020-12-22 11:22:48,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:22:48,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:22:48,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:22:48,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:22:48,130 INFO L87 Difference]: Start difference. First operand 3388 states and 11017 transitions. Second operand 13 states. [2020-12-22 11:22:49,296 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-12-22 11:22:49,479 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2020-12-22 11:22:49,771 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-12-22 11:22:50,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:22:50,215 INFO L93 Difference]: Finished difference Result 4020 states and 12998 transitions. [2020-12-22 11:22:50,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-22 11:22:50,220 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-22 11:22:50,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:22:50,238 INFO L225 Difference]: With dead ends: 4020 [2020-12-22 11:22:50,238 INFO L226 Difference]: Without dead ends: 4020 [2020-12-22 11:22:50,238 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2020-12-22 11:22:50,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2020-12-22 11:22:50,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 3514. [2020-12-22 11:22:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2020-12-22 11:22:50,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 11403 transitions. [2020-12-22 11:22:50,355 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 11403 transitions. Word has length 25 [2020-12-22 11:22:50,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:22:50,355 INFO L481 AbstractCegarLoop]: Abstraction has 3514 states and 11403 transitions. [2020-12-22 11:22:50,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:22:50,355 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 11403 transitions. [2020-12-22 11:22:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:22:50,363 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:22:50,363 INFO L422 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] [2020-12-22 11:22:50,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 11:22:50,364 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:22:50,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:22:50,364 INFO L82 PathProgramCache]: Analyzing trace with hash 435078796, now seen corresponding path program 2 times [2020-12-22 11:22:50,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:22:50,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660097064] [2020-12-22 11:22:50,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:22:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:22:50,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:22:50,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660097064] [2020-12-22 11:22:50,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:22:50,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-22 11:22:50,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252586430] [2020-12-22 11:22:50,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:22:50,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:22:50,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:22:50,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:22:50,804 INFO L87 Difference]: Start difference. First operand 3514 states and 11403 transitions. Second operand 13 states. [2020-12-22 11:22:51,295 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2020-12-22 11:22:52,316 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 47 [2020-12-22 11:22:52,494 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2020-12-22 11:22:52,741 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2020-12-22 11:22:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:22:53,120 INFO L93 Difference]: Finished difference Result 4036 states and 13054 transitions. [2020-12-22 11:22:53,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-22 11:22:53,120 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-22 11:22:53,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:22:53,136 INFO L225 Difference]: With dead ends: 4036 [2020-12-22 11:22:53,136 INFO L226 Difference]: Without dead ends: 4036 [2020-12-22 11:22:53,137 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2020-12-22 11:22:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4036 states. [2020-12-22 11:22:53,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4036 to 3801. [2020-12-22 11:22:53,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3801 states. [2020-12-22 11:22:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3801 states to 3801 states and 12401 transitions. [2020-12-22 11:22:53,292 INFO L78 Accepts]: Start accepts. Automaton has 3801 states and 12401 transitions. Word has length 25 [2020-12-22 11:22:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:22:53,294 INFO L481 AbstractCegarLoop]: Abstraction has 3801 states and 12401 transitions. [2020-12-22 11:22:53,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:22:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3801 states and 12401 transitions. [2020-12-22 11:22:53,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:22:53,303 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:22:53,303 INFO L422 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] [2020-12-22 11:22:53,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 11:22:53,303 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:22:53,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:22:53,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1618332350, now seen corresponding path program 3 times [2020-12-22 11:22:53,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:22:53,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256458835] [2020-12-22 11:22:53,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:22:53,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:22:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:22:53,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256458835] [2020-12-22 11:22:53,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:22:53,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-22 11:22:53,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936288762] [2020-12-22 11:22:53,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:22:53,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:22:53,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:22:53,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:22:53,681 INFO L87 Difference]: Start difference. First operand 3801 states and 12401 transitions. Second operand 13 states. [2020-12-22 11:22:54,338 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2020-12-22 11:22:54,659 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2020-12-22 11:22:55,421 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-12-22 11:22:55,634 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2020-12-22 11:22:55,865 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2020-12-22 11:22:56,014 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2020-12-22 11:22:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:22:56,385 INFO L93 Difference]: Finished difference Result 4008 states and 12887 transitions. [2020-12-22 11:22:56,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-22 11:22:56,386 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-22 11:22:56,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:22:56,400 INFO L225 Difference]: With dead ends: 4008 [2020-12-22 11:22:56,400 INFO L226 Difference]: Without dead ends: 4008 [2020-12-22 11:22:56,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=204, Invalid=446, Unknown=0, NotChecked=0, Total=650 [2020-12-22 11:22:56,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4008 states. [2020-12-22 11:22:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4008 to 3865. [2020-12-22 11:22:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3865 states. [2020-12-22 11:22:56,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3865 states to 3865 states and 12515 transitions. [2020-12-22 11:22:56,518 INFO L78 Accepts]: Start accepts. Automaton has 3865 states and 12515 transitions. Word has length 25 [2020-12-22 11:22:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:22:56,519 INFO L481 AbstractCegarLoop]: Abstraction has 3865 states and 12515 transitions. [2020-12-22 11:22:56,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:22:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 3865 states and 12515 transitions. [2020-12-22 11:22:56,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:22:56,529 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:22:56,529 INFO L422 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] [2020-12-22 11:22:56,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 11:22:56,529 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:22:56,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:22:56,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1839762318, now seen corresponding path program 4 times [2020-12-22 11:22:56,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:22:56,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544906348] [2020-12-22 11:22:56,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:22:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:22:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:22:57,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544906348] [2020-12-22 11:22:57,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:22:57,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-22 11:22:57,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137142577] [2020-12-22 11:22:57,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:22:57,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:22:57,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:22:57,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:22:57,143 INFO L87 Difference]: Start difference. First operand 3865 states and 12515 transitions. Second operand 13 states. [2020-12-22 11:22:57,681 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-22 11:22:57,881 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2020-12-22 11:22:58,225 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2020-12-22 11:22:59,117 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2020-12-22 11:22:59,364 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2020-12-22 11:22:59,645 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2020-12-22 11:23:00,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:00,020 INFO L93 Difference]: Finished difference Result 4141 states and 13349 transitions. [2020-12-22 11:23:00,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-22 11:23:00,020 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-22 11:23:00,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:00,034 INFO L225 Difference]: With dead ends: 4141 [2020-12-22 11:23:00,034 INFO L226 Difference]: Without dead ends: 4141 [2020-12-22 11:23:00,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=199, Invalid=401, Unknown=0, NotChecked=0, Total=600 [2020-12-22 11:23:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4141 states. [2020-12-22 11:23:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4141 to 4005. [2020-12-22 11:23:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4005 states. [2020-12-22 11:23:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4005 states to 4005 states and 12969 transitions. [2020-12-22 11:23:00,176 INFO L78 Accepts]: Start accepts. Automaton has 4005 states and 12969 transitions. Word has length 25 [2020-12-22 11:23:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:00,176 INFO L481 AbstractCegarLoop]: Abstraction has 4005 states and 12969 transitions. [2020-12-22 11:23:00,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:23:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 4005 states and 12969 transitions. [2020-12-22 11:23:00,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:00,187 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:00,187 INFO L422 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] [2020-12-22 11:23:00,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 11:23:00,187 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:00,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:00,188 INFO L82 PathProgramCache]: Analyzing trace with hash 901042272, now seen corresponding path program 5 times [2020-12-22 11:23:00,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:00,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195218970] [2020-12-22 11:23:00,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:00,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195218970] [2020-12-22 11:23:00,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:00,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-22 11:23:00,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776035940] [2020-12-22 11:23:00,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:23:00,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:00,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:23:00,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:23:00,615 INFO L87 Difference]: Start difference. First operand 4005 states and 12969 transitions. Second operand 13 states. [2020-12-22 11:23:01,548 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2020-12-22 11:23:01,733 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-12-22 11:23:01,960 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2020-12-22 11:23:02,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:02,446 INFO L93 Difference]: Finished difference Result 4067 states and 13143 transitions. [2020-12-22 11:23:02,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-22 11:23:02,446 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-22 11:23:02,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:02,457 INFO L225 Difference]: With dead ends: 4067 [2020-12-22 11:23:02,458 INFO L226 Difference]: Without dead ends: 4067 [2020-12-22 11:23:02,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2020-12-22 11:23:02,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2020-12-22 11:23:02,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 3948. [2020-12-22 11:23:02,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2020-12-22 11:23:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 12777 transitions. [2020-12-22 11:23:02,568 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 12777 transitions. Word has length 25 [2020-12-22 11:23:02,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:02,568 INFO L481 AbstractCegarLoop]: Abstraction has 3948 states and 12777 transitions. [2020-12-22 11:23:02,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:23:02,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 12777 transitions. [2020-12-22 11:23:02,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:02,578 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:02,578 INFO L422 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] [2020-12-22 11:23:02,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 11:23:02,578 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:02,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:02,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1799252960, now seen corresponding path program 6 times [2020-12-22 11:23:02,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:02,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472058269] [2020-12-22 11:23:02,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:02,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:02,943 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472058269] [2020-12-22 11:23:02,943 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:02,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-22 11:23:02,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891163169] [2020-12-22 11:23:02,944 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:23:02,944 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:02,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:23:02,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:23:02,945 INFO L87 Difference]: Start difference. First operand 3948 states and 12777 transitions. Second operand 13 states. [2020-12-22 11:23:03,974 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2020-12-22 11:23:04,156 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2020-12-22 11:23:04,376 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-12-22 11:23:04,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:04,882 INFO L93 Difference]: Finished difference Result 4093 states and 13165 transitions. [2020-12-22 11:23:04,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-22 11:23:04,887 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-22 11:23:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:04,897 INFO L225 Difference]: With dead ends: 4093 [2020-12-22 11:23:04,898 INFO L226 Difference]: Without dead ends: 4093 [2020-12-22 11:23:04,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2020-12-22 11:23:04,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2020-12-22 11:23:04,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 4022. [2020-12-22 11:23:04,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4022 states. [2020-12-22 11:23:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 13022 transitions. [2020-12-22 11:23:05,005 INFO L78 Accepts]: Start accepts. Automaton has 4022 states and 13022 transitions. Word has length 25 [2020-12-22 11:23:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:05,005 INFO L481 AbstractCegarLoop]: Abstraction has 4022 states and 13022 transitions. [2020-12-22 11:23:05,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:23:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 4022 states and 13022 transitions. [2020-12-22 11:23:05,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:05,014 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:05,014 INFO L422 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] [2020-12-22 11:23:05,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 11:23:05,015 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:05,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:05,015 INFO L82 PathProgramCache]: Analyzing trace with hash -456295836, now seen corresponding path program 7 times [2020-12-22 11:23:05,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:05,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748389691] [2020-12-22 11:23:05,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:05,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748389691] [2020-12-22 11:23:05,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:05,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 11:23:05,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583489997] [2020-12-22 11:23:05,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 11:23:05,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:05,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 11:23:05,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-12-22 11:23:05,320 INFO L87 Difference]: Start difference. First operand 4022 states and 13022 transitions. Second operand 12 states. [2020-12-22 11:23:05,854 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2020-12-22 11:23:06,794 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2020-12-22 11:23:06,951 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2020-12-22 11:23:07,231 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2020-12-22 11:23:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:07,569 INFO L93 Difference]: Finished difference Result 4887 states and 15814 transitions. [2020-12-22 11:23:07,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-22 11:23:07,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-12-22 11:23:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:07,578 INFO L225 Difference]: With dead ends: 4887 [2020-12-22 11:23:07,578 INFO L226 Difference]: Without dead ends: 4887 [2020-12-22 11:23:07,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2020-12-22 11:23:07,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4887 states. [2020-12-22 11:23:07,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4887 to 4550. [2020-12-22 11:23:07,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4550 states. [2020-12-22 11:23:07,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4550 states to 4550 states and 14936 transitions. [2020-12-22 11:23:07,692 INFO L78 Accepts]: Start accepts. Automaton has 4550 states and 14936 transitions. Word has length 25 [2020-12-22 11:23:07,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:07,692 INFO L481 AbstractCegarLoop]: Abstraction has 4550 states and 14936 transitions. [2020-12-22 11:23:07,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 11:23:07,692 INFO L276 IsEmpty]: Start isEmpty. Operand 4550 states and 14936 transitions. [2020-12-22 11:23:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:07,702 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:07,702 INFO L422 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] [2020-12-22 11:23:07,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 11:23:07,702 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:07,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:07,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1785260314, now seen corresponding path program 8 times [2020-12-22 11:23:07,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:07,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204543062] [2020-12-22 11:23:07,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:08,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204543062] [2020-12-22 11:23:08,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:08,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-22 11:23:08,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110206074] [2020-12-22 11:23:08,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:23:08,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:08,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:23:08,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:23:08,031 INFO L87 Difference]: Start difference. First operand 4550 states and 14936 transitions. Second operand 13 states. [2020-12-22 11:23:09,113 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2020-12-22 11:23:09,965 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2020-12-22 11:23:10,172 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 52 [2020-12-22 11:23:10,430 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2020-12-22 11:23:10,609 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2020-12-22 11:23:11,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:11,164 INFO L93 Difference]: Finished difference Result 4887 states and 15682 transitions. [2020-12-22 11:23:11,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-22 11:23:11,165 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-22 11:23:11,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:11,173 INFO L225 Difference]: With dead ends: 4887 [2020-12-22 11:23:11,173 INFO L226 Difference]: Without dead ends: 4887 [2020-12-22 11:23:11,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2020-12-22 11:23:11,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4887 states. [2020-12-22 11:23:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4887 to 4610. [2020-12-22 11:23:11,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4610 states. [2020-12-22 11:23:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 14983 transitions. [2020-12-22 11:23:11,317 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 14983 transitions. Word has length 25 [2020-12-22 11:23:11,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:11,318 INFO L481 AbstractCegarLoop]: Abstraction has 4610 states and 14983 transitions. [2020-12-22 11:23:11,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:23:11,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 14983 transitions. [2020-12-22 11:23:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:11,327 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:11,327 INFO L422 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] [2020-12-22 11:23:11,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 11:23:11,327 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:11,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:11,328 INFO L82 PathProgramCache]: Analyzing trace with hash 948387686, now seen corresponding path program 9 times [2020-12-22 11:23:11,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:11,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610845279] [2020-12-22 11:23:11,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:11,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610845279] [2020-12-22 11:23:11,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:11,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-22 11:23:11,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663293519] [2020-12-22 11:23:11,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:23:11,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:11,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:23:11,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:23:11,751 INFO L87 Difference]: Start difference. First operand 4610 states and 14983 transitions. Second operand 13 states. [2020-12-22 11:23:12,442 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-22 11:23:12,671 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2020-12-22 11:23:13,070 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 54 [2020-12-22 11:23:14,248 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2020-12-22 11:23:14,476 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2020-12-22 11:23:14,778 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 62 [2020-12-22 11:23:15,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:15,166 INFO L93 Difference]: Finished difference Result 5438 states and 17321 transitions. [2020-12-22 11:23:15,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-22 11:23:15,170 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-22 11:23:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:15,183 INFO L225 Difference]: With dead ends: 5438 [2020-12-22 11:23:15,183 INFO L226 Difference]: Without dead ends: 5438 [2020-12-22 11:23:15,185 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=246, Invalid=510, Unknown=0, NotChecked=0, Total=756 [2020-12-22 11:23:15,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5438 states. [2020-12-22 11:23:15,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5438 to 4128. [2020-12-22 11:23:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4128 states. [2020-12-22 11:23:15,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4128 states to 4128 states and 13467 transitions. [2020-12-22 11:23:15,289 INFO L78 Accepts]: Start accepts. Automaton has 4128 states and 13467 transitions. Word has length 25 [2020-12-22 11:23:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:15,289 INFO L481 AbstractCegarLoop]: Abstraction has 4128 states and 13467 transitions. [2020-12-22 11:23:15,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:23:15,289 INFO L276 IsEmpty]: Start isEmpty. Operand 4128 states and 13467 transitions. [2020-12-22 11:23:15,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:15,297 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:15,297 INFO L422 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] [2020-12-22 11:23:15,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 11:23:15,297 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:15,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:15,298 INFO L82 PathProgramCache]: Analyzing trace with hash -162131449, now seen corresponding path program 2 times [2020-12-22 11:23:15,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:15,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629079518] [2020-12-22 11:23:15,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:15,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:15,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:15,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629079518] [2020-12-22 11:23:15,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:15,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-22 11:23:15,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464129917] [2020-12-22 11:23:15,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-22 11:23:15,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:15,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-22 11:23:15,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-12-22 11:23:15,610 INFO L87 Difference]: Start difference. First operand 4128 states and 13467 transitions. Second operand 11 states. [2020-12-22 11:23:17,454 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2020-12-22 11:23:17,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:17,744 INFO L93 Difference]: Finished difference Result 5348 states and 17237 transitions. [2020-12-22 11:23:17,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-22 11:23:17,745 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-12-22 11:23:17,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:17,754 INFO L225 Difference]: With dead ends: 5348 [2020-12-22 11:23:17,754 INFO L226 Difference]: Without dead ends: 5348 [2020-12-22 11:23:17,754 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=303, Unknown=0, NotChecked=0, Total=462 [2020-12-22 11:23:17,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5348 states. [2020-12-22 11:23:17,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5348 to 4368. [2020-12-22 11:23:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4368 states. [2020-12-22 11:23:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4368 states to 4368 states and 14347 transitions. [2020-12-22 11:23:17,866 INFO L78 Accepts]: Start accepts. Automaton has 4368 states and 14347 transitions. Word has length 25 [2020-12-22 11:23:17,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:17,866 INFO L481 AbstractCegarLoop]: Abstraction has 4368 states and 14347 transitions. [2020-12-22 11:23:17,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-22 11:23:17,866 INFO L276 IsEmpty]: Start isEmpty. Operand 4368 states and 14347 transitions. [2020-12-22 11:23:17,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:17,876 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:17,876 INFO L422 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] [2020-12-22 11:23:17,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 11:23:17,876 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:17,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:17,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1203695909, now seen corresponding path program 3 times [2020-12-22 11:23:17,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:17,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476671178] [2020-12-22 11:23:17,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:18,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476671178] [2020-12-22 11:23:18,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:18,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-22 11:23:18,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140630757] [2020-12-22 11:23:18,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-22 11:23:18,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:18,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-22 11:23:18,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-12-22 11:23:18,198 INFO L87 Difference]: Start difference. First operand 4368 states and 14347 transitions. Second operand 11 states. [2020-12-22 11:23:19,072 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 40 [2020-12-22 11:23:19,917 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2020-12-22 11:23:20,157 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2020-12-22 11:23:20,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:20,399 INFO L93 Difference]: Finished difference Result 5118 states and 16627 transitions. [2020-12-22 11:23:20,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-22 11:23:20,399 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-12-22 11:23:20,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:20,408 INFO L225 Difference]: With dead ends: 5118 [2020-12-22 11:23:20,408 INFO L226 Difference]: Without dead ends: 5118 [2020-12-22 11:23:20,409 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2020-12-22 11:23:20,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5118 states. [2020-12-22 11:23:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5118 to 4008. [2020-12-22 11:23:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4008 states. [2020-12-22 11:23:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4008 states to 4008 states and 13087 transitions. [2020-12-22 11:23:20,516 INFO L78 Accepts]: Start accepts. Automaton has 4008 states and 13087 transitions. Word has length 25 [2020-12-22 11:23:20,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:20,516 INFO L481 AbstractCegarLoop]: Abstraction has 4008 states and 13087 transitions. [2020-12-22 11:23:20,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-22 11:23:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4008 states and 13087 transitions. [2020-12-22 11:23:20,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:20,524 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:20,524 INFO L422 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] [2020-12-22 11:23:20,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 11:23:20,524 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:20,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:20,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1916452799, now seen corresponding path program 4 times [2020-12-22 11:23:20,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:20,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794762568] [2020-12-22 11:23:20,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:20,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:20,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794762568] [2020-12-22 11:23:20,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:20,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-22 11:23:20,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321201939] [2020-12-22 11:23:20,931 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-22 11:23:20,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:20,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-22 11:23:20,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-12-22 11:23:20,932 INFO L87 Difference]: Start difference. First operand 4008 states and 13087 transitions. Second operand 12 states. [2020-12-22 11:23:21,667 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-12-22 11:23:22,098 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2020-12-22 11:23:22,254 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2020-12-22 11:23:23,456 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2020-12-22 11:23:23,698 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 62 [2020-12-22 11:23:23,899 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2020-12-22 11:23:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:24,254 INFO L93 Difference]: Finished difference Result 4792 states and 15344 transitions. [2020-12-22 11:23:24,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-22 11:23:24,255 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-12-22 11:23:24,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:24,264 INFO L225 Difference]: With dead ends: 4792 [2020-12-22 11:23:24,264 INFO L226 Difference]: Without dead ends: 4792 [2020-12-22 11:23:24,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=232, Invalid=524, Unknown=0, NotChecked=0, Total=756 [2020-12-22 11:23:24,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4792 states. [2020-12-22 11:23:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4792 to 3542. [2020-12-22 11:23:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3542 states. [2020-12-22 11:23:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 11374 transitions. [2020-12-22 11:23:24,357 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 11374 transitions. Word has length 25 [2020-12-22 11:23:24,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:24,358 INFO L481 AbstractCegarLoop]: Abstraction has 3542 states and 11374 transitions. [2020-12-22 11:23:24,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-22 11:23:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 11374 transitions. [2020-12-22 11:23:24,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:24,364 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:24,364 INFO L422 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] [2020-12-22 11:23:24,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-22 11:23:24,364 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:24,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:24,364 INFO L82 PathProgramCache]: Analyzing trace with hash 697724736, now seen corresponding path program 10 times [2020-12-22 11:23:24,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:24,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721877962] [2020-12-22 11:23:24,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:24,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:24,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721877962] [2020-12-22 11:23:24,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:24,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-22 11:23:24,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375321143] [2020-12-22 11:23:24,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:23:24,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:24,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:23:24,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:23:24,866 INFO L87 Difference]: Start difference. First operand 3542 states and 11374 transitions. Second operand 13 states. [2020-12-22 11:23:25,698 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2020-12-22 11:23:25,867 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-22 11:23:26,150 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2020-12-22 11:23:26,642 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2020-12-22 11:23:27,623 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2020-12-22 11:23:27,870 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2020-12-22 11:23:28,088 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 47 [2020-12-22 11:23:28,327 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 52 [2020-12-22 11:23:28,659 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2020-12-22 11:23:29,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:29,057 INFO L93 Difference]: Finished difference Result 4662 states and 14814 transitions. [2020-12-22 11:23:29,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-22 11:23:29,058 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-22 11:23:29,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:29,066 INFO L225 Difference]: With dead ends: 4662 [2020-12-22 11:23:29,066 INFO L226 Difference]: Without dead ends: 4662 [2020-12-22 11:23:29,067 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=281, Invalid=589, Unknown=0, NotChecked=0, Total=870 [2020-12-22 11:23:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4662 states. [2020-12-22 11:23:29,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4662 to 3612. [2020-12-22 11:23:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3612 states. [2020-12-22 11:23:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3612 states to 3612 states and 11654 transitions. [2020-12-22 11:23:29,159 INFO L78 Accepts]: Start accepts. Automaton has 3612 states and 11654 transitions. Word has length 25 [2020-12-22 11:23:29,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:29,159 INFO L481 AbstractCegarLoop]: Abstraction has 3612 states and 11654 transitions. [2020-12-22 11:23:29,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:23:29,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3612 states and 11654 transitions. [2020-12-22 11:23:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-22 11:23:29,166 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:29,166 INFO L422 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] [2020-12-22 11:23:29,166 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-22 11:23:29,166 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:29,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:29,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1249075534, now seen corresponding path program 11 times [2020-12-22 11:23:29,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:29,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71828089] [2020-12-22 11:23:29,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:29,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:29,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71828089] [2020-12-22 11:23:29,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:29,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-22 11:23:29,517 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180286508] [2020-12-22 11:23:29,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 11:23:29,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:29,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 11:23:29,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-12-22 11:23:29,519 INFO L87 Difference]: Start difference. First operand 3612 states and 11654 transitions. Second operand 13 states. [2020-12-22 11:23:30,732 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2020-12-22 11:23:31,054 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2020-12-22 11:23:31,306 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2020-12-22 11:23:31,507 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2020-12-22 11:23:32,621 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2020-12-22 11:23:32,903 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2020-12-22 11:23:33,217 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2020-12-22 11:23:33,530 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2020-12-22 11:23:33,762 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2020-12-22 11:23:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:34,206 INFO L93 Difference]: Finished difference Result 4536 states and 14321 transitions. [2020-12-22 11:23:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-22 11:23:34,209 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-22 11:23:34,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:34,216 INFO L225 Difference]: With dead ends: 4536 [2020-12-22 11:23:34,217 INFO L226 Difference]: Without dead ends: 4536 [2020-12-22 11:23:34,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=303, Invalid=689, Unknown=0, NotChecked=0, Total=992 [2020-12-22 11:23:34,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2020-12-22 11:23:34,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 3206. [2020-12-22 11:23:34,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3206 states. [2020-12-22 11:23:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3206 states to 3206 states and 10231 transitions. [2020-12-22 11:23:34,274 INFO L78 Accepts]: Start accepts. Automaton has 3206 states and 10231 transitions. Word has length 25 [2020-12-22 11:23:34,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:34,275 INFO L481 AbstractCegarLoop]: Abstraction has 3206 states and 10231 transitions. [2020-12-22 11:23:34,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 11:23:34,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3206 states and 10231 transitions. [2020-12-22 11:23:34,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:23:34,280 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:34,280 INFO L422 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] [2020-12-22 11:23:34,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-22 11:23:34,280 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:34,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:34,281 INFO L82 PathProgramCache]: Analyzing trace with hash -367690303, now seen corresponding path program 1 times [2020-12-22 11:23:34,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:34,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081101250] [2020-12-22 11:23:34,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:34,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081101250] [2020-12-22 11:23:34,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:34,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:23:34,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214430437] [2020-12-22 11:23:34,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:23:34,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:34,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:23:34,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:23:34,823 INFO L87 Difference]: Start difference. First operand 3206 states and 10231 transitions. Second operand 15 states. [2020-12-22 11:23:35,940 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-22 11:23:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:38,112 INFO L93 Difference]: Finished difference Result 5540 states and 17982 transitions. [2020-12-22 11:23:38,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-22 11:23:38,114 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-22 11:23:38,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:38,124 INFO L225 Difference]: With dead ends: 5540 [2020-12-22 11:23:38,124 INFO L226 Difference]: Without dead ends: 5540 [2020-12-22 11:23:38,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2020-12-22 11:23:38,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5540 states. [2020-12-22 11:23:38,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5540 to 4506. [2020-12-22 11:23:38,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4506 states. [2020-12-22 11:23:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 14460 transitions. [2020-12-22 11:23:38,202 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 14460 transitions. Word has length 27 [2020-12-22 11:23:38,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:38,202 INFO L481 AbstractCegarLoop]: Abstraction has 4506 states and 14460 transitions. [2020-12-22 11:23:38,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:23:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 14460 transitions. [2020-12-22 11:23:38,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:23:38,211 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:38,211 INFO L422 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] [2020-12-22 11:23:38,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-22 11:23:38,211 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:38,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:38,212 INFO L82 PathProgramCache]: Analyzing trace with hash -367690317, now seen corresponding path program 1 times [2020-12-22 11:23:38,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:38,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817136382] [2020-12-22 11:23:38,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:38,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817136382] [2020-12-22 11:23:38,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:38,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:23:38,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651187273] [2020-12-22 11:23:38,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:23:38,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:38,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:23:38,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:23:38,739 INFO L87 Difference]: Start difference. First operand 4506 states and 14460 transitions. Second operand 15 states. [2020-12-22 11:23:39,675 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2020-12-22 11:23:39,923 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-22 11:23:40,188 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2020-12-22 11:23:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:42,161 INFO L93 Difference]: Finished difference Result 5018 states and 16095 transitions. [2020-12-22 11:23:42,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-22 11:23:42,162 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-22 11:23:42,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:42,171 INFO L225 Difference]: With dead ends: 5018 [2020-12-22 11:23:42,171 INFO L226 Difference]: Without dead ends: 5018 [2020-12-22 11:23:42,171 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2020-12-22 11:23:42,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5018 states. [2020-12-22 11:23:42,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5018 to 4506. [2020-12-22 11:23:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4506 states. [2020-12-22 11:23:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 14367 transitions. [2020-12-22 11:23:42,251 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 14367 transitions. Word has length 27 [2020-12-22 11:23:42,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:42,251 INFO L481 AbstractCegarLoop]: Abstraction has 4506 states and 14367 transitions. [2020-12-22 11:23:42,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:23:42,251 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 14367 transitions. [2020-12-22 11:23:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:23:42,259 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:42,260 INFO L422 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] [2020-12-22 11:23:42,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-22 11:23:42,260 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:42,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1609018301, now seen corresponding path program 1 times [2020-12-22 11:23:42,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:42,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926269047] [2020-12-22 11:23:42,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:42,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926269047] [2020-12-22 11:23:42,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:42,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:23:42,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987766720] [2020-12-22 11:23:42,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:23:42,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:42,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:23:42,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:23:42,983 INFO L87 Difference]: Start difference. First operand 4506 states and 14367 transitions. Second operand 17 states. [2020-12-22 11:23:44,163 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-12-22 11:23:44,393 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-12-22 11:23:44,679 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-12-22 11:23:44,967 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2020-12-22 11:23:45,217 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2020-12-22 11:23:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:46,936 INFO L93 Difference]: Finished difference Result 6526 states and 21072 transitions. [2020-12-22 11:23:46,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-22 11:23:46,937 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:23:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:46,948 INFO L225 Difference]: With dead ends: 6526 [2020-12-22 11:23:46,948 INFO L226 Difference]: Without dead ends: 6526 [2020-12-22 11:23:46,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2020-12-22 11:23:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6526 states. [2020-12-22 11:23:47,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6526 to 5060. [2020-12-22 11:23:47,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5060 states. [2020-12-22 11:23:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5060 states to 5060 states and 16254 transitions. [2020-12-22 11:23:47,076 INFO L78 Accepts]: Start accepts. Automaton has 5060 states and 16254 transitions. Word has length 27 [2020-12-22 11:23:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:47,076 INFO L481 AbstractCegarLoop]: Abstraction has 5060 states and 16254 transitions. [2020-12-22 11:23:47,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:23:47,077 INFO L276 IsEmpty]: Start isEmpty. Operand 5060 states and 16254 transitions. [2020-12-22 11:23:47,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:23:47,085 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:47,085 INFO L422 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] [2020-12-22 11:23:47,085 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-22 11:23:47,085 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:47,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:47,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1609018315, now seen corresponding path program 1 times [2020-12-22 11:23:47,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:47,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012516040] [2020-12-22 11:23:47,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:47,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012516040] [2020-12-22 11:23:47,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:47,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:23:47,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522099134] [2020-12-22 11:23:47,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:23:47,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:47,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:23:47,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:23:47,826 INFO L87 Difference]: Start difference. First operand 5060 states and 16254 transitions. Second operand 17 states. [2020-12-22 11:23:49,019 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-12-22 11:23:49,246 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-12-22 11:23:49,532 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-12-22 11:23:49,814 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2020-12-22 11:23:50,058 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2020-12-22 11:23:51,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:51,580 INFO L93 Difference]: Finished difference Result 6004 states and 19185 transitions. [2020-12-22 11:23:51,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-22 11:23:51,582 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:23:51,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:51,593 INFO L225 Difference]: With dead ends: 6004 [2020-12-22 11:23:51,594 INFO L226 Difference]: Without dead ends: 6004 [2020-12-22 11:23:51,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2020-12-22 11:23:51,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2020-12-22 11:23:51,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 4736. [2020-12-22 11:23:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4736 states. [2020-12-22 11:23:51,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4736 states to 4736 states and 15084 transitions. [2020-12-22 11:23:51,710 INFO L78 Accepts]: Start accepts. Automaton has 4736 states and 15084 transitions. Word has length 27 [2020-12-22 11:23:51,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:51,711 INFO L481 AbstractCegarLoop]: Abstraction has 4736 states and 15084 transitions. [2020-12-22 11:23:51,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:23:51,711 INFO L276 IsEmpty]: Start isEmpty. Operand 4736 states and 15084 transitions. [2020-12-22 11:23:51,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:23:51,717 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:51,717 INFO L422 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] [2020-12-22 11:23:51,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-22 11:23:51,717 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:51,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:51,718 INFO L82 PathProgramCache]: Analyzing trace with hash 482589063, now seen corresponding path program 2 times [2020-12-22 11:23:51,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:51,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715643808] [2020-12-22 11:23:51,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:52,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715643808] [2020-12-22 11:23:52,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:52,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:23:52,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132419896] [2020-12-22 11:23:52,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:23:52,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:52,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:23:52,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:23:52,529 INFO L87 Difference]: Start difference. First operand 4736 states and 15084 transitions. Second operand 17 states. [2020-12-22 11:23:53,102 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2020-12-22 11:23:54,027 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2020-12-22 11:23:54,219 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2020-12-22 11:23:54,493 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2020-12-22 11:23:54,749 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 54 [2020-12-22 11:23:54,977 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2020-12-22 11:23:56,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:23:56,667 INFO L93 Difference]: Finished difference Result 7186 states and 23233 transitions. [2020-12-22 11:23:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-22 11:23:56,667 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:23:56,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:23:56,685 INFO L225 Difference]: With dead ends: 7186 [2020-12-22 11:23:56,685 INFO L226 Difference]: Without dead ends: 7186 [2020-12-22 11:23:56,686 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2020-12-22 11:23:56,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2020-12-22 11:23:56,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 5446. [2020-12-22 11:23:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5446 states. [2020-12-22 11:23:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5446 states to 5446 states and 17439 transitions. [2020-12-22 11:23:56,793 INFO L78 Accepts]: Start accepts. Automaton has 5446 states and 17439 transitions. Word has length 27 [2020-12-22 11:23:56,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:23:56,794 INFO L481 AbstractCegarLoop]: Abstraction has 5446 states and 17439 transitions. [2020-12-22 11:23:56,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:23:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 5446 states and 17439 transitions. [2020-12-22 11:23:56,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:23:56,800 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:23:56,800 INFO L422 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] [2020-12-22 11:23:56,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-22 11:23:56,801 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:23:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:23:56,801 INFO L82 PathProgramCache]: Analyzing trace with hash 482589049, now seen corresponding path program 2 times [2020-12-22 11:23:56,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:23:56,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77294292] [2020-12-22 11:23:56,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:23:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:23:57,278 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2020-12-22 11:23:57,435 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 33 [2020-12-22 11:23:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:23:57,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77294292] [2020-12-22 11:23:57,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:23:57,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:23:57,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631356010] [2020-12-22 11:23:57,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:23:57,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:23:57,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:23:57,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:23:57,682 INFO L87 Difference]: Start difference. First operand 5446 states and 17439 transitions. Second operand 17 states. [2020-12-22 11:23:58,254 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2020-12-22 11:23:59,187 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-22 11:23:59,392 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2020-12-22 11:23:59,645 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2020-12-22 11:23:59,907 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2020-12-22 11:24:00,145 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-12-22 11:24:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:01,850 INFO L93 Difference]: Finished difference Result 7186 states and 23088 transitions. [2020-12-22 11:24:01,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-22 11:24:01,851 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:24:01,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:01,863 INFO L225 Difference]: With dead ends: 7186 [2020-12-22 11:24:01,863 INFO L226 Difference]: Without dead ends: 7186 [2020-12-22 11:24:01,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=220, Invalid=902, Unknown=0, NotChecked=0, Total=1122 [2020-12-22 11:24:01,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2020-12-22 11:24:01,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 4976. [2020-12-22 11:24:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4976 states. [2020-12-22 11:24:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4976 states to 4976 states and 15804 transitions. [2020-12-22 11:24:01,960 INFO L78 Accepts]: Start accepts. Automaton has 4976 states and 15804 transitions. Word has length 27 [2020-12-22 11:24:01,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:01,960 INFO L481 AbstractCegarLoop]: Abstraction has 4976 states and 15804 transitions. [2020-12-22 11:24:01,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:24:01,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4976 states and 15804 transitions. [2020-12-22 11:24:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:01,968 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:01,968 INFO L422 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] [2020-12-22 11:24:01,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-22 11:24:01,968 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:01,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:01,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1455533379, now seen corresponding path program 3 times [2020-12-22 11:24:01,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:01,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729645944] [2020-12-22 11:24:01,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:02,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729645944] [2020-12-22 11:24:02,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:02,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:24:02,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65952337] [2020-12-22 11:24:02,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:24:02,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:02,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:24:02,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:24:02,915 INFO L87 Difference]: Start difference. First operand 4976 states and 15804 transitions. Second operand 17 states. [2020-12-22 11:24:03,529 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-22 11:24:03,781 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-12-22 11:24:04,198 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-22 11:24:05,170 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2020-12-22 11:24:05,410 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2020-12-22 11:24:05,603 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2020-12-22 11:24:07,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:07,352 INFO L93 Difference]: Finished difference Result 7210 states and 23184 transitions. [2020-12-22 11:24:07,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-22 11:24:07,353 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:24:07,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:07,365 INFO L225 Difference]: With dead ends: 7210 [2020-12-22 11:24:07,366 INFO L226 Difference]: Without dead ends: 7210 [2020-12-22 11:24:07,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=215, Invalid=907, Unknown=0, NotChecked=0, Total=1122 [2020-12-22 11:24:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7210 states. [2020-12-22 11:24:07,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7210 to 5036. [2020-12-22 11:24:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5036 states. [2020-12-22 11:24:07,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5036 states to 5036 states and 15984 transitions. [2020-12-22 11:24:07,499 INFO L78 Accepts]: Start accepts. Automaton has 5036 states and 15984 transitions. Word has length 27 [2020-12-22 11:24:07,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:07,499 INFO L481 AbstractCegarLoop]: Abstraction has 5036 states and 15984 transitions. [2020-12-22 11:24:07,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:24:07,499 INFO L276 IsEmpty]: Start isEmpty. Operand 5036 states and 15984 transitions. [2020-12-22 11:24:07,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:07,506 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:07,506 INFO L422 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] [2020-12-22 11:24:07,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-22 11:24:07,506 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:07,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:07,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1763722761, now seen corresponding path program 4 times [2020-12-22 11:24:07,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:07,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791645977] [2020-12-22 11:24:07,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:08,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:08,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791645977] [2020-12-22 11:24:08,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:08,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:24:08,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678266174] [2020-12-22 11:24:08,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:24:08,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:08,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:24:08,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:24:08,148 INFO L87 Difference]: Start difference. First operand 5036 states and 15984 transitions. Second operand 17 states. [2020-12-22 11:24:08,770 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-22 11:24:09,050 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-12-22 11:24:09,524 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-22 11:24:09,903 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-12-22 11:24:10,242 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-22 11:24:11,261 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 55 [2020-12-22 11:24:11,489 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2020-12-22 11:24:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:14,435 INFO L93 Difference]: Finished difference Result 7826 states and 25348 transitions. [2020-12-22 11:24:14,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-12-22 11:24:14,436 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:24:14,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:14,449 INFO L225 Difference]: With dead ends: 7826 [2020-12-22 11:24:14,449 INFO L226 Difference]: Without dead ends: 7826 [2020-12-22 11:24:14,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=301, Invalid=1421, Unknown=0, NotChecked=0, Total=1722 [2020-12-22 11:24:14,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7826 states. [2020-12-22 11:24:14,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7826 to 5818. [2020-12-22 11:24:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5818 states. [2020-12-22 11:24:14,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5818 states to 5818 states and 18607 transitions. [2020-12-22 11:24:14,556 INFO L78 Accepts]: Start accepts. Automaton has 5818 states and 18607 transitions. Word has length 27 [2020-12-22 11:24:14,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:14,556 INFO L481 AbstractCegarLoop]: Abstraction has 5818 states and 18607 transitions. [2020-12-22 11:24:14,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:24:14,557 INFO L276 IsEmpty]: Start isEmpty. Operand 5818 states and 18607 transitions. [2020-12-22 11:24:14,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:14,563 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:14,563 INFO L422 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] [2020-12-22 11:24:14,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-22 11:24:14,563 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:14,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:14,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1763722747, now seen corresponding path program 3 times [2020-12-22 11:24:14,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:14,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303929960] [2020-12-22 11:24:14,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:15,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303929960] [2020-12-22 11:24:15,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:15,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:24:15,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945591290] [2020-12-22 11:24:15,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:24:15,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:15,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:24:15,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:24:15,476 INFO L87 Difference]: Start difference. First operand 5818 states and 18607 transitions. Second operand 17 states. [2020-12-22 11:24:16,153 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2020-12-22 11:24:16,446 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2020-12-22 11:24:16,912 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2020-12-22 11:24:17,295 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2020-12-22 11:24:17,614 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2020-12-22 11:24:18,536 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 55 [2020-12-22 11:24:18,771 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2020-12-22 11:24:21,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:21,600 INFO L93 Difference]: Finished difference Result 7826 states and 25151 transitions. [2020-12-22 11:24:21,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-12-22 11:24:21,601 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:24:21,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:21,613 INFO L225 Difference]: With dead ends: 7826 [2020-12-22 11:24:21,614 INFO L226 Difference]: Without dead ends: 7826 [2020-12-22 11:24:21,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=301, Invalid=1421, Unknown=0, NotChecked=0, Total=1722 [2020-12-22 11:24:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7826 states. [2020-12-22 11:24:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7826 to 5324. [2020-12-22 11:24:21,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5324 states. [2020-12-22 11:24:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5324 states to 5324 states and 16964 transitions. [2020-12-22 11:24:21,715 INFO L78 Accepts]: Start accepts. Automaton has 5324 states and 16964 transitions. Word has length 27 [2020-12-22 11:24:21,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:21,715 INFO L481 AbstractCegarLoop]: Abstraction has 5324 states and 16964 transitions. [2020-12-22 11:24:21,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:24:21,715 INFO L276 IsEmpty]: Start isEmpty. Operand 5324 states and 16964 transitions. [2020-12-22 11:24:21,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:21,720 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:21,720 INFO L422 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] [2020-12-22 11:24:21,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-22 11:24:21,721 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:21,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:21,721 INFO L82 PathProgramCache]: Analyzing trace with hash 773419547, now seen corresponding path program 5 times [2020-12-22 11:24:21,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:21,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553283491] [2020-12-22 11:24:21,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:22,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553283491] [2020-12-22 11:24:22,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:22,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:24:22,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55962827] [2020-12-22 11:24:22,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:24:22,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:22,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:24:22,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:24:22,467 INFO L87 Difference]: Start difference. First operand 5324 states and 16964 transitions. Second operand 17 states. [2020-12-22 11:24:23,891 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-12-22 11:24:24,151 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2020-12-22 11:24:24,479 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2020-12-22 11:24:24,783 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2020-12-22 11:24:25,068 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2020-12-22 11:24:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:26,911 INFO L93 Difference]: Finished difference Result 6983 states and 22441 transitions. [2020-12-22 11:24:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-22 11:24:26,912 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:24:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:26,924 INFO L225 Difference]: With dead ends: 6983 [2020-12-22 11:24:26,924 INFO L226 Difference]: Without dead ends: 6983 [2020-12-22 11:24:26,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=218, Invalid=904, Unknown=0, NotChecked=0, Total=1122 [2020-12-22 11:24:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6983 states. [2020-12-22 11:24:27,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6983 to 5384. [2020-12-22 11:24:27,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5384 states. [2020-12-22 11:24:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5384 states to 5384 states and 17144 transitions. [2020-12-22 11:24:27,023 INFO L78 Accepts]: Start accepts. Automaton has 5384 states and 17144 transitions. Word has length 27 [2020-12-22 11:24:27,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:27,023 INFO L481 AbstractCegarLoop]: Abstraction has 5384 states and 17144 transitions. [2020-12-22 11:24:27,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:24:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 5384 states and 17144 transitions. [2020-12-22 11:24:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:27,029 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:27,029 INFO L422 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] [2020-12-22 11:24:27,029 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-22 11:24:27,029 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:27,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:27,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1429940385, now seen corresponding path program 6 times [2020-12-22 11:24:27,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:27,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628130712] [2020-12-22 11:24:27,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:27,656 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 33 [2020-12-22 11:24:27,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:27,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628130712] [2020-12-22 11:24:27,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:27,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:24:27,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544584830] [2020-12-22 11:24:27,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:24:27,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:27,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:24:27,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:24:27,978 INFO L87 Difference]: Start difference. First operand 5384 states and 17144 transitions. Second operand 17 states. [2020-12-22 11:24:28,591 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2020-12-22 11:24:29,675 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-22 11:24:29,885 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2020-12-22 11:24:30,146 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2020-12-22 11:24:30,420 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2020-12-22 11:24:30,654 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2020-12-22 11:24:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:32,640 INFO L93 Difference]: Finished difference Result 8467 states and 27115 transitions. [2020-12-22 11:24:32,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-22 11:24:32,640 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:24:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:32,654 INFO L225 Difference]: With dead ends: 8467 [2020-12-22 11:24:32,654 INFO L226 Difference]: Without dead ends: 8467 [2020-12-22 11:24:32,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2020-12-22 11:24:32,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8467 states. [2020-12-22 11:24:32,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8467 to 6382. [2020-12-22 11:24:32,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6382 states. [2020-12-22 11:24:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6382 states to 6382 states and 20363 transitions. [2020-12-22 11:24:32,762 INFO L78 Accepts]: Start accepts. Automaton has 6382 states and 20363 transitions. Word has length 27 [2020-12-22 11:24:32,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:32,762 INFO L481 AbstractCegarLoop]: Abstraction has 6382 states and 20363 transitions. [2020-12-22 11:24:32,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:24:32,762 INFO L276 IsEmpty]: Start isEmpty. Operand 6382 states and 20363 transitions. [2020-12-22 11:24:32,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:32,768 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:32,768 INFO L422 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] [2020-12-22 11:24:32,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-22 11:24:32,769 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:32,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:32,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1429940399, now seen corresponding path program 4 times [2020-12-22 11:24:32,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:32,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272368022] [2020-12-22 11:24:32,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:33,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272368022] [2020-12-22 11:24:33,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:33,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:24:33,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884101039] [2020-12-22 11:24:33,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:24:33,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:33,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:24:33,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:24:33,534 INFO L87 Difference]: Start difference. First operand 6382 states and 20363 transitions. Second operand 17 states. [2020-12-22 11:24:34,204 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2020-12-22 11:24:35,323 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2020-12-22 11:24:35,527 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2020-12-22 11:24:35,789 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 50 [2020-12-22 11:24:36,061 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2020-12-22 11:24:36,298 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 48 [2020-12-22 11:24:38,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:38,285 INFO L93 Difference]: Finished difference Result 8374 states and 26768 transitions. [2020-12-22 11:24:38,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-22 11:24:38,286 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:24:38,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:38,300 INFO L225 Difference]: With dead ends: 8374 [2020-12-22 11:24:38,300 INFO L226 Difference]: Without dead ends: 8374 [2020-12-22 11:24:38,301 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=219, Invalid=903, Unknown=0, NotChecked=0, Total=1122 [2020-12-22 11:24:38,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8374 states. [2020-12-22 11:24:38,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8374 to 5864. [2020-12-22 11:24:38,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5864 states. [2020-12-22 11:24:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5864 states to 5864 states and 18584 transitions. [2020-12-22 11:24:38,412 INFO L78 Accepts]: Start accepts. Automaton has 5864 states and 18584 transitions. Word has length 27 [2020-12-22 11:24:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:38,412 INFO L481 AbstractCegarLoop]: Abstraction has 5864 states and 18584 transitions. [2020-12-22 11:24:38,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:24:38,413 INFO L276 IsEmpty]: Start isEmpty. Operand 5864 states and 18584 transitions. [2020-12-22 11:24:38,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:38,419 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:38,419 INFO L422 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] [2020-12-22 11:24:38,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-22 11:24:38,419 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:38,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:38,420 INFO L82 PathProgramCache]: Analyzing trace with hash 926904469, now seen corresponding path program 7 times [2020-12-22 11:24:38,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:38,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39578797] [2020-12-22 11:24:38,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:39,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:39,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39578797] [2020-12-22 11:24:39,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:39,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:24:39,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332606945] [2020-12-22 11:24:39,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:24:39,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:39,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:24:39,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:24:39,326 INFO L87 Difference]: Start difference. First operand 5864 states and 18584 transitions. Second operand 17 states. [2020-12-22 11:24:39,996 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-22 11:24:40,274 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-12-22 11:24:40,726 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-22 11:24:41,832 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2020-12-22 11:24:42,065 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2020-12-22 11:24:42,262 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2020-12-22 11:24:44,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:44,079 INFO L93 Difference]: Finished difference Result 8375 states and 26867 transitions. [2020-12-22 11:24:44,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-22 11:24:44,080 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:24:44,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:44,095 INFO L225 Difference]: With dead ends: 8375 [2020-12-22 11:24:44,095 INFO L226 Difference]: Without dead ends: 8375 [2020-12-22 11:24:44,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2020-12-22 11:24:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8375 states. [2020-12-22 11:24:44,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8375 to 6430. [2020-12-22 11:24:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6430 states. [2020-12-22 11:24:44,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6430 states to 6430 states and 20507 transitions. [2020-12-22 11:24:44,207 INFO L78 Accepts]: Start accepts. Automaton has 6430 states and 20507 transitions. Word has length 27 [2020-12-22 11:24:44,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:44,207 INFO L481 AbstractCegarLoop]: Abstraction has 6430 states and 20507 transitions. [2020-12-22 11:24:44,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:24:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 6430 states and 20507 transitions. [2020-12-22 11:24:44,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:44,216 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:44,216 INFO L422 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] [2020-12-22 11:24:44,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-22 11:24:44,217 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:44,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:44,217 INFO L82 PathProgramCache]: Analyzing trace with hash 926904455, now seen corresponding path program 5 times [2020-12-22 11:24:44,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:44,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152987324] [2020-12-22 11:24:44,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:44,859 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2020-12-22 11:24:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:45,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152987324] [2020-12-22 11:24:45,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:45,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:24:45,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432439382] [2020-12-22 11:24:45,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:24:45,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:45,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:24:45,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:24:45,128 INFO L87 Difference]: Start difference. First operand 6430 states and 20507 transitions. Second operand 17 states. [2020-12-22 11:24:45,761 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-22 11:24:46,072 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-12-22 11:24:46,524 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-22 11:24:47,601 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2020-12-22 11:24:47,844 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2020-12-22 11:24:48,041 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2020-12-22 11:24:49,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:49,894 INFO L93 Difference]: Finished difference Result 7760 states and 24778 transitions. [2020-12-22 11:24:49,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-22 11:24:49,894 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:24:49,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:49,907 INFO L225 Difference]: With dead ends: 7760 [2020-12-22 11:24:49,908 INFO L226 Difference]: Without dead ends: 7760 [2020-12-22 11:24:49,908 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2020-12-22 11:24:49,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7760 states. [2020-12-22 11:24:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7760 to 5984. [2020-12-22 11:24:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5984 states. [2020-12-22 11:24:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5984 states to 5984 states and 18944 transitions. [2020-12-22 11:24:50,009 INFO L78 Accepts]: Start accepts. Automaton has 5984 states and 18944 transitions. Word has length 27 [2020-12-22 11:24:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:50,010 INFO L481 AbstractCegarLoop]: Abstraction has 5984 states and 18944 transitions. [2020-12-22 11:24:50,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:24:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 5984 states and 18944 transitions. [2020-12-22 11:24:50,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:50,017 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:50,017 INFO L422 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] [2020-12-22 11:24:50,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-22 11:24:50,017 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:50,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:50,018 INFO L82 PathProgramCache]: Analyzing trace with hash -148806687, now seen corresponding path program 8 times [2020-12-22 11:24:50,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:50,018 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644024766] [2020-12-22 11:24:50,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:50,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:50,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644024766] [2020-12-22 11:24:50,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:50,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:24:50,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539157185] [2020-12-22 11:24:50,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:24:50,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:50,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:24:50,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:24:50,842 INFO L87 Difference]: Start difference. First operand 5984 states and 18944 transitions. Second operand 17 states. [2020-12-22 11:24:51,575 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2020-12-22 11:24:51,899 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 47 [2020-12-22 11:24:52,428 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2020-12-22 11:24:52,841 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2020-12-22 11:24:53,209 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2020-12-22 11:24:54,281 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2020-12-22 11:24:54,519 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2020-12-22 11:24:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:24:57,545 INFO L93 Difference]: Finished difference Result 8910 states and 28536 transitions. [2020-12-22 11:24:57,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-12-22 11:24:57,546 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:24:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:24:57,561 INFO L225 Difference]: With dead ends: 8910 [2020-12-22 11:24:57,561 INFO L226 Difference]: Without dead ends: 8910 [2020-12-22 11:24:57,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=300, Invalid=1422, Unknown=0, NotChecked=0, Total=1722 [2020-12-22 11:24:57,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8910 states. [2020-12-22 11:24:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8910 to 5630. [2020-12-22 11:24:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5630 states. [2020-12-22 11:24:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5630 states to 5630 states and 17882 transitions. [2020-12-22 11:24:57,671 INFO L78 Accepts]: Start accepts. Automaton has 5630 states and 17882 transitions. Word has length 27 [2020-12-22 11:24:57,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:24:57,671 INFO L481 AbstractCegarLoop]: Abstraction has 5630 states and 17882 transitions. [2020-12-22 11:24:57,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:24:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 5630 states and 17882 transitions. [2020-12-22 11:24:57,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:24:57,677 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:24:57,677 INFO L422 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] [2020-12-22 11:24:57,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-22 11:24:57,677 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:24:57,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:24:57,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1838398407, now seen corresponding path program 2 times [2020-12-22 11:24:57,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:24:57,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795928450] [2020-12-22 11:24:57,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:24:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:24:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:24:58,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795928450] [2020-12-22 11:24:58,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:24:58,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:24:58,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508586899] [2020-12-22 11:24:58,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:24:58,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:24:58,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:24:58,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:24:58,200 INFO L87 Difference]: Start difference. First operand 5630 states and 17882 transitions. Second operand 15 states. [2020-12-22 11:24:58,841 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2020-12-22 11:24:59,175 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2020-12-22 11:24:59,432 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-22 11:24:59,723 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2020-12-22 11:25:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:01,871 INFO L93 Difference]: Finished difference Result 8011 states and 25629 transitions. [2020-12-22 11:25:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-22 11:25:01,871 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-22 11:25:01,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:01,885 INFO L225 Difference]: With dead ends: 8011 [2020-12-22 11:25:01,886 INFO L226 Difference]: Without dead ends: 8011 [2020-12-22 11:25:01,886 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2020-12-22 11:25:01,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8011 states. [2020-12-22 11:25:02,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8011 to 5372. [2020-12-22 11:25:02,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5372 states. [2020-12-22 11:25:02,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5372 states to 5372 states and 17108 transitions. [2020-12-22 11:25:02,029 INFO L78 Accepts]: Start accepts. Automaton has 5372 states and 17108 transitions. Word has length 27 [2020-12-22 11:25:02,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:02,029 INFO L481 AbstractCegarLoop]: Abstraction has 5372 states and 17108 transitions. [2020-12-22 11:25:02,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:25:02,029 INFO L276 IsEmpty]: Start isEmpty. Operand 5372 states and 17108 transitions. [2020-12-22 11:25:02,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:25:02,036 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:02,036 INFO L422 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] [2020-12-22 11:25:02,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-22 11:25:02,037 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:02,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:02,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1622332315, now seen corresponding path program 3 times [2020-12-22 11:25:02,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:02,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773220140] [2020-12-22 11:25:02,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:02,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773220140] [2020-12-22 11:25:02,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:02,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:25:02,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612262486] [2020-12-22 11:25:02,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:25:02,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:02,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:25:02,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:25:02,646 INFO L87 Difference]: Start difference. First operand 5372 states and 17108 transitions. Second operand 15 states. [2020-12-22 11:25:03,291 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2020-12-22 11:25:03,613 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2020-12-22 11:25:03,880 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-22 11:25:04,192 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2020-12-22 11:25:06,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:06,506 INFO L93 Difference]: Finished difference Result 7749 states and 24843 transitions. [2020-12-22 11:25:06,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-22 11:25:06,507 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-22 11:25:06,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:06,520 INFO L225 Difference]: With dead ends: 7749 [2020-12-22 11:25:06,521 INFO L226 Difference]: Without dead ends: 7749 [2020-12-22 11:25:06,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2020-12-22 11:25:06,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7749 states. [2020-12-22 11:25:06,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7749 to 4979. [2020-12-22 11:25:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4979 states. [2020-12-22 11:25:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4979 states to 4979 states and 15929 transitions. [2020-12-22 11:25:06,624 INFO L78 Accepts]: Start accepts. Automaton has 4979 states and 15929 transitions. Word has length 27 [2020-12-22 11:25:06,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:06,624 INFO L481 AbstractCegarLoop]: Abstraction has 4979 states and 15929 transitions. [2020-12-22 11:25:06,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:25:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 4979 states and 15929 transitions. [2020-12-22 11:25:06,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:25:06,629 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:06,629 INFO L422 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] [2020-12-22 11:25:06,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-22 11:25:06,630 INFO L429 AbstractCegarLoop]: === Iteration 37 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:06,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:06,630 INFO L82 PathProgramCache]: Analyzing trace with hash 24491393, now seen corresponding path program 4 times [2020-12-22 11:25:06,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:06,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121546350] [2020-12-22 11:25:06,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:07,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121546350] [2020-12-22 11:25:07,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:07,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-22 11:25:07,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990082994] [2020-12-22 11:25:07,177 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-22 11:25:07,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:07,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-22 11:25:07,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-12-22 11:25:07,178 INFO L87 Difference]: Start difference. First operand 4979 states and 15929 transitions. Second operand 14 states. [2020-12-22 11:25:08,051 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2020-12-22 11:25:08,302 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2020-12-22 11:25:08,564 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2020-12-22 11:25:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:10,828 INFO L93 Difference]: Finished difference Result 6963 states and 22485 transitions. [2020-12-22 11:25:10,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-22 11:25:10,829 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2020-12-22 11:25:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:10,845 INFO L225 Difference]: With dead ends: 6963 [2020-12-22 11:25:10,846 INFO L226 Difference]: Without dead ends: 6963 [2020-12-22 11:25:10,846 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2020-12-22 11:25:10,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6963 states. [2020-12-22 11:25:10,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6963 to 4848. [2020-12-22 11:25:10,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4848 states. [2020-12-22 11:25:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4848 states to 4848 states and 15536 transitions. [2020-12-22 11:25:10,943 INFO L78 Accepts]: Start accepts. Automaton has 4848 states and 15536 transitions. Word has length 27 [2020-12-22 11:25:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:10,943 INFO L481 AbstractCegarLoop]: Abstraction has 4848 states and 15536 transitions. [2020-12-22 11:25:10,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-22 11:25:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 4848 states and 15536 transitions. [2020-12-22 11:25:10,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:25:10,948 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:10,949 INFO L422 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] [2020-12-22 11:25:10,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-22 11:25:10,949 INFO L429 AbstractCegarLoop]: === Iteration 38 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:10,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:10,949 INFO L82 PathProgramCache]: Analyzing trace with hash -183527175, now seen corresponding path program 5 times [2020-12-22 11:25:10,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:10,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58626762] [2020-12-22 11:25:10,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:11,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58626762] [2020-12-22 11:25:11,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:11,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-22 11:25:11,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350608537] [2020-12-22 11:25:11,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-22 11:25:11,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:11,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-22 11:25:11,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-22 11:25:11,661 INFO L87 Difference]: Start difference. First operand 4848 states and 15536 transitions. Second operand 15 states. [2020-12-22 11:25:12,419 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2020-12-22 11:25:12,671 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-22 11:25:12,944 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2020-12-22 11:25:13,358 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2020-12-22 11:25:16,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:16,137 INFO L93 Difference]: Finished difference Result 6864 states and 22139 transitions. [2020-12-22 11:25:16,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-22 11:25:16,138 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-22 11:25:16,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:16,149 INFO L225 Difference]: With dead ends: 6864 [2020-12-22 11:25:16,149 INFO L226 Difference]: Without dead ends: 6864 [2020-12-22 11:25:16,150 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=196, Invalid=796, Unknown=0, NotChecked=0, Total=992 [2020-12-22 11:25:16,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6864 states. [2020-12-22 11:25:16,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6864 to 4732. [2020-12-22 11:25:16,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4732 states. [2020-12-22 11:25:16,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4732 states to 4732 states and 15168 transitions. [2020-12-22 11:25:16,235 INFO L78 Accepts]: Start accepts. Automaton has 4732 states and 15168 transitions. Word has length 27 [2020-12-22 11:25:16,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:16,235 INFO L481 AbstractCegarLoop]: Abstraction has 4732 states and 15168 transitions. [2020-12-22 11:25:16,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-22 11:25:16,235 INFO L276 IsEmpty]: Start isEmpty. Operand 4732 states and 15168 transitions. [2020-12-22 11:25:16,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:25:16,242 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:16,242 INFO L422 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] [2020-12-22 11:25:16,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-22 11:25:16,242 INFO L429 AbstractCegarLoop]: === Iteration 39 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:16,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:16,243 INFO L82 PathProgramCache]: Analyzing trace with hash 79389321, now seen corresponding path program 9 times [2020-12-22 11:25:16,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:16,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838543201] [2020-12-22 11:25:16,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:16,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838543201] [2020-12-22 11:25:16,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:16,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:25:16,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83100375] [2020-12-22 11:25:16,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:25:16,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:16,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:25:16,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:25:16,973 INFO L87 Difference]: Start difference. First operand 4732 states and 15168 transitions. Second operand 17 states. [2020-12-22 11:25:17,462 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2020-12-22 11:25:17,694 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-22 11:25:17,962 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2020-12-22 11:25:18,409 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-22 11:25:18,795 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-12-22 11:25:19,174 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-22 11:25:20,248 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2020-12-22 11:25:20,455 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2020-12-22 11:25:22,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:22,763 INFO L93 Difference]: Finished difference Result 7130 states and 22950 transitions. [2020-12-22 11:25:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-12-22 11:25:22,764 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:25:22,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:22,777 INFO L225 Difference]: With dead ends: 7130 [2020-12-22 11:25:22,777 INFO L226 Difference]: Without dead ends: 7130 [2020-12-22 11:25:22,778 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=300, Invalid=1422, Unknown=0, NotChecked=0, Total=1722 [2020-12-22 11:25:22,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7130 states. [2020-12-22 11:25:22,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7130 to 4906. [2020-12-22 11:25:22,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4906 states. [2020-12-22 11:25:22,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4906 states to 4906 states and 15690 transitions. [2020-12-22 11:25:22,871 INFO L78 Accepts]: Start accepts. Automaton has 4906 states and 15690 transitions. Word has length 27 [2020-12-22 11:25:22,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:22,871 INFO L481 AbstractCegarLoop]: Abstraction has 4906 states and 15690 transitions. [2020-12-22 11:25:22,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:25:22,872 INFO L276 IsEmpty]: Start isEmpty. Operand 4906 states and 15690 transitions. [2020-12-22 11:25:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:25:22,877 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:22,877 INFO L422 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] [2020-12-22 11:25:22,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-22 11:25:22,877 INFO L429 AbstractCegarLoop]: === Iteration 40 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:22,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:22,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1646528791, now seen corresponding path program 10 times [2020-12-22 11:25:22,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:22,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17381407] [2020-12-22 11:25:22,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:23,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17381407] [2020-12-22 11:25:23,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:23,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:25:23,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717495443] [2020-12-22 11:25:23,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:25:23,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:23,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:25:23,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:25:23,761 INFO L87 Difference]: Start difference. First operand 4906 states and 15690 transitions. Second operand 17 states. [2020-12-22 11:25:24,267 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2020-12-22 11:25:24,504 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2020-12-22 11:25:24,872 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2020-12-22 11:25:25,158 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-22 11:25:25,557 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2020-12-22 11:25:25,929 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-22 11:25:27,101 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2020-12-22 11:25:27,301 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2020-12-22 11:25:29,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:29,753 INFO L93 Difference]: Finished difference Result 7080 states and 22810 transitions. [2020-12-22 11:25:29,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-12-22 11:25:29,754 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:25:29,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:29,767 INFO L225 Difference]: With dead ends: 7080 [2020-12-22 11:25:29,767 INFO L226 Difference]: Without dead ends: 7080 [2020-12-22 11:25:29,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=294, Invalid=1428, Unknown=0, NotChecked=0, Total=1722 [2020-12-22 11:25:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7080 states. [2020-12-22 11:25:29,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7080 to 4906. [2020-12-22 11:25:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4906 states. [2020-12-22 11:25:29,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4906 states to 4906 states and 15690 transitions. [2020-12-22 11:25:29,854 INFO L78 Accepts]: Start accepts. Automaton has 4906 states and 15690 transitions. Word has length 27 [2020-12-22 11:25:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:29,854 INFO L481 AbstractCegarLoop]: Abstraction has 4906 states and 15690 transitions. [2020-12-22 11:25:29,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:25:29,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4906 states and 15690 transitions. [2020-12-22 11:25:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:25:29,859 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:29,859 INFO L422 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] [2020-12-22 11:25:29,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-22 11:25:29,859 INFO L429 AbstractCegarLoop]: === Iteration 41 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:29,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:29,859 INFO L82 PathProgramCache]: Analyzing trace with hash 713846761, now seen corresponding path program 11 times [2020-12-22 11:25:29,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:29,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669945077] [2020-12-22 11:25:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:30,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:30,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669945077] [2020-12-22 11:25:30,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:30,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:25:30,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688317801] [2020-12-22 11:25:30,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:25:30,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:30,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:25:30,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:25:30,582 INFO L87 Difference]: Start difference. First operand 4906 states and 15690 transitions. Second operand 17 states. [2020-12-22 11:25:31,134 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2020-12-22 11:25:31,392 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2020-12-22 11:25:31,753 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2020-12-22 11:25:32,067 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2020-12-22 11:25:32,398 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-12-22 11:25:32,563 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2020-12-22 11:25:32,931 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-22 11:25:34,347 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2020-12-22 11:25:34,538 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2020-12-22 11:25:35,139 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2020-12-22 11:25:35,435 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2020-12-22 11:25:37,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:37,321 INFO L93 Difference]: Finished difference Result 7244 states and 23386 transitions. [2020-12-22 11:25:37,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-22 11:25:37,322 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:25:37,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:37,336 INFO L225 Difference]: With dead ends: 7244 [2020-12-22 11:25:37,336 INFO L226 Difference]: Without dead ends: 7244 [2020-12-22 11:25:37,336 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2020-12-22 11:25:37,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7244 states. [2020-12-22 11:25:37,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7244 to 5684. [2020-12-22 11:25:37,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5684 states. [2020-12-22 11:25:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5684 states to 5684 states and 18276 transitions. [2020-12-22 11:25:37,438 INFO L78 Accepts]: Start accepts. Automaton has 5684 states and 18276 transitions. Word has length 27 [2020-12-22 11:25:37,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:37,438 INFO L481 AbstractCegarLoop]: Abstraction has 5684 states and 18276 transitions. [2020-12-22 11:25:37,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:25:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand 5684 states and 18276 transitions. [2020-12-22 11:25:37,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:25:37,444 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:37,444 INFO L422 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] [2020-12-22 11:25:37,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-22 11:25:37,444 INFO L429 AbstractCegarLoop]: === Iteration 42 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:37,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:37,444 INFO L82 PathProgramCache]: Analyzing trace with hash 713846747, now seen corresponding path program 6 times [2020-12-22 11:25:37,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:37,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433942211] [2020-12-22 11:25:37,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:38,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433942211] [2020-12-22 11:25:38,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:38,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:25:38,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638989493] [2020-12-22 11:25:38,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:25:38,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:38,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:25:38,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:25:38,279 INFO L87 Difference]: Start difference. First operand 5684 states and 18276 transitions. Second operand 17 states. [2020-12-22 11:25:38,805 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2020-12-22 11:25:39,066 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2020-12-22 11:25:39,469 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2020-12-22 11:25:39,816 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2020-12-22 11:25:40,164 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-12-22 11:25:40,331 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2020-12-22 11:25:40,700 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-22 11:25:42,194 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2020-12-22 11:25:42,405 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2020-12-22 11:25:42,992 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 44 [2020-12-22 11:25:43,306 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2020-12-22 11:25:44,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:44,940 INFO L93 Difference]: Finished difference Result 6722 states and 21499 transitions. [2020-12-22 11:25:44,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-12-22 11:25:44,941 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:25:44,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:44,952 INFO L225 Difference]: With dead ends: 6722 [2020-12-22 11:25:44,952 INFO L226 Difference]: Without dead ends: 6722 [2020-12-22 11:25:44,953 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=278, Invalid=1128, Unknown=0, NotChecked=0, Total=1406 [2020-12-22 11:25:44,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6722 states. [2020-12-22 11:25:45,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6722 to 4926. [2020-12-22 11:25:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4926 states. [2020-12-22 11:25:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4926 states to 4926 states and 15755 transitions. [2020-12-22 11:25:45,092 INFO L78 Accepts]: Start accepts. Automaton has 4926 states and 15755 transitions. Word has length 27 [2020-12-22 11:25:45,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:45,092 INFO L481 AbstractCegarLoop]: Abstraction has 4926 states and 15755 transitions. [2020-12-22 11:25:45,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:25:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 4926 states and 15755 transitions. [2020-12-22 11:25:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:25:45,098 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:45,098 INFO L422 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] [2020-12-22 11:25:45,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-22 11:25:45,098 INFO L429 AbstractCegarLoop]: === Iteration 43 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:45,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:45,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1551387543, now seen corresponding path program 12 times [2020-12-22 11:25:45,099 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:45,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341686615] [2020-12-22 11:25:45,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:45,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341686615] [2020-12-22 11:25:45,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:45,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:25:45,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707216642] [2020-12-22 11:25:45,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:25:45,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:45,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:25:45,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:25:45,846 INFO L87 Difference]: Start difference. First operand 4926 states and 15755 transitions. Second operand 17 states. [2020-12-22 11:25:46,583 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-22 11:25:46,876 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-12-22 11:25:47,388 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-22 11:25:47,804 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-12-22 11:25:48,196 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-22 11:25:49,337 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2020-12-22 11:25:49,548 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2020-12-22 11:25:52,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:52,210 INFO L93 Difference]: Finished difference Result 6830 states and 22232 transitions. [2020-12-22 11:25:52,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-12-22 11:25:52,211 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:25:52,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:52,224 INFO L225 Difference]: With dead ends: 6830 [2020-12-22 11:25:52,224 INFO L226 Difference]: Without dead ends: 6830 [2020-12-22 11:25:52,225 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=300, Invalid=1422, Unknown=0, NotChecked=0, Total=1722 [2020-12-22 11:25:52,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6830 states. [2020-12-22 11:25:52,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6830 to 5568. [2020-12-22 11:25:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5568 states. [2020-12-22 11:25:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5568 states to 5568 states and 17938 transitions. [2020-12-22 11:25:52,375 INFO L78 Accepts]: Start accepts. Automaton has 5568 states and 17938 transitions. Word has length 27 [2020-12-22 11:25:52,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:52,375 INFO L481 AbstractCegarLoop]: Abstraction has 5568 states and 17938 transitions. [2020-12-22 11:25:52,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:25:52,376 INFO L276 IsEmpty]: Start isEmpty. Operand 5568 states and 17938 transitions. [2020-12-22 11:25:52,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-22 11:25:52,382 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:52,382 INFO L422 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] [2020-12-22 11:25:52,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-22 11:25:52,382 INFO L429 AbstractCegarLoop]: === Iteration 44 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:52,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:52,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1551387557, now seen corresponding path program 7 times [2020-12-22 11:25:52,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:52,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870788069] [2020-12-22 11:25:52,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:25:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:25:53,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870788069] [2020-12-22 11:25:53,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:25:53,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-22 11:25:53,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864681376] [2020-12-22 11:25:53,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-12-22 11:25:53,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:25:53,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-12-22 11:25:53,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-12-22 11:25:53,163 INFO L87 Difference]: Start difference. First operand 5568 states and 17938 transitions. Second operand 17 states. [2020-12-22 11:25:53,925 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-12-22 11:25:54,229 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2020-12-22 11:25:54,769 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-22 11:25:55,185 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-12-22 11:25:55,628 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2020-12-22 11:25:56,705 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 64 [2020-12-22 11:25:56,921 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2020-12-22 11:25:59,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:25:59,490 INFO L93 Difference]: Finished difference Result 6830 states and 22035 transitions. [2020-12-22 11:25:59,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-12-22 11:25:59,491 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2020-12-22 11:25:59,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:25:59,505 INFO L225 Difference]: With dead ends: 6830 [2020-12-22 11:25:59,505 INFO L226 Difference]: Without dead ends: 6830 [2020-12-22 11:25:59,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=300, Invalid=1422, Unknown=0, NotChecked=0, Total=1722 [2020-12-22 11:25:59,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6830 states. [2020-12-22 11:25:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6830 to 4546. [2020-12-22 11:25:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4546 states. [2020-12-22 11:25:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4546 states to 4546 states and 14595 transitions. [2020-12-22 11:25:59,595 INFO L78 Accepts]: Start accepts. Automaton has 4546 states and 14595 transitions. Word has length 27 [2020-12-22 11:25:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:25:59,595 INFO L481 AbstractCegarLoop]: Abstraction has 4546 states and 14595 transitions. [2020-12-22 11:25:59,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-12-22 11:25:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 4546 states and 14595 transitions. [2020-12-22 11:25:59,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-22 11:25:59,600 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:25:59,600 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:25:59,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-22 11:25:59,600 INFO L429 AbstractCegarLoop]: === Iteration 45 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:25:59,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:25:59,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1473904674, now seen corresponding path program 1 times [2020-12-22 11:25:59,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:25:59,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030594394] [2020-12-22 11:25:59,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:25:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:26:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:26:00,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030594394] [2020-12-22 11:26:00,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300219760] [2020-12-22 11:26:00,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 11:26:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:26:00,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 74 conjunts are in the unsatisfiable core [2020-12-22 11:26:00,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 11:26:00,620 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 79 [2020-12-22 11:26:00,630 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 11:26:00,724 INFO L625 ElimStorePlain]: treesize reduction 26, result has 70.1 percent of original size [2020-12-22 11:26:00,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 11:26:00,740 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2020-12-22 11:26:00,742 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 11:26:00,775 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 11:26:00,783 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 11:26:00,784 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:64, output treesize:35 [2020-12-22 11:26:01,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 11:26:01,126 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 11:26:01,126 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 64 [2020-12-22 11:26:01,130 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 11:26:01,214 INFO L625 ElimStorePlain]: treesize reduction 16, result has 77.8 percent of original size [2020-12-22 11:26:01,222 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:26:01,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:01,231 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:26:01,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:01,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:26:01,242 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-12-22 11:26:01,242 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:52 [2020-12-22 11:26:01,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:26:01,249 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:01,255 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:26:01,257 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:01,262 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:26:03,359 WARN L197 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 37 [2020-12-22 11:26:03,368 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:26:03,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:03,373 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:26:03,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:26:03,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:03,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:26:03,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:26:03,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:03,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:26:03,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:26:03,694 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:03,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:26:04,298 INFO L173 IndexEqualityManager]: detected equality via solver [2020-12-22 11:26:04,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-12-22 11:26:04,342 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 11:26:04,342 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 86 [2020-12-22 11:26:04,351 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 11:26:04,416 INFO L625 ElimStorePlain]: treesize reduction 20, result has 71.0 percent of original size [2020-12-22 11:26:04,419 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-22 11:26:04,419 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:46 [2020-12-22 11:26:04,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:04,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:26:04,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:04,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 11:26:04,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:04,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:04,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:26:04,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:04,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 11:26:04,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:04,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:04,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 11:26:04,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:04,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 11:26:04,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:04,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:04,628 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2020-12-22 11:26:04,631 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 11:26:04,666 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2020-12-22 11:26:04,669 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 11:26:04,684 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 45 [2020-12-22 11:26:04,686 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-22 11:26:04,778 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 11:26:04,786 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2020-12-22 11:26:04,786 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:176, output treesize:231 [2020-12-22 11:26:05,068 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2020-12-22 11:26:05,487 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 1] term [2020-12-22 11:26:05,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:26:05,534 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 11:26:05,535 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 50 [2020-12-22 11:26:05,539 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-12-22 11:26:05,576 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 11:26:05,601 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 11:26:05,602 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 67 [2020-12-22 11:26:05,610 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-22 11:26:05,626 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-22 11:26:05,629 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-12-22 11:26:05,629 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:136, output treesize:3 [2020-12-22 11:26:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:26:05,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 11:26:05,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2020-12-22 11:26:05,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417471833] [2020-12-22 11:26:05,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-12-22 11:26:05,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:26:05,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-12-22 11:26:05,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2020-12-22 11:26:05,648 INFO L87 Difference]: Start difference. First operand 4546 states and 14595 transitions. Second operand 29 states. [2020-12-22 11:26:08,726 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 44