/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-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 23:47:59,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 23:47:59,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 23:48:00,009 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 23:48:00,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 23:48:00,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 23:48:00,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 23:48:00,016 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 23:48:00,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 23:48:00,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 23:48:00,021 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 23:48:00,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 23:48:00,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 23:48:00,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 23:48:00,026 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 23:48:00,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 23:48:00,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 23:48:00,046 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 23:48:00,048 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 23:48:00,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 23:48:00,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 23:48:00,055 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 23:48:00,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 23:48:00,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 23:48:00,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 23:48:00,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 23:48:00,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 23:48:00,064 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 23:48:00,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 23:48:00,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 23:48:00,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 23:48:00,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 23:48:00,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 23:48:00,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 23:48:00,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 23:48:00,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 23:48:00,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 23:48:00,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 23:48:00,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 23:48:00,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 23:48:00,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 23:48:00,077 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 23:48:00,114 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 23:48:00,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 23:48:00,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 23:48:00,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 23:48:00,117 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 23:48:00,118 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 23:48:00,118 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 23:48:00,118 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 23:48:00,118 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 23:48:00,119 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 23:48:00,120 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 23:48:00,120 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 23:48:00,120 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 23:48:00,120 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 23:48:00,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 23:48:00,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 23:48:00,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 23:48:00,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 23:48:00,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 23:48:00,122 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 23:48:00,122 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 23:48:00,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 23:48:00,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 23:48:00,123 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 23:48:00,123 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 23:48:00,123 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-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 23:48:00,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 23:48:00,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 23:48:00,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 23:48:00,584 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 23:48:00,585 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 23:48:00,586 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/ring_2w1r-2.i [2021-01-06 23:48:00,687 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8eb9b5412/d446a29f58f344f4a493716f392d8821/FLAG6511ab62d [2021-01-06 23:48:01,473 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 23:48:01,474 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i [2021-01-06 23:48:01,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8eb9b5412/d446a29f58f344f4a493716f392d8821/FLAG6511ab62d [2021-01-06 23:48:01,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8eb9b5412/d446a29f58f344f4a493716f392d8821 [2021-01-06 23:48:01,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 23:48:01,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 23:48:01,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 23:48:01,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 23:48:01,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 23:48:01,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:48:01" (1/1) ... [2021-01-06 23:48:01,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@242c83bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:01, skipping insertion in model container [2021-01-06 23:48:01,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:48:01" (1/1) ... [2021-01-06 23:48:01,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 23:48:01,779 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 23:48:01,969 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~r,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[#t~mem8,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~r,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],StructAccessExpression[IdentifierExpression[~r,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~r,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],StructAccessExpression[IdentifierExpression[~r,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~val~0,] [2021-01-06 23:48:02,291 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39095,39108] left hand side expression in assignment: lhs: VariableLHS[~last~0,] [2021-01-06 23:48:02,297 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39180,39193] [2021-01-06 23:48:02,305 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39232,39245] left hand side expression in assignment: lhs: VariableLHS[~val~1,] [2021-01-06 23:48:02,383 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49285,49298] [2021-01-06 23:48:02,384 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49334,49347] [2021-01-06 23:48:02,388 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49462,49475] [2021-01-06 23:48:02,389 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49520,49533] [2021-01-06 23:48:02,395 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:48:02,406 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 23:48:02,421 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],BinaryExpression[ARITHPLUS,BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~r,],offset]],BinaryExpression[ARITHMUL,IntegerLiteral[8],IdentifierExpression[#t~mem8,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~r,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],StructAccessExpression[IdentifierExpression[~r,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[40],StructAccessExpression[IdentifierExpression[~r,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~r,],base],StructAccessExpression[IdentifierExpression[~r,],offset]]] left hand side expression in assignment: lhs: VariableLHS[~val~0,] [2021-01-06 23:48:02,450 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39095,39108] left hand side expression in assignment: lhs: VariableLHS[~last~0,] [2021-01-06 23:48:02,451 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39180,39193] [2021-01-06 23:48:02,452 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[39232,39245] left hand side expression in assignment: lhs: VariableLHS[~val~1,] [2021-01-06 23:48:02,467 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49285,49298] [2021-01-06 23:48:02,468 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49334,49347] [2021-01-06 23:48:02,469 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49462,49475] [2021-01-06 23:48:02,470 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i[49520,49533] [2021-01-06 23:48:02,474 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:48:02,709 INFO L208 MainTranslator]: Completed translation [2021-01-06 23:48:02,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:02 WrapperNode [2021-01-06 23:48:02,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 23:48:02,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 23:48:02,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 23:48:02,711 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 23:48:02,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:02" (1/1) ... [2021-01-06 23:48:02,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:02" (1/1) ... [2021-01-06 23:48:02,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 23:48:02,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 23:48:02,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 23:48:02,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 23:48:02,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:02" (1/1) ... [2021-01-06 23:48:02,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:02" (1/1) ... [2021-01-06 23:48:02,840 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:02" (1/1) ... [2021-01-06 23:48:02,840 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:02" (1/1) ... [2021-01-06 23:48:02,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:02" (1/1) ... [2021-01-06 23:48:02,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:02" (1/1) ... [2021-01-06 23:48:02,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:02" (1/1) ... [2021-01-06 23:48:02,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 23:48:02,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 23:48:02,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 23:48:02,869 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 23:48:02,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:02" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 23:48:02,973 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2021-01-06 23:48:02,974 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2021-01-06 23:48:02,974 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2021-01-06 23:48:02,974 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2021-01-06 23:48:02,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 23:48:02,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 23:48:02,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 23:48:02,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 23:48:02,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 23:48:02,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 23:48:02,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 23:48:02,977 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-01-06 23:48:03,664 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 23:48:03,664 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2021-01-06 23:48:03,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:48:03 BoogieIcfgContainer [2021-01-06 23:48:03,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 23:48:03,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 23:48:03,669 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 23:48:03,673 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 23:48:03,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:48:01" (1/3) ... [2021-01-06 23:48:03,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7098f56b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:48:03, skipping insertion in model container [2021-01-06 23:48:03,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:48:02" (2/3) ... [2021-01-06 23:48:03,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7098f56b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:48:03, skipping insertion in model container [2021-01-06 23:48:03,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:48:03" (3/3) ... [2021-01-06 23:48:03,678 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2021-01-06 23:48:03,687 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-01-06 23:48:03,687 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 23:48:03,692 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2021-01-06 23:48:03,694 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-01-06 23:48:03,768 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,769 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,769 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,769 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,770 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,770 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,772 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,772 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,772 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,773 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,773 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,773 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,773 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,773 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,774 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,775 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,776 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,776 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,776 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,776 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,777 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,777 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,777 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,777 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,778 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,778 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,779 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,779 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,780 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,780 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,781 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,781 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,783 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,783 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,783 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,783 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,784 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,784 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,784 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,784 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,784 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,785 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,785 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,785 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,785 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,785 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,786 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,786 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,786 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,787 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,787 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,787 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,788 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,788 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,788 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,788 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,788 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,789 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,790 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,790 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,790 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,791 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,791 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,791 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,791 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,792 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,792 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,792 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,792 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,792 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,793 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,793 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,795 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,795 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,796 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,796 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,797 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,797 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,797 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,797 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,797 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,798 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,798 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,798 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,798 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,798 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,798 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,799 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,799 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,799 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,799 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,800 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,803 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,804 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,804 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,804 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,811 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,811 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,811 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,811 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,812 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,812 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,812 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,812 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,812 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,813 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,813 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,813 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,813 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,813 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,813 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,814 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,814 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,814 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,814 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,814 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,815 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,815 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,816 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,816 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,816 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,816 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,817 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,817 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,817 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,817 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,818 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,818 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,818 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,818 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,819 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,819 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,819 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,820 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,820 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,821 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,821 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,821 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,821 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,821 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,822 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,822 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,822 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,822 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,822 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,823 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,823 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,823 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,823 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,823 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,823 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,824 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,824 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,824 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,824 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,824 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,825 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,826 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,826 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,826 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,829 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,829 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,829 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,829 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,829 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,830 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,830 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,831 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,831 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,831 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,831 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,831 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,832 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,832 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,832 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,832 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,832 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,832 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,833 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,833 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,833 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,833 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,834 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,834 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,834 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,834 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,834 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,834 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,835 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,835 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,835 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,835 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,835 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,835 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,836 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,836 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,836 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,837 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,837 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,837 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,837 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,837 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,837 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,838 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,838 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,838 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,839 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,839 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,839 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,839 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,839 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,840 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,840 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,840 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,840 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,840 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,841 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,841 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,842 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,847 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,848 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,848 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,848 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,850 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,850 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,851 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,851 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,851 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,851 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,851 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,851 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,852 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,852 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,852 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,852 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,852 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,852 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,853 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,853 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,853 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,853 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,854 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,854 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,863 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,863 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,863 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,863 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,864 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,864 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,864 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,864 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,864 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,864 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,864 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,865 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,865 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,865 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,865 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,865 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,865 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,866 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,866 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,867 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,868 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,868 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,868 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,868 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,868 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,868 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,869 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,869 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,869 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,869 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,869 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,869 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,870 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,870 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,870 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,870 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,870 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,870 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,871 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,871 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,871 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,871 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,871 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,871 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,871 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,872 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,872 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,872 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,872 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,872 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,872 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,873 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,873 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,873 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,873 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,873 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,873 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,873 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,874 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,875 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,876 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,876 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,876 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,876 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,876 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,876 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,876 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,877 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,877 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,877 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,877 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,877 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,877 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,877 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,878 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,878 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,879 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,879 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,880 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,880 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,880 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,880 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,881 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,881 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,881 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,881 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,881 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,881 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,882 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,882 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,882 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,882 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,882 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,882 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,883 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,883 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,883 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,883 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,883 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,883 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,884 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,884 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,884 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,884 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,884 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,889 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,889 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,889 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,889 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,890 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,890 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,890 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,890 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,890 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,890 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,891 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,891 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,891 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,891 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,891 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,892 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,892 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,892 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,892 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,892 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,893 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,893 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,893 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,893 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,893 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,894 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,894 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,894 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,894 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,894 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,895 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,895 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,895 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,895 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,896 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,896 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,896 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,896 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,896 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,896 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,897 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,897 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,897 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,897 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,897 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,898 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,898 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,898 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,898 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,898 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,899 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,899 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,899 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,899 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,899 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,899 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,900 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,900 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,900 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,900 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,900 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,900 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,901 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,901 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,901 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,901 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,901 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,902 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,902 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,902 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,902 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,902 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,902 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,903 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,903 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,903 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,903 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,903 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,903 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,904 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,904 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,904 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,904 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,904 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,904 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,905 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,907 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,908 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,908 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,908 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,908 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,908 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,909 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,909 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,909 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,909 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,909 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,910 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,910 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,910 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,910 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,910 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,910 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,911 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,911 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,911 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,911 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,911 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,911 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,912 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,912 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,912 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,912 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,912 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,912 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,913 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,913 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,913 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,913 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,913 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,913 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,922 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,922 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,923 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,923 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,923 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,923 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,923 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,924 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,924 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,924 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,924 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,924 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,924 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,925 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,925 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,925 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,925 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,925 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:48:03,940 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-01-06 23:48:03,960 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2021-01-06 23:48:03,990 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 23:48:03,990 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 23:48:03,990 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 23:48:03,990 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 23:48:03,990 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 23:48:03,990 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 23:48:03,990 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 23:48:03,991 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 23:48:04,007 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-01-06 23:48:04,010 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 200 transitions, 422 flow [2021-01-06 23:48:04,013 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 200 transitions, 422 flow [2021-01-06 23:48:04,015 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 188 places, 200 transitions, 422 flow [2021-01-06 23:48:04,107 INFO L129 PetriNetUnfolder]: 18/200 cut-off events. [2021-01-06 23:48:04,107 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-01-06 23:48:04,125 INFO L84 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 200 events. 18/200 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 163. Up to 3 conditions per place. [2021-01-06 23:48:04,142 INFO L116 LiptonReduction]: Number of co-enabled transitions 15102 [2021-01-06 23:48:10,197 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-01-06 23:48:10,324 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-01-06 23:48:10,452 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-01-06 23:48:10,577 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-01-06 23:48:11,704 WARN L197 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2021-01-06 23:48:11,868 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-01-06 23:48:12,236 WARN L197 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2021-01-06 23:48:12,411 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-01-06 23:48:12,744 WARN L197 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-01-06 23:48:12,964 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-01-06 23:48:13,170 WARN L197 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-01-06 23:48:13,381 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2021-01-06 23:48:13,403 INFO L131 LiptonReduction]: Checked pairs total: 29380 [2021-01-06 23:48:13,403 INFO L133 LiptonReduction]: Total number of compositions: 172 [2021-01-06 23:48:13,411 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 64 transitions, 150 flow [2021-01-06 23:48:13,571 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2096 states. [2021-01-06 23:48:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states. [2021-01-06 23:48:13,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-06 23:48:13,597 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:48:13,598 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:48:13,599 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:48:13,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:48:13,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1939241903, now seen corresponding path program 1 times [2021-01-06 23:48:13,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:48:13,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129456139] [2021-01-06 23:48:13,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:48:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:48:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:48:14,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129456139] [2021-01-06 23:48:14,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:48:14,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 23:48:14,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436199502] [2021-01-06 23:48:14,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 23:48:14,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:48:14,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 23:48:14,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 23:48:14,201 INFO L87 Difference]: Start difference. First operand 2096 states. Second operand 7 states. [2021-01-06 23:48:14,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:48:14,625 INFO L93 Difference]: Finished difference Result 2085 states and 6715 transitions. [2021-01-06 23:48:14,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 23:48:14,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2021-01-06 23:48:14,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:48:14,668 INFO L225 Difference]: With dead ends: 2085 [2021-01-06 23:48:14,668 INFO L226 Difference]: Without dead ends: 1969 [2021-01-06 23:48:14,670 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-01-06 23:48:14,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2021-01-06 23:48:14,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2021-01-06 23:48:14,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2021-01-06 23:48:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 6383 transitions. [2021-01-06 23:48:14,865 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 6383 transitions. Word has length 17 [2021-01-06 23:48:14,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:48:14,866 INFO L481 AbstractCegarLoop]: Abstraction has 1969 states and 6383 transitions. [2021-01-06 23:48:14,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 23:48:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 6383 transitions. [2021-01-06 23:48:14,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:48:14,872 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:48:14,872 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:48:14,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 23:48:14,873 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:48:14,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:48:14,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1330449573, now seen corresponding path program 1 times [2021-01-06 23:48:14,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:48:14,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803841198] [2021-01-06 23:48:14,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:48:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:48:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:48:15,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803841198] [2021-01-06 23:48:15,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:48:15,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 23:48:15,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769055876] [2021-01-06 23:48:15,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 23:48:15,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:48:15,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 23:48:15,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 23:48:15,109 INFO L87 Difference]: Start difference. First operand 1969 states and 6383 transitions. Second operand 8 states. [2021-01-06 23:48:15,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:48:15,974 INFO L93 Difference]: Finished difference Result 3414 states and 11077 transitions. [2021-01-06 23:48:15,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 23:48:15,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2021-01-06 23:48:15,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:48:16,003 INFO L225 Difference]: With dead ends: 3414 [2021-01-06 23:48:16,003 INFO L226 Difference]: Without dead ends: 3234 [2021-01-06 23:48:16,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-01-06 23:48:16,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3234 states. [2021-01-06 23:48:16,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3234 to 2506. [2021-01-06 23:48:16,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2021-01-06 23:48:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 8138 transitions. [2021-01-06 23:48:16,117 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 8138 transitions. Word has length 18 [2021-01-06 23:48:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:48:16,117 INFO L481 AbstractCegarLoop]: Abstraction has 2506 states and 8138 transitions. [2021-01-06 23:48:16,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 23:48:16,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 8138 transitions. [2021-01-06 23:48:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:48:16,123 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:48:16,123 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:48:16,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 23:48:16,123 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:48:16,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:48:16,126 INFO L82 PathProgramCache]: Analyzing trace with hash 588258613, now seen corresponding path program 2 times [2021-01-06 23:48:16,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:48:16,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979739194] [2021-01-06 23:48:16,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:48:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:48:16,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:48:16,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979739194] [2021-01-06 23:48:16,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:48:16,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 23:48:16,345 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896714322] [2021-01-06 23:48:16,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 23:48:16,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:48:16,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 23:48:16,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-01-06 23:48:16,347 INFO L87 Difference]: Start difference. First operand 2506 states and 8138 transitions. Second operand 8 states. [2021-01-06 23:48:17,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:48:17,253 INFO L93 Difference]: Finished difference Result 3423 states and 11147 transitions. [2021-01-06 23:48:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 23:48:17,253 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2021-01-06 23:48:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:48:17,282 INFO L225 Difference]: With dead ends: 3423 [2021-01-06 23:48:17,283 INFO L226 Difference]: Without dead ends: 3247 [2021-01-06 23:48:17,283 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2021-01-06 23:48:17,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2021-01-06 23:48:17,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2545. [2021-01-06 23:48:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2545 states. [2021-01-06 23:48:17,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 8321 transitions. [2021-01-06 23:48:17,412 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 8321 transitions. Word has length 18 [2021-01-06 23:48:17,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:48:17,413 INFO L481 AbstractCegarLoop]: Abstraction has 2545 states and 8321 transitions. [2021-01-06 23:48:17,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 23:48:17,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 8321 transitions. [2021-01-06 23:48:17,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:48:17,416 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:48:17,417 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:48:17,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 23:48:17,417 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:48:17,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:48:17,419 INFO L82 PathProgramCache]: Analyzing trace with hash 848973395, now seen corresponding path program 3 times [2021-01-06 23:48:17,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:48:17,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122248970] [2021-01-06 23:48:17,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:48:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:48:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:48:17,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122248970] [2021-01-06 23:48:17,664 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:48:17,664 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 23:48:17,664 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471585642] [2021-01-06 23:48:17,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 23:48:17,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:48:17,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 23:48:17,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-01-06 23:48:17,666 INFO L87 Difference]: Start difference. First operand 2545 states and 8321 transitions. Second operand 8 states. [2021-01-06 23:48:18,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:48:18,409 INFO L93 Difference]: Finished difference Result 2651 states and 8539 transitions. [2021-01-06 23:48:18,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 23:48:18,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2021-01-06 23:48:18,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:48:18,433 INFO L225 Difference]: With dead ends: 2651 [2021-01-06 23:48:18,433 INFO L226 Difference]: Without dead ends: 2510 [2021-01-06 23:48:18,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-01-06 23:48:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2021-01-06 23:48:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2461. [2021-01-06 23:48:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2461 states. [2021-01-06 23:48:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 8022 transitions. [2021-01-06 23:48:18,528 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 8022 transitions. Word has length 18 [2021-01-06 23:48:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:48:18,529 INFO L481 AbstractCegarLoop]: Abstraction has 2461 states and 8022 transitions. [2021-01-06 23:48:18,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 23:48:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 8022 transitions. [2021-01-06 23:48:18,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 23:48:18,537 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:48:18,537 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] [2021-01-06 23:48:18,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 23:48:18,537 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:48:18,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:48:18,538 INFO L82 PathProgramCache]: Analyzing trace with hash 197324648, now seen corresponding path program 1 times [2021-01-06 23:48:18,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:48:18,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092859084] [2021-01-06 23:48:18,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:48:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:48:19,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:48:19,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092859084] [2021-01-06 23:48:19,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:48:19,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:48:19,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426324507] [2021-01-06 23:48:19,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 23:48:19,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:48:19,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 23:48:19,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:48:19,043 INFO L87 Difference]: Start difference. First operand 2461 states and 8022 transitions. Second operand 14 states. [2021-01-06 23:48:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:48:21,573 INFO L93 Difference]: Finished difference Result 3016 states and 9709 transitions. [2021-01-06 23:48:21,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 23:48:21,574 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2021-01-06 23:48:21,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:48:21,599 INFO L225 Difference]: With dead ends: 3016 [2021-01-06 23:48:21,599 INFO L226 Difference]: Without dead ends: 2941 [2021-01-06 23:48:21,600 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2021-01-06 23:48:21,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2021-01-06 23:48:21,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2868. [2021-01-06 23:48:21,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2868 states. [2021-01-06 23:48:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2868 states and 9366 transitions. [2021-01-06 23:48:21,713 INFO L78 Accepts]: Start accepts. Automaton has 2868 states and 9366 transitions. Word has length 25 [2021-01-06 23:48:21,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:48:21,714 INFO L481 AbstractCegarLoop]: Abstraction has 2868 states and 9366 transitions. [2021-01-06 23:48:21,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 23:48:21,714 INFO L276 IsEmpty]: Start isEmpty. Operand 2868 states and 9366 transitions. [2021-01-06 23:48:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 23:48:21,722 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:48:21,722 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] [2021-01-06 23:48:21,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 23:48:21,723 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:48:21,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:48:21,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1068686744, now seen corresponding path program 2 times [2021-01-06 23:48:21,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:48:21,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551154530] [2021-01-06 23:48:21,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:48:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:48:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:48:22,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551154530] [2021-01-06 23:48:22,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:48:22,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 23:48:22,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733256461] [2021-01-06 23:48:22,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 23:48:22,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:48:22,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 23:48:22,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-01-06 23:48:22,120 INFO L87 Difference]: Start difference. First operand 2868 states and 9366 transitions. Second operand 13 states. [2021-01-06 23:48:23,663 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2021-01-06 23:48:23,831 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2021-01-06 23:48:24,088 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 61 [2021-01-06 23:48:24,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:48:24,744 INFO L93 Difference]: Finished difference Result 3157 states and 10144 transitions. [2021-01-06 23:48:24,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 23:48:24,744 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2021-01-06 23:48:24,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:48:24,764 INFO L225 Difference]: With dead ends: 3157 [2021-01-06 23:48:24,764 INFO L226 Difference]: Without dead ends: 3068 [2021-01-06 23:48:24,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2021-01-06 23:48:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2021-01-06 23:48:24,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2951. [2021-01-06 23:48:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2951 states. [2021-01-06 23:48:24,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 9622 transitions. [2021-01-06 23:48:24,869 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 9622 transitions. Word has length 25 [2021-01-06 23:48:24,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:48:24,869 INFO L481 AbstractCegarLoop]: Abstraction has 2951 states and 9622 transitions. [2021-01-06 23:48:24,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 23:48:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 9622 transitions. [2021-01-06 23:48:24,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 23:48:24,878 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:48:24,878 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] [2021-01-06 23:48:24,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 23:48:24,878 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:48:24,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:48:24,879 INFO L82 PathProgramCache]: Analyzing trace with hash -602227060, now seen corresponding path program 1 times [2021-01-06 23:48:24,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:48:24,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469503033] [2021-01-06 23:48:24,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:48:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:48:25,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:48:25,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469503033] [2021-01-06 23:48:25,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:48:25,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:48:25,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556880923] [2021-01-06 23:48:25,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:48:25,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:48:25,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:48:25,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:48:25,448 INFO L87 Difference]: Start difference. First operand 2951 states and 9622 transitions. Second operand 15 states. [2021-01-06 23:48:26,316 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2021-01-06 23:48:26,729 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2021-01-06 23:48:27,864 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2021-01-06 23:48:28,071 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2021-01-06 23:48:28,381 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2021-01-06 23:48:28,650 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2021-01-06 23:48:29,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:48:29,123 INFO L93 Difference]: Finished difference Result 4860 states and 15550 transitions. [2021-01-06 23:48:29,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 23:48:29,124 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2021-01-06 23:48:29,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:48:29,142 INFO L225 Difference]: With dead ends: 4860 [2021-01-06 23:48:29,143 INFO L226 Difference]: Without dead ends: 4771 [2021-01-06 23:48:29,143 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=277, Invalid=653, Unknown=0, NotChecked=0, Total=930 [2021-01-06 23:48:29,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4771 states. [2021-01-06 23:48:29,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4771 to 3761. [2021-01-06 23:48:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3761 states. [2021-01-06 23:48:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 3761 states and 12282 transitions. [2021-01-06 23:48:29,302 INFO L78 Accepts]: Start accepts. Automaton has 3761 states and 12282 transitions. Word has length 25 [2021-01-06 23:48:29,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:48:29,302 INFO L481 AbstractCegarLoop]: Abstraction has 3761 states and 12282 transitions. [2021-01-06 23:48:29,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:48:29,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3761 states and 12282 transitions. [2021-01-06 23:48:29,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 23:48:29,312 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:48:29,312 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] [2021-01-06 23:48:29,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 23:48:29,313 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:48:29,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:48:29,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1437674924, now seen corresponding path program 3 times [2021-01-06 23:48:29,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:48:29,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701210629] [2021-01-06 23:48:29,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:48:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:48:29,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:48:29,777 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701210629] [2021-01-06 23:48:29,777 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:48:29,777 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:48:29,777 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983428140] [2021-01-06 23:48:29,778 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 23:48:29,778 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:48:29,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 23:48:29,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:48:29,779 INFO L87 Difference]: Start difference. First operand 3761 states and 12282 transitions. Second operand 14 states. [2021-01-06 23:48:31,481 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2021-01-06 23:48:31,681 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2021-01-06 23:48:31,817 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2021-01-06 23:48:32,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:48:32,385 INFO L93 Difference]: Finished difference Result 4452 states and 14292 transitions. [2021-01-06 23:48:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 23:48:32,385 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2021-01-06 23:48:32,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:48:32,402 INFO L225 Difference]: With dead ends: 4452 [2021-01-06 23:48:32,403 INFO L226 Difference]: Without dead ends: 4377 [2021-01-06 23:48:32,403 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2021-01-06 23:48:32,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4377 states. [2021-01-06 23:48:32,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4377 to 4255. [2021-01-06 23:48:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4255 states. [2021-01-06 23:48:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4255 states to 4255 states and 13846 transitions. [2021-01-06 23:48:32,540 INFO L78 Accepts]: Start accepts. Automaton has 4255 states and 13846 transitions. Word has length 25 [2021-01-06 23:48:32,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:48:32,540 INFO L481 AbstractCegarLoop]: Abstraction has 4255 states and 13846 transitions. [2021-01-06 23:48:32,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 23:48:32,541 INFO L276 IsEmpty]: Start isEmpty. Operand 4255 states and 13846 transitions. [2021-01-06 23:48:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 23:48:32,551 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:48:32,552 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] [2021-01-06 23:48:32,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 23:48:32,552 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:48:32,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:48:32,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1985930276, now seen corresponding path program 4 times [2021-01-06 23:48:32,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:48:32,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553312750] [2021-01-06 23:48:32,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:48:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:48:32,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:48:33,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553312750] [2021-01-06 23:48:33,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:48:33,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 23:48:33,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745140228] [2021-01-06 23:48:33,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 23:48:33,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:48:33,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 23:48:33,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-01-06 23:48:33,002 INFO L87 Difference]: Start difference. First operand 4255 states and 13846 transitions. Second operand 13 states. [2021-01-06 23:48:34,941 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2021-01-06 23:48:35,128 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2021-01-06 23:48:35,427 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2021-01-06 23:48:36,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:48:36,114 INFO L93 Difference]: Finished difference Result 5084 states and 16254 transitions. [2021-01-06 23:48:36,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 23:48:36,115 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2021-01-06 23:48:36,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:48:36,133 INFO L225 Difference]: With dead ends: 5084 [2021-01-06 23:48:36,134 INFO L226 Difference]: Without dead ends: 4995 [2021-01-06 23:48:36,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=215, Invalid=487, Unknown=0, NotChecked=0, Total=702 [2021-01-06 23:48:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4995 states. [2021-01-06 23:48:36,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4995 to 3641. [2021-01-06 23:48:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2021-01-06 23:48:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 11792 transitions. [2021-01-06 23:48:36,271 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 11792 transitions. Word has length 25 [2021-01-06 23:48:36,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:48:36,271 INFO L481 AbstractCegarLoop]: Abstraction has 3641 states and 11792 transitions. [2021-01-06 23:48:36,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 23:48:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 11792 transitions. [2021-01-06 23:48:36,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 23:48:36,281 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:48:36,281 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] [2021-01-06 23:48:36,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 23:48:36,282 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:48:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:48:36,282 INFO L82 PathProgramCache]: Analyzing trace with hash -802072470, now seen corresponding path program 5 times [2021-01-06 23:48:36,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:48:36,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506126156] [2021-01-06 23:48:36,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:48:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:48:36,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:48:36,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506126156] [2021-01-06 23:48:36,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:48:36,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:48:36,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675462185] [2021-01-06 23:48:36,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 23:48:36,732 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:48:36,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 23:48:36,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:48:36,733 INFO L87 Difference]: Start difference. First operand 3641 states and 11792 transitions. Second operand 14 states. [2021-01-06 23:48:38,628 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2021-01-06 23:48:39,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:48:39,319 INFO L93 Difference]: Finished difference Result 3982 states and 12812 transitions. [2021-01-06 23:48:39,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 23:48:39,324 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2021-01-06 23:48:39,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:48:39,340 INFO L225 Difference]: With dead ends: 3982 [2021-01-06 23:48:39,340 INFO L226 Difference]: Without dead ends: 3907 [2021-01-06 23:48:39,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:48:39,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3907 states. [2021-01-06 23:48:39,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3907 to 3895. [2021-01-06 23:48:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3895 states. [2021-01-06 23:48:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3895 states to 3895 states and 12596 transitions. [2021-01-06 23:48:39,462 INFO L78 Accepts]: Start accepts. Automaton has 3895 states and 12596 transitions. Word has length 25 [2021-01-06 23:48:39,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:48:39,465 INFO L481 AbstractCegarLoop]: Abstraction has 3895 states and 12596 transitions. [2021-01-06 23:48:39,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 23:48:39,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3895 states and 12596 transitions. [2021-01-06 23:48:39,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 23:48:39,476 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:48:39,476 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] [2021-01-06 23:48:39,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 23:48:39,477 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:48:39,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:48:39,477 INFO L82 PathProgramCache]: Analyzing trace with hash 69289626, now seen corresponding path program 6 times [2021-01-06 23:48:39,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:48:39,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068622048] [2021-01-06 23:48:39,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:48:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:48:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:48:40,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068622048] [2021-01-06 23:48:40,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:48:40,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:48:40,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275967177] [2021-01-06 23:48:40,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 23:48:40,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:48:40,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 23:48:40,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:48:40,171 INFO L87 Difference]: Start difference. First operand 3895 states and 12596 transitions. Second operand 14 states. [2021-01-06 23:48:41,326 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2021-01-06 23:48:42,264 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2021-01-06 23:48:42,448 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 42 [2021-01-06 23:48:42,662 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2021-01-06 23:48:42,954 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2021-01-06 23:48:43,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:48:43,659 INFO L93 Difference]: Finished difference Result 4614 states and 14774 transitions. [2021-01-06 23:48:43,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 23:48:43,660 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2021-01-06 23:48:43,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:48:43,676 INFO L225 Difference]: With dead ends: 4614 [2021-01-06 23:48:43,676 INFO L226 Difference]: Without dead ends: 4525 [2021-01-06 23:48:43,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2021-01-06 23:48:43,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4525 states. [2021-01-06 23:48:43,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4525 to 3401. [2021-01-06 23:48:43,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2021-01-06 23:48:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 11032 transitions. [2021-01-06 23:48:43,795 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 11032 transitions. Word has length 25 [2021-01-06 23:48:43,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:48:43,795 INFO L481 AbstractCegarLoop]: Abstraction has 3401 states and 11032 transitions. [2021-01-06 23:48:43,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 23:48:43,795 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 11032 transitions. [2021-01-06 23:48:43,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 23:48:43,806 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:48:43,806 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] [2021-01-06 23:48:43,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 23:48:43,806 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:48:43,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:48:43,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1779182558, now seen corresponding path program 7 times [2021-01-06 23:48:43,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:48:43,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195381678] [2021-01-06 23:48:43,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:48:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:48:44,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:48:44,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195381678] [2021-01-06 23:48:44,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:48:44,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:48:44,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622934701] [2021-01-06 23:48:44,215 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 23:48:44,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:48:44,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 23:48:44,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:48:44,217 INFO L87 Difference]: Start difference. First operand 3401 states and 11032 transitions. Second operand 14 states. [2021-01-06 23:48:45,670 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2021-01-06 23:48:46,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:48:46,106 INFO L93 Difference]: Finished difference Result 3490 states and 11127 transitions. [2021-01-06 23:48:46,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-06 23:48:46,107 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2021-01-06 23:48:46,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:48:46,119 INFO L225 Difference]: With dead ends: 3490 [2021-01-06 23:48:46,120 INFO L226 Difference]: Without dead ends: 3415 [2021-01-06 23:48:46,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2021-01-06 23:48:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3415 states. [2021-01-06 23:48:46,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3415 to 3295. [2021-01-06 23:48:46,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3295 states. [2021-01-06 23:48:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3295 states to 3295 states and 10569 transitions. [2021-01-06 23:48:46,221 INFO L78 Accepts]: Start accepts. Automaton has 3295 states and 10569 transitions. Word has length 25 [2021-01-06 23:48:46,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:48:46,222 INFO L481 AbstractCegarLoop]: Abstraction has 3295 states and 10569 transitions. [2021-01-06 23:48:46,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 23:48:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3295 states and 10569 transitions. [2021-01-06 23:48:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 23:48:46,231 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:48:46,231 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] [2021-01-06 23:48:46,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 23:48:46,231 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:48:46,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:48:46,232 INFO L82 PathProgramCache]: Analyzing trace with hash -907820462, now seen corresponding path program 8 times [2021-01-06 23:48:46,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:48:46,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79011210] [2021-01-06 23:48:46,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:48:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:48:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:48:46,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79011210] [2021-01-06 23:48:46,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:48:46,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 23:48:46,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459638417] [2021-01-06 23:48:46,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 23:48:46,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:48:46,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 23:48:46,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-01-06 23:48:46,659 INFO L87 Difference]: Start difference. First operand 3295 states and 10569 transitions. Second operand 13 states. [2021-01-06 23:48:47,854 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2021-01-06 23:48:48,084 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2021-01-06 23:48:49,187 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2021-01-06 23:48:49,412 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2021-01-06 23:48:49,671 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2021-01-06 23:48:49,875 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2021-01-06 23:48:50,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:48:50,600 INFO L93 Difference]: Finished difference Result 4168 states and 13231 transitions. [2021-01-06 23:48:50,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-06 23:48:50,600 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2021-01-06 23:48:50,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:48:50,613 INFO L225 Difference]: With dead ends: 4168 [2021-01-06 23:48:50,614 INFO L226 Difference]: Without dead ends: 4079 [2021-01-06 23:48:50,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870 [2021-01-06 23:48:50,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4079 states. [2021-01-06 23:48:50,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4079 to 3175. [2021-01-06 23:48:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3175 states. [2021-01-06 23:48:50,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 10189 transitions. [2021-01-06 23:48:50,714 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 10189 transitions. Word has length 25 [2021-01-06 23:48:50,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:48:50,714 INFO L481 AbstractCegarLoop]: Abstraction has 3175 states and 10189 transitions. [2021-01-06 23:48:50,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 23:48:50,714 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 10189 transitions. [2021-01-06 23:48:50,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 23:48:50,721 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:48:50,722 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] [2021-01-06 23:48:50,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 23:48:50,722 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:48:50,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:48:50,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1462145462, now seen corresponding path program 2 times [2021-01-06 23:48:50,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:48:50,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215192424] [2021-01-06 23:48:50,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:48:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:48:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:48:51,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215192424] [2021-01-06 23:48:51,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:48:51,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:48:51,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465823317] [2021-01-06 23:48:51,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:48:51,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:48:51,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:48:51,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:48:51,324 INFO L87 Difference]: Start difference. First operand 3175 states and 10189 transitions. Second operand 15 states. [2021-01-06 23:48:52,188 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2021-01-06 23:48:52,445 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2021-01-06 23:48:52,916 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2021-01-06 23:48:54,007 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2021-01-06 23:48:54,237 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 46 [2021-01-06 23:48:54,480 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2021-01-06 23:48:54,847 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2021-01-06 23:48:55,178 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2021-01-06 23:48:55,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:48:55,646 INFO L93 Difference]: Finished difference Result 4584 states and 14507 transitions. [2021-01-06 23:48:55,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-06 23:48:55,646 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2021-01-06 23:48:55,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:48:55,663 INFO L225 Difference]: With dead ends: 4584 [2021-01-06 23:48:55,663 INFO L226 Difference]: Without dead ends: 4495 [2021-01-06 23:48:55,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=295, Invalid=697, Unknown=0, NotChecked=0, Total=992 [2021-01-06 23:48:55,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2021-01-06 23:48:55,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 3175. [2021-01-06 23:48:55,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3175 states. [2021-01-06 23:48:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 10189 transitions. [2021-01-06 23:48:55,780 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 10189 transitions. Word has length 25 [2021-01-06 23:48:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:48:55,781 INFO L481 AbstractCegarLoop]: Abstraction has 3175 states and 10189 transitions. [2021-01-06 23:48:55,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:48:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 10189 transitions. [2021-01-06 23:48:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 23:48:55,790 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:48:55,790 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] [2021-01-06 23:48:55,790 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 23:48:55,790 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:48:55,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:48:55,791 INFO L82 PathProgramCache]: Analyzing trace with hash -839111096, now seen corresponding path program 3 times [2021-01-06 23:48:55,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:48:55,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488284104] [2021-01-06 23:48:55,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:48:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:48:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:48:56,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488284104] [2021-01-06 23:48:56,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:48:56,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:48:56,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121541749] [2021-01-06 23:48:56,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:48:56,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:48:56,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:48:56,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:48:56,409 INFO L87 Difference]: Start difference. First operand 3175 states and 10189 transitions. Second operand 15 states. [2021-01-06 23:48:57,280 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 41 [2021-01-06 23:48:57,462 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2021-01-06 23:48:57,744 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2021-01-06 23:48:58,249 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2021-01-06 23:48:59,454 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2021-01-06 23:48:59,667 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2021-01-06 23:48:59,920 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2021-01-06 23:49:00,278 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2021-01-06 23:49:00,599 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2021-01-06 23:49:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:49:01,114 INFO L93 Difference]: Finished difference Result 4384 states and 13907 transitions. [2021-01-06 23:49:01,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-01-06 23:49:01,116 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2021-01-06 23:49:01,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:49:01,127 INFO L225 Difference]: With dead ends: 4384 [2021-01-06 23:49:01,127 INFO L226 Difference]: Without dead ends: 4295 [2021-01-06 23:49:01,128 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=313, Invalid=743, Unknown=0, NotChecked=0, Total=1056 [2021-01-06 23:49:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4295 states. [2021-01-06 23:49:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4295 to 3245. [2021-01-06 23:49:01,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3245 states. [2021-01-06 23:49:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3245 states to 3245 states and 10469 transitions. [2021-01-06 23:49:01,237 INFO L78 Accepts]: Start accepts. Automaton has 3245 states and 10469 transitions. Word has length 25 [2021-01-06 23:49:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:49:01,237 INFO L481 AbstractCegarLoop]: Abstraction has 3245 states and 10469 transitions. [2021-01-06 23:49:01,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:49:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3245 states and 10469 transitions. [2021-01-06 23:49:01,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 23:49:01,245 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:49:01,245 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] [2021-01-06 23:49:01,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 23:49:01,245 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:49:01,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:49:01,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1696407784, now seen corresponding path program 4 times [2021-01-06 23:49:01,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:49:01,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017010604] [2021-01-06 23:49:01,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:49:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:49:01,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:49:01,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017010604] [2021-01-06 23:49:01,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:49:01,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:49:01,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414205062] [2021-01-06 23:49:01,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 23:49:01,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:49:01,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 23:49:01,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:49:01,700 INFO L87 Difference]: Start difference. First operand 3245 states and 10469 transitions. Second operand 14 states. [2021-01-06 23:49:02,627 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2021-01-06 23:49:03,006 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2021-01-06 23:49:03,374 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2021-01-06 23:49:03,609 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2021-01-06 23:49:03,861 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2021-01-06 23:49:04,974 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2021-01-06 23:49:05,266 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2021-01-06 23:49:05,545 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2021-01-06 23:49:05,907 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2021-01-06 23:49:06,129 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2021-01-06 23:49:06,433 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2021-01-06 23:49:06,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:49:06,970 INFO L93 Difference]: Finished difference Result 4244 states and 13342 transitions. [2021-01-06 23:49:06,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-06 23:49:06,971 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2021-01-06 23:49:06,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:49:06,977 INFO L225 Difference]: With dead ends: 4244 [2021-01-06 23:49:06,978 INFO L226 Difference]: Without dead ends: 4155 [2021-01-06 23:49:06,978 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=322, Invalid=800, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 23:49:06,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2021-01-06 23:49:07,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 3199. [2021-01-06 23:49:07,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3199 states. [2021-01-06 23:49:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3199 states to 3199 states and 10176 transitions. [2021-01-06 23:49:07,066 INFO L78 Accepts]: Start accepts. Automaton has 3199 states and 10176 transitions. Word has length 25 [2021-01-06 23:49:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:49:07,066 INFO L481 AbstractCegarLoop]: Abstraction has 3199 states and 10176 transitions. [2021-01-06 23:49:07,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 23:49:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3199 states and 10176 transitions. [2021-01-06 23:49:07,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 23:49:07,072 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:49:07,073 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] [2021-01-06 23:49:07,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 23:49:07,073 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:49:07,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:49:07,073 INFO L82 PathProgramCache]: Analyzing trace with hash -2038283772, now seen corresponding path program 5 times [2021-01-06 23:49:07,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:49:07,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802693217] [2021-01-06 23:49:07,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:49:07,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:49:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:49:07,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802693217] [2021-01-06 23:49:07,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:49:07,407 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:49:07,407 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720674251] [2021-01-06 23:49:07,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 23:49:07,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:49:07,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 23:49:07,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:49:07,408 INFO L87 Difference]: Start difference. First operand 3199 states and 10176 transitions. Second operand 14 states. [2021-01-06 23:49:07,912 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2021-01-06 23:49:08,119 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2021-01-06 23:49:08,476 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2021-01-06 23:49:09,208 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2021-01-06 23:49:09,429 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2021-01-06 23:49:09,657 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2021-01-06 23:49:09,974 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2021-01-06 23:49:10,226 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2021-01-06 23:49:10,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:49:10,498 INFO L93 Difference]: Finished difference Result 4048 states and 12704 transitions. [2021-01-06 23:49:10,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 23:49:10,499 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2021-01-06 23:49:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:49:10,508 INFO L225 Difference]: With dead ends: 4048 [2021-01-06 23:49:10,509 INFO L226 Difference]: Without dead ends: 3959 [2021-01-06 23:49:10,509 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=217, Invalid=485, Unknown=0, NotChecked=0, Total=702 [2021-01-06 23:49:10,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3959 states. [2021-01-06 23:49:10,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3959 to 2769. [2021-01-06 23:49:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2769 states. [2021-01-06 23:49:10,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2769 states to 2769 states and 8836 transitions. [2021-01-06 23:49:10,591 INFO L78 Accepts]: Start accepts. Automaton has 2769 states and 8836 transitions. Word has length 25 [2021-01-06 23:49:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:49:10,592 INFO L481 AbstractCegarLoop]: Abstraction has 2769 states and 8836 transitions. [2021-01-06 23:49:10,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 23:49:10,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2769 states and 8836 transitions. [2021-01-06 23:49:10,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:49:10,597 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:49:10,597 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] [2021-01-06 23:49:10,597 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 23:49:10,597 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:49:10,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:49:10,598 INFO L82 PathProgramCache]: Analyzing trace with hash -144703769, now seen corresponding path program 1 times [2021-01-06 23:49:10,598 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:49:10,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079529555] [2021-01-06 23:49:10,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:49:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:49:11,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:49:11,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079529555] [2021-01-06 23:49:11,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:49:11,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-01-06 23:49:11,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815964657] [2021-01-06 23:49:11,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-06 23:49:11,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:49:11,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-06 23:49:11,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-01-06 23:49:11,487 INFO L87 Difference]: Start difference. First operand 2769 states and 8836 transitions. Second operand 17 states. [2021-01-06 23:49:11,953 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2021-01-06 23:49:12,149 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2021-01-06 23:49:12,498 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2021-01-06 23:49:12,793 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2021-01-06 23:49:13,880 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2021-01-06 23:49:14,040 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2021-01-06 23:49:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:49:15,545 INFO L93 Difference]: Finished difference Result 5101 states and 16464 transitions. [2021-01-06 23:49:15,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-06 23:49:15,545 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2021-01-06 23:49:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:49:15,555 INFO L225 Difference]: With dead ends: 5101 [2021-01-06 23:49:15,555 INFO L226 Difference]: Without dead ends: 5101 [2021-01-06 23:49:15,556 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2021-01-06 23:49:15,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5101 states. [2021-01-06 23:49:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5101 to 3949. [2021-01-06 23:49:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3949 states. [2021-01-06 23:49:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 12589 transitions. [2021-01-06 23:49:15,681 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 12589 transitions. Word has length 27 [2021-01-06 23:49:15,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:49:15,681 INFO L481 AbstractCegarLoop]: Abstraction has 3949 states and 12589 transitions. [2021-01-06 23:49:15,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-06 23:49:15,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 12589 transitions. [2021-01-06 23:49:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:49:15,689 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:49:15,689 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] [2021-01-06 23:49:15,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 23:49:15,689 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:49:15,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:49:15,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1191722114, now seen corresponding path program 1 times [2021-01-06 23:49:15,690 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:49:15,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466937568] [2021-01-06 23:49:15,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:49:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:49:16,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:49:16,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466937568] [2021-01-06 23:49:16,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:49:16,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:49:16,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123375771] [2021-01-06 23:49:16,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:49:16,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:49:16,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:49:16,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:49:16,506 INFO L87 Difference]: Start difference. First operand 3949 states and 12589 transitions. Second operand 16 states. [2021-01-06 23:49:17,120 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2021-01-06 23:49:17,384 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2021-01-06 23:49:17,792 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2021-01-06 23:49:18,115 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2021-01-06 23:49:20,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:49:20,045 INFO L93 Difference]: Finished difference Result 6639 states and 21182 transitions. [2021-01-06 23:49:20,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 23:49:20,046 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2021-01-06 23:49:20,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:49:20,061 INFO L225 Difference]: With dead ends: 6639 [2021-01-06 23:49:20,061 INFO L226 Difference]: Without dead ends: 6639 [2021-01-06 23:49:20,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2021-01-06 23:49:20,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6639 states. [2021-01-06 23:49:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6639 to 4837. [2021-01-06 23:49:20,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4837 states. [2021-01-06 23:49:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4837 states to 4837 states and 15293 transitions. [2021-01-06 23:49:20,216 INFO L78 Accepts]: Start accepts. Automaton has 4837 states and 15293 transitions. Word has length 27 [2021-01-06 23:49:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:49:20,217 INFO L481 AbstractCegarLoop]: Abstraction has 4837 states and 15293 transitions. [2021-01-06 23:49:20,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:49:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 4837 states and 15293 transitions. [2021-01-06 23:49:20,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:49:20,226 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:49:20,226 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] [2021-01-06 23:49:20,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 23:49:20,227 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:49:20,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:49:20,227 INFO L82 PathProgramCache]: Analyzing trace with hash 2125970475, now seen corresponding path program 2 times [2021-01-06 23:49:20,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:49:20,227 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053171903] [2021-01-06 23:49:20,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:49:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:49:21,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:49:21,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053171903] [2021-01-06 23:49:21,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:49:21,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-01-06 23:49:21,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835778347] [2021-01-06 23:49:21,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-06 23:49:21,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:49:21,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-06 23:49:21,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-01-06 23:49:21,075 INFO L87 Difference]: Start difference. First operand 4837 states and 15293 transitions. Second operand 17 states. [2021-01-06 23:49:21,683 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2021-01-06 23:49:22,031 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2021-01-06 23:49:22,339 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2021-01-06 23:49:23,406 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2021-01-06 23:49:23,566 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2021-01-06 23:49:25,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:49:25,236 INFO L93 Difference]: Finished difference Result 7193 states and 22993 transitions. [2021-01-06 23:49:25,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-06 23:49:25,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2021-01-06 23:49:25,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:49:25,259 INFO L225 Difference]: With dead ends: 7193 [2021-01-06 23:49:25,259 INFO L226 Difference]: Without dead ends: 7193 [2021-01-06 23:49:25,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2021-01-06 23:49:25,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7193 states. [2021-01-06 23:49:25,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7193 to 4601. [2021-01-06 23:49:25,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4601 states. [2021-01-06 23:49:25,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4601 states to 4601 states and 14585 transitions. [2021-01-06 23:49:25,443 INFO L78 Accepts]: Start accepts. Automaton has 4601 states and 14585 transitions. Word has length 27 [2021-01-06 23:49:25,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:49:25,443 INFO L481 AbstractCegarLoop]: Abstraction has 4601 states and 14585 transitions. [2021-01-06 23:49:25,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-06 23:49:25,444 INFO L276 IsEmpty]: Start isEmpty. Operand 4601 states and 14585 transitions. [2021-01-06 23:49:25,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:49:25,452 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:49:25,452 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] [2021-01-06 23:49:25,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 23:49:25,452 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:49:25,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:49:25,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1507340137, now seen corresponding path program 3 times [2021-01-06 23:49:25,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:49:25,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199800968] [2021-01-06 23:49:25,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:49:25,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:49:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:49:26,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199800968] [2021-01-06 23:49:26,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:49:26,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:49:26,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036552878] [2021-01-06 23:49:26,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:49:26,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:49:26,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:49:26,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:49:26,097 INFO L87 Difference]: Start difference. First operand 4601 states and 14585 transitions. Second operand 15 states. [2021-01-06 23:49:26,732 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2021-01-06 23:49:27,074 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2021-01-06 23:49:27,357 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2021-01-06 23:49:29,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:49:29,509 INFO L93 Difference]: Finished difference Result 6511 states and 20958 transitions. [2021-01-06 23:49:29,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 23:49:29,510 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2021-01-06 23:49:29,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:49:29,521 INFO L225 Difference]: With dead ends: 6511 [2021-01-06 23:49:29,521 INFO L226 Difference]: Without dead ends: 6511 [2021-01-06 23:49:29,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2021-01-06 23:49:29,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6511 states. [2021-01-06 23:49:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6511 to 5551. [2021-01-06 23:49:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5551 states. [2021-01-06 23:49:29,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5551 states to 5551 states and 17723 transitions. [2021-01-06 23:49:29,665 INFO L78 Accepts]: Start accepts. Automaton has 5551 states and 17723 transitions. Word has length 27 [2021-01-06 23:49:29,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:49:29,666 INFO L481 AbstractCegarLoop]: Abstraction has 5551 states and 17723 transitions. [2021-01-06 23:49:29,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:49:29,666 INFO L276 IsEmpty]: Start isEmpty. Operand 5551 states and 17723 transitions. [2021-01-06 23:49:29,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:49:29,676 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:49:29,676 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] [2021-01-06 23:49:29,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 23:49:29,677 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:49:29,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:49:29,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1507340138, now seen corresponding path program 1 times [2021-01-06 23:49:29,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:49:29,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22238905] [2021-01-06 23:49:29,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:49:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:49:30,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:49:30,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22238905] [2021-01-06 23:49:30,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:49:30,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:49:30,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802716091] [2021-01-06 23:49:30,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:49:30,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:49:30,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:49:30,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:49:30,332 INFO L87 Difference]: Start difference. First operand 5551 states and 17723 transitions. Second operand 15 states. [2021-01-06 23:49:30,954 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2021-01-06 23:49:31,269 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2021-01-06 23:49:31,524 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 42 [2021-01-06 23:49:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:49:33,441 INFO L93 Difference]: Finished difference Result 6511 states and 20838 transitions. [2021-01-06 23:49:33,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 23:49:33,442 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2021-01-06 23:49:33,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:49:33,453 INFO L225 Difference]: With dead ends: 6511 [2021-01-06 23:49:33,454 INFO L226 Difference]: Without dead ends: 6511 [2021-01-06 23:49:33,454 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2021-01-06 23:49:33,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6511 states. [2021-01-06 23:49:33,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6511 to 4241. [2021-01-06 23:49:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4241 states. [2021-01-06 23:49:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4241 states to 4241 states and 13505 transitions. [2021-01-06 23:49:33,616 INFO L78 Accepts]: Start accepts. Automaton has 4241 states and 13505 transitions. Word has length 27 [2021-01-06 23:49:33,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:49:33,617 INFO L481 AbstractCegarLoop]: Abstraction has 4241 states and 13505 transitions. [2021-01-06 23:49:33,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:49:33,617 INFO L276 IsEmpty]: Start isEmpty. Operand 4241 states and 13505 transitions. [2021-01-06 23:49:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:49:33,626 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:49:33,626 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] [2021-01-06 23:49:33,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 23:49:33,627 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:49:33,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:49:33,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1192583903, now seen corresponding path program 4 times [2021-01-06 23:49:33,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:49:33,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509138812] [2021-01-06 23:49:33,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:49:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:49:34,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:49:34,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509138812] [2021-01-06 23:49:34,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:49:34,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:49:34,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252718094] [2021-01-06 23:49:34,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:49:34,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:49:34,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:49:34,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:49:34,488 INFO L87 Difference]: Start difference. First operand 4241 states and 13505 transitions. Second operand 16 states. [2021-01-06 23:49:35,433 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2021-01-06 23:49:35,701 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2021-01-06 23:49:36,879 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2021-01-06 23:49:37,068 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2021-01-06 23:49:38,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:49:38,402 INFO L93 Difference]: Finished difference Result 6026 states and 19446 transitions. [2021-01-06 23:49:38,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 23:49:38,402 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2021-01-06 23:49:38,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:49:38,414 INFO L225 Difference]: With dead ends: 6026 [2021-01-06 23:49:38,414 INFO L226 Difference]: Without dead ends: 6026 [2021-01-06 23:49:38,415 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2021-01-06 23:49:38,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6026 states. [2021-01-06 23:49:38,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6026 to 5071. [2021-01-06 23:49:38,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5071 states. [2021-01-06 23:49:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5071 states to 5071 states and 16283 transitions. [2021-01-06 23:49:38,528 INFO L78 Accepts]: Start accepts. Automaton has 5071 states and 16283 transitions. Word has length 27 [2021-01-06 23:49:38,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:49:38,528 INFO L481 AbstractCegarLoop]: Abstraction has 5071 states and 16283 transitions. [2021-01-06 23:49:38,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:49:38,528 INFO L276 IsEmpty]: Start isEmpty. Operand 5071 states and 16283 transitions. [2021-01-06 23:49:38,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:49:38,535 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:49:38,535 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] [2021-01-06 23:49:38,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 23:49:38,535 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:49:38,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:49:38,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1192583902, now seen corresponding path program 2 times [2021-01-06 23:49:38,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:49:38,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473011235] [2021-01-06 23:49:38,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:49:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:49:39,044 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2021-01-06 23:49:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:49:39,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473011235] [2021-01-06 23:49:39,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:49:39,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:49:39,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745794671] [2021-01-06 23:49:39,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:49:39,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:49:39,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:49:39,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:49:39,331 INFO L87 Difference]: Start difference. First operand 5071 states and 16283 transitions. Second operand 15 states. [2021-01-06 23:49:40,269 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2021-01-06 23:49:40,540 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2021-01-06 23:49:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:49:42,647 INFO L93 Difference]: Finished difference Result 5911 states and 19038 transitions. [2021-01-06 23:49:42,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 23:49:42,648 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2021-01-06 23:49:42,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:49:42,659 INFO L225 Difference]: With dead ends: 5911 [2021-01-06 23:49:42,660 INFO L226 Difference]: Without dead ends: 5911 [2021-01-06 23:49:42,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2021-01-06 23:49:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5911 states. [2021-01-06 23:49:42,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5911 to 4121. [2021-01-06 23:49:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4121 states. [2021-01-06 23:49:42,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 13145 transitions. [2021-01-06 23:49:42,766 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 13145 transitions. Word has length 27 [2021-01-06 23:49:42,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:49:42,767 INFO L481 AbstractCegarLoop]: Abstraction has 4121 states and 13145 transitions. [2021-01-06 23:49:42,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:49:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 13145 transitions. [2021-01-06 23:49:42,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:49:42,773 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:49:42,773 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] [2021-01-06 23:49:42,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 23:49:42,773 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:49:42,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:49:42,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1121877513, now seen corresponding path program 5 times [2021-01-06 23:49:42,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:49:42,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111311458] [2021-01-06 23:49:42,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:49:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:49:43,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:49:43,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111311458] [2021-01-06 23:49:43,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:49:43,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:49:43,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989777671] [2021-01-06 23:49:43,422 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:49:43,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:49:43,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:49:43,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:49:43,423 INFO L87 Difference]: Start difference. First operand 4121 states and 13145 transitions. Second operand 15 states. [2021-01-06 23:49:44,563 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2021-01-06 23:49:46,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:49:46,770 INFO L93 Difference]: Finished difference Result 5726 states and 18522 transitions. [2021-01-06 23:49:46,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 23:49:46,771 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2021-01-06 23:49:46,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:49:46,782 INFO L225 Difference]: With dead ends: 5726 [2021-01-06 23:49:46,782 INFO L226 Difference]: Without dead ends: 5726 [2021-01-06 23:49:46,782 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2021-01-06 23:49:46,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5726 states. [2021-01-06 23:49:46,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5726 to 4811. [2021-01-06 23:49:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4811 states. [2021-01-06 23:49:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4811 states to 4811 states and 15483 transitions. [2021-01-06 23:49:46,869 INFO L78 Accepts]: Start accepts. Automaton has 4811 states and 15483 transitions. Word has length 27 [2021-01-06 23:49:46,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:49:46,869 INFO L481 AbstractCegarLoop]: Abstraction has 4811 states and 15483 transitions. [2021-01-06 23:49:46,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:49:46,869 INFO L276 IsEmpty]: Start isEmpty. Operand 4811 states and 15483 transitions. [2021-01-06 23:49:46,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:49:46,877 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:49:46,878 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] [2021-01-06 23:49:46,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 23:49:46,878 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:49:46,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:49:46,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1121877514, now seen corresponding path program 3 times [2021-01-06 23:49:46,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:49:46,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800371275] [2021-01-06 23:49:46,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:49:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:49:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:49:47,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800371275] [2021-01-06 23:49:47,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:49:47,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:49:47,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523767432] [2021-01-06 23:49:47,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:49:47,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:49:47,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:49:47,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:49:47,531 INFO L87 Difference]: Start difference. First operand 4811 states and 15483 transitions. Second operand 15 states. [2021-01-06 23:49:48,764 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 43 [2021-01-06 23:49:50,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:49:50,967 INFO L93 Difference]: Finished difference Result 5651 states and 18238 transitions. [2021-01-06 23:49:50,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-01-06 23:49:50,968 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2021-01-06 23:49:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:49:50,979 INFO L225 Difference]: With dead ends: 5651 [2021-01-06 23:49:50,980 INFO L226 Difference]: Without dead ends: 5651 [2021-01-06 23:49:50,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2021-01-06 23:49:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2021-01-06 23:49:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 3981. [2021-01-06 23:49:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3981 states. [2021-01-06 23:49:51,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 12705 transitions. [2021-01-06 23:49:51,070 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 12705 transitions. Word has length 27 [2021-01-06 23:49:51,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:49:51,070 INFO L481 AbstractCegarLoop]: Abstraction has 3981 states and 12705 transitions. [2021-01-06 23:49:51,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:49:51,070 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 12705 transitions. [2021-01-06 23:49:51,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:49:51,074 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:49:51,074 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] [2021-01-06 23:49:51,075 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 23:49:51,075 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:49:51,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:49:51,075 INFO L82 PathProgramCache]: Analyzing trace with hash -948485079, now seen corresponding path program 6 times [2021-01-06 23:49:51,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:49:51,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068672928] [2021-01-06 23:49:51,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:49:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:49:51,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:49:51,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068672928] [2021-01-06 23:49:51,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:49:51,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:49:51,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760849516] [2021-01-06 23:49:51,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:49:51,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:49:51,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:49:51,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:49:51,672 INFO L87 Difference]: Start difference. First operand 3981 states and 12705 transitions. Second operand 15 states. [2021-01-06 23:49:52,909 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2021-01-06 23:49:55,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:49:55,288 INFO L93 Difference]: Finished difference Result 7034 states and 22897 transitions. [2021-01-06 23:49:55,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 23:49:55,289 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2021-01-06 23:49:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:49:55,304 INFO L225 Difference]: With dead ends: 7034 [2021-01-06 23:49:55,304 INFO L226 Difference]: Without dead ends: 7034 [2021-01-06 23:49:55,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2021-01-06 23:49:55,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7034 states. [2021-01-06 23:49:55,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7034 to 4716. [2021-01-06 23:49:55,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4716 states. [2021-01-06 23:49:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 15188 transitions. [2021-01-06 23:49:55,399 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 15188 transitions. Word has length 27 [2021-01-06 23:49:55,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:49:55,400 INFO L481 AbstractCegarLoop]: Abstraction has 4716 states and 15188 transitions. [2021-01-06 23:49:55,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:49:55,400 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 15188 transitions. [2021-01-06 23:49:55,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:49:55,405 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:49:55,405 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] [2021-01-06 23:49:55,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 23:49:55,405 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:49:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:49:55,405 INFO L82 PathProgramCache]: Analyzing trace with hash -948485078, now seen corresponding path program 4 times [2021-01-06 23:49:55,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:49:55,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791347308] [2021-01-06 23:49:55,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:49:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:49:56,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:49:56,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791347308] [2021-01-06 23:49:56,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:49:56,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-01-06 23:49:56,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463061419] [2021-01-06 23:49:56,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 23:49:56,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:49:56,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 23:49:56,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-01-06 23:49:56,084 INFO L87 Difference]: Start difference. First operand 4716 states and 15188 transitions. Second operand 15 states. [2021-01-06 23:49:57,287 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2021-01-06 23:49:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:49:59,576 INFO L93 Difference]: Finished difference Result 7034 states and 22777 transitions. [2021-01-06 23:49:59,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 23:49:59,577 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2021-01-06 23:49:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:49:59,589 INFO L225 Difference]: With dead ends: 7034 [2021-01-06 23:49:59,590 INFO L226 Difference]: Without dead ends: 7034 [2021-01-06 23:49:59,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2021-01-06 23:49:59,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7034 states. [2021-01-06 23:49:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7034 to 4026. [2021-01-06 23:49:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4026 states. [2021-01-06 23:49:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4026 states to 4026 states and 12850 transitions. [2021-01-06 23:49:59,682 INFO L78 Accepts]: Start accepts. Automaton has 4026 states and 12850 transitions. Word has length 27 [2021-01-06 23:49:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:49:59,682 INFO L481 AbstractCegarLoop]: Abstraction has 4026 states and 12850 transitions. [2021-01-06 23:49:59,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 23:49:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 4026 states and 12850 transitions. [2021-01-06 23:49:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:49:59,686 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:49:59,687 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] [2021-01-06 23:49:59,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 23:49:59,687 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:49:59,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:49:59,687 INFO L82 PathProgramCache]: Analyzing trace with hash 778825004, now seen corresponding path program 2 times [2021-01-06 23:49:59,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:49:59,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446664924] [2021-01-06 23:49:59,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:49:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:50:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:50:00,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446664924] [2021-01-06 23:50:00,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:50:00,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:50:00,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240289529] [2021-01-06 23:50:00,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:50:00,528 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:50:00,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:50:00,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:50:00,529 INFO L87 Difference]: Start difference. First operand 4026 states and 12850 transitions. Second operand 16 states. [2021-01-06 23:50:01,248 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2021-01-06 23:50:01,534 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2021-01-06 23:50:02,020 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2021-01-06 23:50:02,410 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2021-01-06 23:50:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:50:05,056 INFO L93 Difference]: Finished difference Result 6170 states and 19805 transitions. [2021-01-06 23:50:05,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 23:50:05,057 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2021-01-06 23:50:05,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:50:05,068 INFO L225 Difference]: With dead ends: 6170 [2021-01-06 23:50:05,069 INFO L226 Difference]: Without dead ends: 6170 [2021-01-06 23:50:05,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2021-01-06 23:50:05,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6170 states. [2021-01-06 23:50:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6170 to 3960. [2021-01-06 23:50:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2021-01-06 23:50:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 12652 transitions. [2021-01-06 23:50:05,151 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 12652 transitions. Word has length 27 [2021-01-06 23:50:05,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:50:05,152 INFO L481 AbstractCegarLoop]: Abstraction has 3960 states and 12652 transitions. [2021-01-06 23:50:05,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:50:05,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 12652 transitions. [2021-01-06 23:50:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:50:05,156 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:50:05,156 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] [2021-01-06 23:50:05,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 23:50:05,156 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:50:05,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:50:05,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1179430206, now seen corresponding path program 3 times [2021-01-06 23:50:05,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:50:05,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892880792] [2021-01-06 23:50:05,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:50:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:50:05,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:50:05,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892880792] [2021-01-06 23:50:05,974 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:50:05,974 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:50:05,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629199984] [2021-01-06 23:50:05,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:50:05,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:50:05,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:50:05,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:50:05,975 INFO L87 Difference]: Start difference. First operand 3960 states and 12652 transitions. Second operand 16 states. [2021-01-06 23:50:06,469 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2021-01-06 23:50:06,712 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2021-01-06 23:50:07,030 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2021-01-06 23:50:07,493 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2021-01-06 23:50:07,859 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2021-01-06 23:50:10,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:50:10,229 INFO L93 Difference]: Finished difference Result 6050 states and 19445 transitions. [2021-01-06 23:50:10,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 23:50:10,230 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2021-01-06 23:50:10,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:50:10,241 INFO L225 Difference]: With dead ends: 6050 [2021-01-06 23:50:10,241 INFO L226 Difference]: Without dead ends: 6050 [2021-01-06 23:50:10,242 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2021-01-06 23:50:10,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2021-01-06 23:50:10,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3960. [2021-01-06 23:50:10,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2021-01-06 23:50:10,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 12652 transitions. [2021-01-06 23:50:10,333 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 12652 transitions. Word has length 27 [2021-01-06 23:50:10,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:50:10,333 INFO L481 AbstractCegarLoop]: Abstraction has 3960 states and 12652 transitions. [2021-01-06 23:50:10,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:50:10,333 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 12652 transitions. [2021-01-06 23:50:10,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:50:10,338 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:50:10,338 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] [2021-01-06 23:50:10,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 23:50:10,338 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:50:10,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:50:10,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1728350242, now seen corresponding path program 4 times [2021-01-06 23:50:10,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:50:10,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566107773] [2021-01-06 23:50:10,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:50:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:50:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:50:11,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566107773] [2021-01-06 23:50:11,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:50:11,096 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:50:11,096 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814944608] [2021-01-06 23:50:11,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:50:11,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:50:11,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:50:11,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:50:11,097 INFO L87 Difference]: Start difference. First operand 3960 states and 12652 transitions. Second operand 16 states. [2021-01-06 23:50:11,567 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2021-01-06 23:50:11,793 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2021-01-06 23:50:12,149 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2021-01-06 23:50:12,443 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2021-01-06 23:50:12,791 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2021-01-06 23:50:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:50:15,368 INFO L93 Difference]: Finished difference Result 5690 states and 18485 transitions. [2021-01-06 23:50:15,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 23:50:15,374 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2021-01-06 23:50:15,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:50:15,384 INFO L225 Difference]: With dead ends: 5690 [2021-01-06 23:50:15,385 INFO L226 Difference]: Without dead ends: 5690 [2021-01-06 23:50:15,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2021-01-06 23:50:15,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2021-01-06 23:50:15,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 4850. [2021-01-06 23:50:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4850 states. [2021-01-06 23:50:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4850 states to 4850 states and 15610 transitions. [2021-01-06 23:50:15,464 INFO L78 Accepts]: Start accepts. Automaton has 4850 states and 15610 transitions. Word has length 27 [2021-01-06 23:50:15,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:50:15,464 INFO L481 AbstractCegarLoop]: Abstraction has 4850 states and 15610 transitions. [2021-01-06 23:50:15,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:50:15,464 INFO L276 IsEmpty]: Start isEmpty. Operand 4850 states and 15610 transitions. [2021-01-06 23:50:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:50:15,470 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:50:15,470 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] [2021-01-06 23:50:15,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 23:50:15,470 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:50:15,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:50:15,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1728350241, now seen corresponding path program 1 times [2021-01-06 23:50:15,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:50:15,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002991580] [2021-01-06 23:50:15,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:50:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:50:16,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:50:16,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002991580] [2021-01-06 23:50:16,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:50:16,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:50:16,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689688670] [2021-01-06 23:50:16,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:50:16,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:50:16,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:50:16,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:50:16,271 INFO L87 Difference]: Start difference. First operand 4850 states and 15610 transitions. Second operand 16 states. [2021-01-06 23:50:16,914 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2021-01-06 23:50:17,256 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2021-01-06 23:50:17,543 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2021-01-06 23:50:17,873 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2021-01-06 23:50:20,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:50:20,128 INFO L93 Difference]: Finished difference Result 5690 states and 18365 transitions. [2021-01-06 23:50:20,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 23:50:20,129 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2021-01-06 23:50:20,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:50:20,139 INFO L225 Difference]: With dead ends: 5690 [2021-01-06 23:50:20,139 INFO L226 Difference]: Without dead ends: 5690 [2021-01-06 23:50:20,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2021-01-06 23:50:20,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2021-01-06 23:50:20,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 3960. [2021-01-06 23:50:20,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2021-01-06 23:50:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 12652 transitions. [2021-01-06 23:50:20,205 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 12652 transitions. Word has length 27 [2021-01-06 23:50:20,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:50:20,206 INFO L481 AbstractCegarLoop]: Abstraction has 3960 states and 12652 transitions. [2021-01-06 23:50:20,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:50:20,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 12652 transitions. [2021-01-06 23:50:20,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:50:20,209 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:50:20,210 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] [2021-01-06 23:50:20,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 23:50:20,210 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:50:20,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:50:20,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1445894704, now seen corresponding path program 5 times [2021-01-06 23:50:20,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:50:20,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694340301] [2021-01-06 23:50:20,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:50:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:50:20,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:50:20,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694340301] [2021-01-06 23:50:20,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:50:20,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:50:20,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572826846] [2021-01-06 23:50:20,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:50:20,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:50:20,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:50:20,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:50:20,857 INFO L87 Difference]: Start difference. First operand 3960 states and 12652 transitions. Second operand 16 states. [2021-01-06 23:50:21,472 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2021-01-06 23:50:21,807 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2021-01-06 23:50:22,103 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2021-01-06 23:50:22,440 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2021-01-06 23:50:25,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:50:25,066 INFO L93 Difference]: Finished difference Result 5630 states and 18305 transitions. [2021-01-06 23:50:25,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 23:50:25,067 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2021-01-06 23:50:25,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:50:25,078 INFO L225 Difference]: With dead ends: 5630 [2021-01-06 23:50:25,078 INFO L226 Difference]: Without dead ends: 5630 [2021-01-06 23:50:25,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2021-01-06 23:50:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2021-01-06 23:50:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 4790. [2021-01-06 23:50:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4790 states. [2021-01-06 23:50:25,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 15430 transitions. [2021-01-06 23:50:25,164 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 15430 transitions. Word has length 27 [2021-01-06 23:50:25,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:50:25,164 INFO L481 AbstractCegarLoop]: Abstraction has 4790 states and 15430 transitions. [2021-01-06 23:50:25,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:50:25,165 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 15430 transitions. [2021-01-06 23:50:25,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:50:25,172 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:50:25,172 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] [2021-01-06 23:50:25,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 23:50:25,172 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:50:25,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:50:25,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1445894703, now seen corresponding path program 2 times [2021-01-06 23:50:25,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:50:25,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384329847] [2021-01-06 23:50:25,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:50:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:50:25,762 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 30 [2021-01-06 23:50:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:50:26,099 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384329847] [2021-01-06 23:50:26,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:50:26,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:50:26,100 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583980973] [2021-01-06 23:50:26,100 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:50:26,100 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:50:26,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:50:26,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:50:26,100 INFO L87 Difference]: Start difference. First operand 4790 states and 15430 transitions. Second operand 16 states. [2021-01-06 23:50:26,663 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2021-01-06 23:50:26,912 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2021-01-06 23:50:27,325 WARN L197 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2021-01-06 23:50:27,659 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 44 [2021-01-06 23:50:28,026 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2021-01-06 23:50:30,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:50:30,830 INFO L93 Difference]: Finished difference Result 5630 states and 18185 transitions. [2021-01-06 23:50:30,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 23:50:30,831 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2021-01-06 23:50:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:50:30,841 INFO L225 Difference]: With dead ends: 5630 [2021-01-06 23:50:30,842 INFO L226 Difference]: Without dead ends: 5630 [2021-01-06 23:50:30,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2021-01-06 23:50:30,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2021-01-06 23:50:30,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 3960. [2021-01-06 23:50:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2021-01-06 23:50:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 12652 transitions. [2021-01-06 23:50:30,919 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 12652 transitions. Word has length 27 [2021-01-06 23:50:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:50:30,919 INFO L481 AbstractCegarLoop]: Abstraction has 3960 states and 12652 transitions. [2021-01-06 23:50:30,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:50:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 12652 transitions. [2021-01-06 23:50:30,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:50:30,923 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:50:30,923 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] [2021-01-06 23:50:30,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 23:50:30,923 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:50:30,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:50:30,924 INFO L82 PathProgramCache]: Analyzing trace with hash -774061944, now seen corresponding path program 6 times [2021-01-06 23:50:30,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:50:30,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652455321] [2021-01-06 23:50:30,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:50:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:50:31,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:50:31,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652455321] [2021-01-06 23:50:31,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:50:31,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:50:31,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325006838] [2021-01-06 23:50:31,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:50:31,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:50:31,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:50:31,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:50:31,588 INFO L87 Difference]: Start difference. First operand 3960 states and 12652 transitions. Second operand 16 states. [2021-01-06 23:50:32,094 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2021-01-06 23:50:32,315 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2021-01-06 23:50:32,690 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2021-01-06 23:50:32,990 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2021-01-06 23:50:33,315 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2021-01-06 23:50:36,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:50:36,163 INFO L93 Difference]: Finished difference Result 7643 states and 25009 transitions. [2021-01-06 23:50:36,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 23:50:36,164 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2021-01-06 23:50:36,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:50:36,178 INFO L225 Difference]: With dead ends: 7643 [2021-01-06 23:50:36,178 INFO L226 Difference]: Without dead ends: 7643 [2021-01-06 23:50:36,178 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2021-01-06 23:50:36,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7643 states. [2021-01-06 23:50:36,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7643 to 4695. [2021-01-06 23:50:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4695 states. [2021-01-06 23:50:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4695 states to 4695 states and 15135 transitions. [2021-01-06 23:50:36,272 INFO L78 Accepts]: Start accepts. Automaton has 4695 states and 15135 transitions. Word has length 27 [2021-01-06 23:50:36,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:50:36,272 INFO L481 AbstractCegarLoop]: Abstraction has 4695 states and 15135 transitions. [2021-01-06 23:50:36,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:50:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4695 states and 15135 transitions. [2021-01-06 23:50:36,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:50:36,277 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:50:36,277 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] [2021-01-06 23:50:36,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 23:50:36,277 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:50:36,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:50:36,278 INFO L82 PathProgramCache]: Analyzing trace with hash -774061943, now seen corresponding path program 3 times [2021-01-06 23:50:36,278 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:50:36,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991641377] [2021-01-06 23:50:36,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:50:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:50:36,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:50:36,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991641377] [2021-01-06 23:50:36,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:50:36,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:50:36,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585872880] [2021-01-06 23:50:36,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:50:36,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:50:36,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:50:36,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:50:36,939 INFO L87 Difference]: Start difference. First operand 4695 states and 15135 transitions. Second operand 16 states. [2021-01-06 23:50:37,495 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2021-01-06 23:50:37,729 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2021-01-06 23:50:38,107 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2021-01-06 23:50:38,409 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2021-01-06 23:50:38,727 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2021-01-06 23:50:41,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:50:41,506 INFO L93 Difference]: Finished difference Result 7643 states and 24889 transitions. [2021-01-06 23:50:41,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 23:50:41,507 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2021-01-06 23:50:41,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:50:41,521 INFO L225 Difference]: With dead ends: 7643 [2021-01-06 23:50:41,522 INFO L226 Difference]: Without dead ends: 7643 [2021-01-06 23:50:41,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2021-01-06 23:50:41,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7643 states. [2021-01-06 23:50:41,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7643 to 3966. [2021-01-06 23:50:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3966 states. [2021-01-06 23:50:41,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 12671 transitions. [2021-01-06 23:50:41,638 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 12671 transitions. Word has length 27 [2021-01-06 23:50:41,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:50:41,638 INFO L481 AbstractCegarLoop]: Abstraction has 3966 states and 12671 transitions. [2021-01-06 23:50:41,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:50:41,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 12671 transitions. [2021-01-06 23:50:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-06 23:50:41,642 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:50:41,642 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] [2021-01-06 23:50:41,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 23:50:41,643 INFO L429 AbstractCegarLoop]: === Iteration 37 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:50:41,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:50:41,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1169258132, now seen corresponding path program 7 times [2021-01-06 23:50:41,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:50:41,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477830373] [2021-01-06 23:50:41,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:50:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:50:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:50:42,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477830373] [2021-01-06 23:50:42,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:50:42,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-01-06 23:50:42,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829831252] [2021-01-06 23:50:42,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-06 23:50:42,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:50:42,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-06 23:50:42,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2021-01-06 23:50:42,550 INFO L87 Difference]: Start difference. First operand 3966 states and 12671 transitions. Second operand 16 states. [2021-01-06 23:50:43,243 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2021-01-06 23:50:43,534 WARN L197 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2021-01-06 23:50:44,062 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2021-01-06 23:50:44,425 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2021-01-06 23:50:46,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:50:46,823 INFO L93 Difference]: Finished difference Result 5496 states and 17764 transitions. [2021-01-06 23:50:46,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 23:50:46,828 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2021-01-06 23:50:46,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:50:46,843 INFO L225 Difference]: With dead ends: 5496 [2021-01-06 23:50:46,844 INFO L226 Difference]: Without dead ends: 5496 [2021-01-06 23:50:46,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2021-01-06 23:50:46,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5496 states. [2021-01-06 23:50:46,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5496 to 3466. [2021-01-06 23:50:46,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3466 states. [2021-01-06 23:50:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3466 states to 3466 states and 11151 transitions. [2021-01-06 23:50:46,907 INFO L78 Accepts]: Start accepts. Automaton has 3466 states and 11151 transitions. Word has length 27 [2021-01-06 23:50:46,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:50:46,907 INFO L481 AbstractCegarLoop]: Abstraction has 3466 states and 11151 transitions. [2021-01-06 23:50:46,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-06 23:50:46,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3466 states and 11151 transitions. [2021-01-06 23:50:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 23:50:46,910 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:50:46,910 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, 1, 1, 1] [2021-01-06 23:50:46,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 23:50:46,910 INFO L429 AbstractCegarLoop]: === Iteration 38 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:50:46,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:50:46,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1277136462, now seen corresponding path program 1 times [2021-01-06 23:50:46,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:50:46,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126226073] [2021-01-06 23:50:46,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:50:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:50:47,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:50:47,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126226073] [2021-01-06 23:50:47,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:50:47,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 23:50:47,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413053224] [2021-01-06 23:50:47,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 23:50:47,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:50:47,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 23:50:47,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-01-06 23:50:47,353 INFO L87 Difference]: Start difference. First operand 3466 states and 11151 transitions. Second operand 12 states. [2021-01-06 23:50:49,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:50:49,253 INFO L93 Difference]: Finished difference Result 10274 states and 33203 transitions. [2021-01-06 23:50:49,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 23:50:49,254 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2021-01-06 23:50:49,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:50:49,272 INFO L225 Difference]: With dead ends: 10274 [2021-01-06 23:50:49,275 INFO L226 Difference]: Without dead ends: 10274 [2021-01-06 23:50:49,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:50:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10274 states. [2021-01-06 23:50:49,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10274 to 7747. [2021-01-06 23:50:49,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7747 states. [2021-01-06 23:50:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7747 states to 7747 states and 25730 transitions. [2021-01-06 23:50:49,438 INFO L78 Accepts]: Start accepts. Automaton has 7747 states and 25730 transitions. Word has length 30 [2021-01-06 23:50:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:50:49,438 INFO L481 AbstractCegarLoop]: Abstraction has 7747 states and 25730 transitions. [2021-01-06 23:50:49,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 23:50:49,439 INFO L276 IsEmpty]: Start isEmpty. Operand 7747 states and 25730 transitions. [2021-01-06 23:50:49,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 23:50:49,446 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:50:49,446 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, 1, 1, 1] [2021-01-06 23:50:49,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 23:50:49,446 INFO L429 AbstractCegarLoop]: === Iteration 39 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:50:49,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:50:49,446 INFO L82 PathProgramCache]: Analyzing trace with hash 393782995, now seen corresponding path program 1 times [2021-01-06 23:50:49,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:50:49,447 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949852969] [2021-01-06 23:50:49,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:50:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:50:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:50:49,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949852969] [2021-01-06 23:50:49,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:50:49,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 23:50:49,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792709378] [2021-01-06 23:50:49,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 23:50:49,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:50:49,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 23:50:49,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2021-01-06 23:50:49,907 INFO L87 Difference]: Start difference. First operand 7747 states and 25730 transitions. Second operand 13 states. [2021-01-06 23:50:51,497 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2021-01-06 23:50:52,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:50:52,633 INFO L93 Difference]: Finished difference Result 15340 states and 50453 transitions. [2021-01-06 23:50:52,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 23:50:52,634 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2021-01-06 23:50:52,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:50:52,666 INFO L225 Difference]: With dead ends: 15340 [2021-01-06 23:50:52,666 INFO L226 Difference]: Without dead ends: 15340 [2021-01-06 23:50:52,666 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2021-01-06 23:50:52,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15340 states. [2021-01-06 23:50:52,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15340 to 10253. [2021-01-06 23:50:52,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10253 states. [2021-01-06 23:50:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10253 states to 10253 states and 34150 transitions. [2021-01-06 23:50:52,873 INFO L78 Accepts]: Start accepts. Automaton has 10253 states and 34150 transitions. Word has length 30 [2021-01-06 23:50:52,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:50:52,874 INFO L481 AbstractCegarLoop]: Abstraction has 10253 states and 34150 transitions. [2021-01-06 23:50:52,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 23:50:52,874 INFO L276 IsEmpty]: Start isEmpty. Operand 10253 states and 34150 transitions. [2021-01-06 23:50:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 23:50:52,890 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:50:52,890 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, 1, 1, 1] [2021-01-06 23:50:52,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 23:50:52,890 INFO L429 AbstractCegarLoop]: === Iteration 40 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:50:52,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:50:52,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1198627466, now seen corresponding path program 2 times [2021-01-06 23:50:52,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:50:52,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809472789] [2021-01-06 23:50:52,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:50:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:50:53,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:50:53,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809472789] [2021-01-06 23:50:53,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:50:53,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 23:50:53,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326692420] [2021-01-06 23:50:53,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 23:50:53,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:50:53,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 23:50:53,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-01-06 23:50:53,344 INFO L87 Difference]: Start difference. First operand 10253 states and 34150 transitions. Second operand 12 states. [2021-01-06 23:50:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:50:56,715 INFO L93 Difference]: Finished difference Result 19078 states and 63416 transitions. [2021-01-06 23:50:56,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 23:50:56,716 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2021-01-06 23:50:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:50:56,753 INFO L225 Difference]: With dead ends: 19078 [2021-01-06 23:50:56,754 INFO L226 Difference]: Without dead ends: 19078 [2021-01-06 23:50:56,754 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2021-01-06 23:50:56,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2021-01-06 23:50:57,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 10881. [2021-01-06 23:50:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10881 states. [2021-01-06 23:50:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10881 states to 10881 states and 36512 transitions. [2021-01-06 23:50:57,078 INFO L78 Accepts]: Start accepts. Automaton has 10881 states and 36512 transitions. Word has length 30 [2021-01-06 23:50:57,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:50:57,079 INFO L481 AbstractCegarLoop]: Abstraction has 10881 states and 36512 transitions. [2021-01-06 23:50:57,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 23:50:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 10881 states and 36512 transitions. [2021-01-06 23:50:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 23:50:57,095 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:50:57,095 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, 1, 1, 1] [2021-01-06 23:50:57,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 23:50:57,096 INFO L429 AbstractCegarLoop]: === Iteration 41 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:50:57,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:50:57,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1286895244, now seen corresponding path program 3 times [2021-01-06 23:50:57,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:50:57,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203095162] [2021-01-06 23:50:57,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:50:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:50:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:50:57,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203095162] [2021-01-06 23:50:57,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:50:57,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-06 23:50:57,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652499567] [2021-01-06 23:50:57,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 23:50:57,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:50:57,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 23:50:57,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-01-06 23:50:57,499 INFO L87 Difference]: Start difference. First operand 10881 states and 36512 transitions. Second operand 12 states. [2021-01-06 23:51:00,278 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2021-01-06 23:51:01,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:51:01,253 INFO L93 Difference]: Finished difference Result 19831 states and 65965 transitions. [2021-01-06 23:51:01,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-06 23:51:01,254 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2021-01-06 23:51:01,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:51:01,293 INFO L225 Difference]: With dead ends: 19831 [2021-01-06 23:51:01,293 INFO L226 Difference]: Without dead ends: 19831 [2021-01-06 23:51:01,293 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2021-01-06 23:51:01,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19831 states. [2021-01-06 23:51:01,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19831 to 9729. [2021-01-06 23:51:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9729 states. [2021-01-06 23:51:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9729 states to 9729 states and 32472 transitions. [2021-01-06 23:51:01,518 INFO L78 Accepts]: Start accepts. Automaton has 9729 states and 32472 transitions. Word has length 30 [2021-01-06 23:51:01,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:51:01,518 INFO L481 AbstractCegarLoop]: Abstraction has 9729 states and 32472 transitions. [2021-01-06 23:51:01,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 23:51:01,518 INFO L276 IsEmpty]: Start isEmpty. Operand 9729 states and 32472 transitions. [2021-01-06 23:51:01,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 23:51:01,532 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:51:01,532 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, 1, 1, 1] [2021-01-06 23:51:01,532 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 23:51:01,532 INFO L429 AbstractCegarLoop]: === Iteration 42 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:51:01,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:51:01,532 INFO L82 PathProgramCache]: Analyzing trace with hash 562314729, now seen corresponding path program 2 times [2021-01-06 23:51:01,533 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:51:01,533 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921420337] [2021-01-06 23:51:01,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:51:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:51:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:51:01,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921420337] [2021-01-06 23:51:01,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:51:01,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 23:51:01,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461707016] [2021-01-06 23:51:01,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 23:51:01,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:51:01,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 23:51:01,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-01-06 23:51:01,986 INFO L87 Difference]: Start difference. First operand 9729 states and 32472 transitions. Second operand 13 states. [2021-01-06 23:51:06,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:51:06,302 INFO L93 Difference]: Finished difference Result 16868 states and 55552 transitions. [2021-01-06 23:51:06,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-01-06 23:51:06,303 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2021-01-06 23:51:06,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:51:06,336 INFO L225 Difference]: With dead ends: 16868 [2021-01-06 23:51:06,336 INFO L226 Difference]: Without dead ends: 16868 [2021-01-06 23:51:06,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=275, Invalid=717, Unknown=0, NotChecked=0, Total=992 [2021-01-06 23:51:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16868 states. [2021-01-06 23:51:06,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16868 to 9849. [2021-01-06 23:51:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9849 states. [2021-01-06 23:51:06,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 32878 transitions. [2021-01-06 23:51:06,644 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 32878 transitions. Word has length 30 [2021-01-06 23:51:06,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:51:06,644 INFO L481 AbstractCegarLoop]: Abstraction has 9849 states and 32878 transitions. [2021-01-06 23:51:06,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 23:51:06,645 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 32878 transitions. [2021-01-06 23:51:06,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 23:51:06,658 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:51:06,658 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, 1, 1, 1] [2021-01-06 23:51:06,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-06 23:51:06,659 INFO L429 AbstractCegarLoop]: === Iteration 43 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:51:06,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:51:06,659 INFO L82 PathProgramCache]: Analyzing trace with hash -722228073, now seen corresponding path program 3 times [2021-01-06 23:51:06,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:51:06,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179840741] [2021-01-06 23:51:06,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:51:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:51:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:51:07,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179840741] [2021-01-06 23:51:07,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:51:07,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 23:51:07,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746665726] [2021-01-06 23:51:07,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 23:51:07,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:51:07,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 23:51:07,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2021-01-06 23:51:07,125 INFO L87 Difference]: Start difference. First operand 9849 states and 32878 transitions. Second operand 13 states. [2021-01-06 23:51:11,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:51:11,406 INFO L93 Difference]: Finished difference Result 18703 states and 61851 transitions. [2021-01-06 23:51:11,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-01-06 23:51:11,407 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2021-01-06 23:51:11,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:51:11,442 INFO L225 Difference]: With dead ends: 18703 [2021-01-06 23:51:11,442 INFO L226 Difference]: Without dead ends: 18703 [2021-01-06 23:51:11,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=319, Invalid=871, Unknown=0, NotChecked=0, Total=1190 [2021-01-06 23:51:11,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18703 states. [2021-01-06 23:51:11,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18703 to 9953. [2021-01-06 23:51:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9953 states. [2021-01-06 23:51:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9953 states to 9953 states and 33250 transitions. [2021-01-06 23:51:11,666 INFO L78 Accepts]: Start accepts. Automaton has 9953 states and 33250 transitions. Word has length 30 [2021-01-06 23:51:11,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:51:11,666 INFO L481 AbstractCegarLoop]: Abstraction has 9953 states and 33250 transitions. [2021-01-06 23:51:11,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 23:51:11,666 INFO L276 IsEmpty]: Start isEmpty. Operand 9953 states and 33250 transitions. [2021-01-06 23:51:11,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 23:51:11,679 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:51:11,679 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, 1, 1, 1] [2021-01-06 23:51:11,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-01-06 23:51:11,679 INFO L429 AbstractCegarLoop]: === Iteration 44 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:51:11,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:51:11,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1184193409, now seen corresponding path program 4 times [2021-01-06 23:51:11,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:51:11,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597628751] [2021-01-06 23:51:11,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:51:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:51:12,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:51:12,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597628751] [2021-01-06 23:51:12,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:51:12,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 23:51:12,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948918776] [2021-01-06 23:51:12,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 23:51:12,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:51:12,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 23:51:12,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-01-06 23:51:12,151 INFO L87 Difference]: Start difference. First operand 9953 states and 33250 transitions. Second operand 13 states. [2021-01-06 23:51:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:51:14,934 INFO L93 Difference]: Finished difference Result 13392 states and 44102 transitions. [2021-01-06 23:51:14,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 23:51:14,935 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2021-01-06 23:51:14,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:51:14,960 INFO L225 Difference]: With dead ends: 13392 [2021-01-06 23:51:14,960 INFO L226 Difference]: Without dead ends: 13392 [2021-01-06 23:51:14,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2021-01-06 23:51:14,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2021-01-06 23:51:15,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 9593. [2021-01-06 23:51:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9593 states. [2021-01-06 23:51:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9593 states to 9593 states and 32170 transitions. [2021-01-06 23:51:15,134 INFO L78 Accepts]: Start accepts. Automaton has 9593 states and 32170 transitions. Word has length 30 [2021-01-06 23:51:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:51:15,135 INFO L481 AbstractCegarLoop]: Abstraction has 9593 states and 32170 transitions. [2021-01-06 23:51:15,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 23:51:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 9593 states and 32170 transitions. [2021-01-06 23:51:15,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 23:51:15,144 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:51:15,145 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, 1, 1, 1] [2021-01-06 23:51:15,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-06 23:51:15,145 INFO L429 AbstractCegarLoop]: === Iteration 45 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:51:15,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:51:15,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1639413206, now seen corresponding path program 4 times [2021-01-06 23:51:15,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:51:15,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245474043] [2021-01-06 23:51:15,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:51:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:51:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:51:15,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245474043] [2021-01-06 23:51:15,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:51:15,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-01-06 23:51:15,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579870889] [2021-01-06 23:51:15,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 23:51:15,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:51:15,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 23:51:15,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-01-06 23:51:15,667 INFO L87 Difference]: Start difference. First operand 9593 states and 32170 transitions. Second operand 13 states. [2021-01-06 23:51:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:51:18,356 INFO L93 Difference]: Finished difference Result 16478 states and 54491 transitions. [2021-01-06 23:51:18,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 23:51:18,357 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2021-01-06 23:51:18,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:51:18,390 INFO L225 Difference]: With dead ends: 16478 [2021-01-06 23:51:18,390 INFO L226 Difference]: Without dead ends: 16478 [2021-01-06 23:51:18,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2021-01-06 23:51:18,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16478 states. [2021-01-06 23:51:18,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16478 to 9309. [2021-01-06 23:51:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9309 states. [2021-01-06 23:51:18,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9309 states to 9309 states and 31271 transitions. [2021-01-06 23:51:18,594 INFO L78 Accepts]: Start accepts. Automaton has 9309 states and 31271 transitions. Word has length 30 [2021-01-06 23:51:18,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:51:18,594 INFO L481 AbstractCegarLoop]: Abstraction has 9309 states and 31271 transitions. [2021-01-06 23:51:18,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 23:51:18,594 INFO L276 IsEmpty]: Start isEmpty. Operand 9309 states and 31271 transitions. [2021-01-06 23:51:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 23:51:18,604 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:51:18,604 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, 1, 1, 1] [2021-01-06 23:51:18,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-01-06 23:51:18,604 INFO L429 AbstractCegarLoop]: === Iteration 46 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:51:18,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:51:18,605 INFO L82 PathProgramCache]: Analyzing trace with hash 756059739, now seen corresponding path program 5 times [2021-01-06 23:51:18,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:51:18,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481684966] [2021-01-06 23:51:18,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:51:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:51:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:51:19,303 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481684966] [2021-01-06 23:51:19,303 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:51:19,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-06 23:51:19,304 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520228365] [2021-01-06 23:51:19,304 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-06 23:51:19,304 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:51:19,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-06 23:51:19,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-01-06 23:51:19,305 INFO L87 Difference]: Start difference. First operand 9309 states and 31271 transitions. Second operand 14 states. [2021-01-06 23:51:20,914 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2021-01-06 23:51:22,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:51:22,526 INFO L93 Difference]: Finished difference Result 14098 states and 46557 transitions. [2021-01-06 23:51:22,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 23:51:22,527 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2021-01-06 23:51:22,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:51:22,561 INFO L225 Difference]: With dead ends: 14098 [2021-01-06 23:51:22,561 INFO L226 Difference]: Without dead ends: 14098 [2021-01-06 23:51:22,562 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2021-01-06 23:51:22,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14098 states. [2021-01-06 23:51:22,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14098 to 8187. [2021-01-06 23:51:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8187 states. [2021-01-06 23:51:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8187 states to 8187 states and 27721 transitions. [2021-01-06 23:51:22,752 INFO L78 Accepts]: Start accepts. Automaton has 8187 states and 27721 transitions. Word has length 30 [2021-01-06 23:51:22,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:51:22,752 INFO L481 AbstractCegarLoop]: Abstraction has 8187 states and 27721 transitions. [2021-01-06 23:51:22,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-06 23:51:22,752 INFO L276 IsEmpty]: Start isEmpty. Operand 8187 states and 27721 transitions. [2021-01-06 23:51:22,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 23:51:22,760 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:51:22,760 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, 1, 1, 1, 1] [2021-01-06 23:51:22,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-01-06 23:51:22,760 INFO L429 AbstractCegarLoop]: === Iteration 47 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:51:22,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:51:22,761 INFO L82 PathProgramCache]: Analyzing trace with hash -105840897, now seen corresponding path program 1 times [2021-01-06 23:51:22,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:51:22,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597851325] [2021-01-06 23:51:22,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:51:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:51:23,888 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 35 [2021-01-06 23:51:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:51:24,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597851325] [2021-01-06 23:51:24,327 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:51:24,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-01-06 23:51:24,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853420954] [2021-01-06 23:51:24,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-06 23:51:24,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:51:24,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-06 23:51:24,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2021-01-06 23:51:24,328 INFO L87 Difference]: Start difference. First operand 8187 states and 27721 transitions. Second operand 22 states. [2021-01-06 23:51:24,814 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 36 [2021-01-06 23:51:25,057 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2021-01-06 23:51:25,363 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2021-01-06 23:51:25,765 WARN L197 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2021-01-06 23:51:26,195 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-01-06 23:51:26,575 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2021-01-06 23:51:26,870 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2021-01-06 23:51:27,297 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2021-01-06 23:51:27,555 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 50 [2021-01-06 23:51:28,091 WARN L197 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 55 [2021-01-06 23:51:28,985 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 59 [2021-01-06 23:51:30,251 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2021-01-06 23:51:30,597 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2021-01-06 23:51:30,847 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2021-01-06 23:51:31,262 WARN L197 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 59 [2021-01-06 23:51:31,549 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2021-01-06 23:51:32,020 WARN L197 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2021-01-06 23:51:32,737 WARN L197 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 63 [2021-01-06 23:51:34,070 WARN L197 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2021-01-06 23:51:34,429 WARN L197 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2021-01-06 23:51:34,898 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2021-01-06 23:51:35,285 WARN L197 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2021-01-06 23:51:35,810 WARN L197 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2021-01-06 23:51:36,189 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2021-01-06 23:51:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:51:37,050 INFO L93 Difference]: Finished difference Result 12500 states and 41816 transitions. [2021-01-06 23:51:37,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-01-06 23:51:37,051 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2021-01-06 23:51:37,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:51:37,077 INFO L225 Difference]: With dead ends: 12500 [2021-01-06 23:51:37,077 INFO L226 Difference]: Without dead ends: 12500 [2021-01-06 23:51:37,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=575, Invalid=2287, Unknown=0, NotChecked=0, Total=2862 [2021-01-06 23:51:37,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12500 states. [2021-01-06 23:51:37,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12500 to 8883. [2021-01-06 23:51:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8883 states. [2021-01-06 23:51:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8883 states to 8883 states and 29995 transitions. [2021-01-06 23:51:37,317 INFO L78 Accepts]: Start accepts. Automaton has 8883 states and 29995 transitions. Word has length 31 [2021-01-06 23:51:37,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:51:37,317 INFO L481 AbstractCegarLoop]: Abstraction has 8883 states and 29995 transitions. [2021-01-06 23:51:37,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-06 23:51:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 8883 states and 29995 transitions. [2021-01-06 23:51:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 23:51:37,326 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:51:37,326 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, 1, 1, 1, 1] [2021-01-06 23:51:37,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-01-06 23:51:37,327 INFO L429 AbstractCegarLoop]: === Iteration 48 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:51:37,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:51:37,327 INFO L82 PathProgramCache]: Analyzing trace with hash -105840896, now seen corresponding path program 1 times [2021-01-06 23:51:37,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:51:37,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052195283] [2021-01-06 23:51:37,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:51:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:51:38,040 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 40 [2021-01-06 23:51:38,268 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2021-01-06 23:51:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:51:38,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052195283] [2021-01-06 23:51:38,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:51:38,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-01-06 23:51:38,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912195091] [2021-01-06 23:51:38,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-06 23:51:38,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:51:38,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-06 23:51:38,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2021-01-06 23:51:38,625 INFO L87 Difference]: Start difference. First operand 8883 states and 29995 transitions. Second operand 19 states. [2021-01-06 23:51:39,411 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2021-01-06 23:51:39,720 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 40 [2021-01-06 23:51:40,129 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2021-01-06 23:51:41,209 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 48 [2021-01-06 23:51:41,817 WARN L197 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 70 [2021-01-06 23:51:42,249 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2021-01-06 23:51:42,630 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2021-01-06 23:51:43,069 WARN L197 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2021-01-06 23:51:43,348 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 47 [2021-01-06 23:51:43,799 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 53 [2021-01-06 23:51:44,295 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2021-01-06 23:51:45,244 WARN L197 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 61 [2021-01-06 23:51:45,811 WARN L197 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 85 [2021-01-06 23:51:46,241 WARN L197 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 79 [2021-01-06 23:51:46,590 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2021-01-06 23:51:47,140 WARN L197 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 78 [2021-01-06 23:51:47,553 WARN L197 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 66 [2021-01-06 23:51:49,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:51:49,709 INFO L93 Difference]: Finished difference Result 11074 states and 37067 transitions. [2021-01-06 23:51:49,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-01-06 23:51:49,710 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2021-01-06 23:51:49,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:51:49,732 INFO L225 Difference]: With dead ends: 11074 [2021-01-06 23:51:49,732 INFO L226 Difference]: Without dead ends: 11074 [2021-01-06 23:51:49,733 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=409, Invalid=1313, Unknown=0, NotChecked=0, Total=1722 [2021-01-06 23:51:49,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11074 states. [2021-01-06 23:51:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11074 to 9225. [2021-01-06 23:51:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9225 states. [2021-01-06 23:51:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9225 states to 9225 states and 31122 transitions. [2021-01-06 23:51:49,913 INFO L78 Accepts]: Start accepts. Automaton has 9225 states and 31122 transitions. Word has length 31 [2021-01-06 23:51:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:51:49,913 INFO L481 AbstractCegarLoop]: Abstraction has 9225 states and 31122 transitions. [2021-01-06 23:51:49,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-06 23:51:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 9225 states and 31122 transitions. [2021-01-06 23:51:49,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-06 23:51:49,923 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:51:49,923 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, 1, 1, 1, 1] [2021-01-06 23:51:49,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-01-06 23:51:49,924 INFO L429 AbstractCegarLoop]: === Iteration 49 === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:51:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:51:49,924 INFO L82 PathProgramCache]: Analyzing trace with hash 765521200, now seen corresponding path program 2 times [2021-01-06 23:51:49,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:51:49,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476220201] [2021-01-06 23:51:49,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:51:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat