/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-dcfa08f [2020-12-23 13:53:45,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 13:53:45,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 13:53:45,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 13:53:45,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 13:53:45,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 13:53:45,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 13:53:45,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 13:53:45,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 13:53:45,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 13:53:45,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 13:53:45,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 13:53:45,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 13:53:45,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 13:53:45,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 13:53:45,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 13:53:45,392 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 13:53:45,393 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 13:53:45,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 13:53:45,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 13:53:45,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 13:53:45,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 13:53:45,409 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 13:53:45,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 13:53:45,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 13:53:45,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 13:53:45,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 13:53:45,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 13:53:45,444 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 13:53:45,445 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 13:53:45,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 13:53:45,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 13:53:45,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 13:53:45,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 13:53:45,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 13:53:45,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 13:53:45,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 13:53:45,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 13:53:45,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 13:53:45,463 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 13:53:45,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 13:53:45,468 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 13:53:45,520 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 13:53:45,520 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 13:53:45,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 13:53:45,523 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 13:53:45,523 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 13:53:45,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 13:53:45,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 13:53:45,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 13:53:45,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 13:53:45,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 13:53:45,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 13:53:45,525 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 13:53:45,525 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 13:53:45,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 13:53:45,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 13:53:45,525 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 13:53:45,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 13:53:45,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 13:53:45,526 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 13:53:45,526 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 13:53:45,527 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 13:53:45,527 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 13:53:45,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 13:53:45,527 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 13:53:45,527 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 13:53:45,528 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 [2020-12-23 13:53:45,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 13:53:46,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 13:53:46,026 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 13:53:46,028 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 13:53:46,029 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 13:53:46,030 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 [2020-12-23 13:53:46,138 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/60009a940/4c7306df37084c80a50e078011062f9c/FLAG22bdda34d [2020-12-23 13:53:46,922 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 13:53:46,923 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-divine/ring_2w1r-2.i [2020-12-23 13:53:46,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/60009a940/4c7306df37084c80a50e078011062f9c/FLAG22bdda34d [2020-12-23 13:53:47,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/60009a940/4c7306df37084c80a50e078011062f9c [2020-12-23 13:53:47,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 13:53:47,161 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 13:53:47,166 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 13:53:47,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 13:53:47,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 13:53:47,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:53:47" (1/1) ... [2020-12-23 13:53:47,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e62d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:47, skipping insertion in model container [2020-12-23 13:53:47,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:53:47" (1/1) ... [2020-12-23 13:53:47,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 13:53:47,270 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 13:53:47,427 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,] [2020-12-23 13:53:47,886 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,] [2020-12-23 13:53:47,894 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] [2020-12-23 13:53:47,895 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,] [2020-12-23 13:53:47,949 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] [2020-12-23 13:53:47,950 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] [2020-12-23 13:53:47,953 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] [2020-12-23 13:53:47,954 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] [2020-12-23 13:53:47,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 13:53:47,980 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 13:53:47,995 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,] [2020-12-23 13:53:48,027 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,] [2020-12-23 13:53:48,028 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] [2020-12-23 13:53:48,029 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,] [2020-12-23 13:53:48,045 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] [2020-12-23 13:53:48,046 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] [2020-12-23 13:53:48,049 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] [2020-12-23 13:53:48,050 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] [2020-12-23 13:53:48,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 13:53:48,312 INFO L208 MainTranslator]: Completed translation [2020-12-23 13:53:48,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:48 WrapperNode [2020-12-23 13:53:48,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 13:53:48,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 13:53:48,317 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 13:53:48,318 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 13:53:48,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:48" (1/1) ... [2020-12-23 13:53:48,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:48" (1/1) ... [2020-12-23 13:53:48,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 13:53:48,429 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 13:53:48,429 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 13:53:48,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 13:53:48,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:48" (1/1) ... [2020-12-23 13:53:48,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:48" (1/1) ... [2020-12-23 13:53:48,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:48" (1/1) ... [2020-12-23 13:53:48,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:48" (1/1) ... [2020-12-23 13:53:48,461 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:48" (1/1) ... [2020-12-23 13:53:48,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:48" (1/1) ... [2020-12-23 13:53:48,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:48" (1/1) ... [2020-12-23 13:53:48,490 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 13:53:48,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 13:53:48,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 13:53:48,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 13:53:48,492 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:48" (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 [2020-12-23 13:53:48,627 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2020-12-23 13:53:48,627 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2020-12-23 13:53:48,628 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2020-12-23 13:53:48,628 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2020-12-23 13:53:48,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 13:53:48,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 13:53:48,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-23 13:53:48,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 13:53:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 13:53:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 13:53:48,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 13:53:48,631 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-23 13:53:49,445 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 13:53:49,447 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2020-12-23 13:53:49,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:53:49 BoogieIcfgContainer [2020-12-23 13:53:49,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 13:53:49,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 13:53:49,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 13:53:49,459 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 13:53:49,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:53:47" (1/3) ... [2020-12-23 13:53:49,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eaac7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:53:49, skipping insertion in model container [2020-12-23 13:53:49,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:53:48" (2/3) ... [2020-12-23 13:53:49,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eaac7ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:53:49, skipping insertion in model container [2020-12-23 13:53:49,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:53:49" (3/3) ... [2020-12-23 13:53:49,467 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-2.i [2020-12-23 13:53:49,475 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-23 13:53:49,476 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 13:53:49,482 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-12-23 13:53:49,483 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-23 13:53:49,558 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,558 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,558 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,558 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,559 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,559 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,559 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,559 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,560 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,560 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,560 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,560 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,561 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,561 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,561 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,561 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,561 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,561 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,562 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,562 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,562 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,562 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,563 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,563 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,563 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,563 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,564 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,564 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,564 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,564 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,565 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,565 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,565 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,565 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,565 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,565 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,566 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,566 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,566 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,566 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,566 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,567 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,567 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,567 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,567 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,568 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,568 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,568 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,568 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,568 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,569 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,569 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,569 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,569 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,569 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,570 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,570 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,570 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,570 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,571 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,571 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,571 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,571 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,571 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,571 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,572 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,572 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,572 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,572 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,572 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,573 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,573 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,573 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,573 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,574 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,574 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,574 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,574 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,574 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,575 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,575 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,575 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,575 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,575 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,575 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,576 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,576 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,576 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,576 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,576 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,577 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,577 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,577 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,577 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,577 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,578 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,578 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,578 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,578 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,578 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,579 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,579 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,579 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,579 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,579 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,580 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,580 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,580 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,580 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,580 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,581 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,581 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,581 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,581 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,582 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,582 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,582 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,582 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,582 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,583 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,583 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,583 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,583 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,583 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,584 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,584 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,584 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,584 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,585 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,585 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,585 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,585 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,585 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,586 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,586 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,586 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,586 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,586 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,586 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,587 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,587 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,587 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,587 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,587 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,588 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,588 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,588 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,588 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,588 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,589 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,589 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,589 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,589 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,589 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,590 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,590 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,590 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,590 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,591 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,591 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,591 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,591 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,591 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,592 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,592 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,592 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,592 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,592 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,593 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,593 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,593 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,593 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,593 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,594 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,594 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,594 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,594 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,594 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,594 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,595 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,595 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,595 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,595 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,595 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,596 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,596 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,596 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,596 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,596 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,596 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,597 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,597 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,597 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,597 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,597 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,598 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,598 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,598 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,598 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,598 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,599 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,599 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,599 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,599 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,599 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,600 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,600 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,600 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,600 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,600 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,601 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,601 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,601 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,601 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,601 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,602 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,602 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,602 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,602 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,602 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,603 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,603 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,603 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,603 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,603 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,604 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,604 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,604 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,604 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,604 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,605 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,605 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,605 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,605 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,605 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,605 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,606 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,606 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,606 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,606 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,606 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,607 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,607 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,607 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,607 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,607 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,608 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,608 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,608 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,608 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,608 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,608 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,609 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,609 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,609 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,609 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,609 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,610 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,610 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,610 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,610 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,610 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,610 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,611 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,611 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,611 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,611 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,611 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,612 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,612 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,612 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,612 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,612 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,613 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,613 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,613 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,613 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,614 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,614 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,614 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,614 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,614 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,615 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,615 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,615 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,615 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,615 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,615 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,616 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,616 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,616 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,616 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,617 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,617 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,617 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,617 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,617 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,617 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,618 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,618 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,618 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,618 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,619 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,619 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,619 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,619 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,619 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,619 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,620 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,620 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,620 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,620 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,620 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,621 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,621 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,621 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,621 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,621 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,621 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,622 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,622 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,622 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,622 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,622 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,623 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,623 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,623 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,623 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,623 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,624 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,624 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,624 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,624 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,624 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,624 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,625 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,625 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,625 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,625 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,625 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,625 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,626 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,626 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,626 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,626 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,626 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,626 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,627 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,627 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,627 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,627 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,627 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,627 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,628 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,628 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,628 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,628 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,628 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,628 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,629 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,629 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,629 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,629 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,629 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,630 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,630 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,630 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,630 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,630 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,630 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,631 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,631 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,631 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,631 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,631 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,631 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,632 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,632 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,632 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,632 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,632 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,632 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,633 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,633 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,633 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,633 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,633 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,633 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,634 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,634 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,634 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,634 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,634 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,634 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,635 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,635 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,635 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,635 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,635 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,636 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,636 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,636 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,636 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,636 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,637 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,637 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,637 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,637 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,637 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,637 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,638 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,638 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,638 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,638 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,638 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,638 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,639 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,639 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,639 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,639 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,639 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,639 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,640 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,640 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,640 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,640 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,640 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,641 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,641 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,641 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,641 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,641 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,642 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,642 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,645 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,646 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,646 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,646 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,646 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,646 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,647 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,647 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,647 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,647 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,647 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,647 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,647 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,648 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,648 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,648 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,648 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,648 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,649 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,649 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,649 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,649 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,649 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,649 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,649 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,650 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,650 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,650 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,650 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,650 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,651 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,651 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,651 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,651 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,651 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,657 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,658 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,658 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,658 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,658 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,658 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,659 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,659 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,659 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,659 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,659 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,659 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,660 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,660 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,660 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,660 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,660 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,661 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:53:49,676 INFO L149 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2020-12-23 13:53:49,699 INFO L253 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-12-23 13:53:49,748 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 13:53:49,748 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 13:53:49,748 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 13:53:49,749 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 13:53:49,749 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 13:53:49,749 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 13:53:49,749 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 13:53:49,749 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 13:53:49,773 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-23 13:53:49,775 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 188 places, 200 transitions, 422 flow [2020-12-23 13:53:49,779 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 188 places, 200 transitions, 422 flow [2020-12-23 13:53:49,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 188 places, 200 transitions, 422 flow [2020-12-23 13:53:49,909 INFO L129 PetriNetUnfolder]: 18/200 cut-off events. [2020-12-23 13:53:49,909 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-12-23 13:53:49,929 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. [2020-12-23 13:53:49,962 INFO L116 LiptonReduction]: Number of co-enabled transitions 15102 [2020-12-23 13:53:55,945 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-12-23 13:53:56,064 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-12-23 13:53:56,206 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-12-23 13:53:56,320 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-12-23 13:53:57,509 WARN L197 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2020-12-23 13:53:57,704 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-12-23 13:53:58,075 WARN L197 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 102 [2020-12-23 13:53:58,248 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2020-12-23 13:53:58,645 WARN L197 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-12-23 13:53:58,890 WARN L197 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-12-23 13:53:59,122 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-12-23 13:53:59,348 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-12-23 13:53:59,371 INFO L131 LiptonReduction]: Checked pairs total: 29380 [2020-12-23 13:53:59,371 INFO L133 LiptonReduction]: Total number of compositions: 172 [2020-12-23 13:53:59,379 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 58 places, 64 transitions, 150 flow [2020-12-23 13:53:59,538 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2096 states. [2020-12-23 13:53:59,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2096 states. [2020-12-23 13:53:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-23 13:53:59,578 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:53:59,578 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:53:59,579 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]=== [2020-12-23 13:53:59,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:53:59,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1939241903, now seen corresponding path program 1 times [2020-12-23 13:53:59,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:53:59,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600254451] [2020-12-23 13:53:59,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:53:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:00,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600254451] [2020-12-23 13:54:00,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:00,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 13:54:00,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230694612] [2020-12-23 13:54:00,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 13:54:00,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:00,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 13:54:00,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:54:00,208 INFO L87 Difference]: Start difference. First operand 2096 states. Second operand 7 states. [2020-12-23 13:54:00,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:00,684 INFO L93 Difference]: Finished difference Result 2085 states and 6715 transitions. [2020-12-23 13:54:00,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 13:54:00,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2020-12-23 13:54:00,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:00,743 INFO L225 Difference]: With dead ends: 2085 [2020-12-23 13:54:00,743 INFO L226 Difference]: Without dead ends: 1969 [2020-12-23 13:54:00,744 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-12-23 13:54:00,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2020-12-23 13:54:00,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2020-12-23 13:54:00,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2020-12-23 13:54:00,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 6383 transitions. [2020-12-23 13:54:00,994 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 6383 transitions. Word has length 17 [2020-12-23 13:54:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:00,994 INFO L481 AbstractCegarLoop]: Abstraction has 1969 states and 6383 transitions. [2020-12-23 13:54:00,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 13:54:00,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 6383 transitions. [2020-12-23 13:54:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-23 13:54:01,000 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:01,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:01,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 13:54:01,001 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]=== [2020-12-23 13:54:01,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:01,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1330449573, now seen corresponding path program 1 times [2020-12-23 13:54:01,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:01,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552705339] [2020-12-23 13:54:01,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:01,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552705339] [2020-12-23 13:54:01,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:01,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 13:54:01,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407564952] [2020-12-23 13:54:01,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 13:54:01,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:01,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 13:54:01,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 13:54:01,241 INFO L87 Difference]: Start difference. First operand 1969 states and 6383 transitions. Second operand 8 states. [2020-12-23 13:54:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:02,022 INFO L93 Difference]: Finished difference Result 3414 states and 11077 transitions. [2020-12-23 13:54:02,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 13:54:02,023 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-12-23 13:54:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:02,053 INFO L225 Difference]: With dead ends: 3414 [2020-12-23 13:54:02,053 INFO L226 Difference]: Without dead ends: 3234 [2020-12-23 13:54:02,054 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 [2020-12-23 13:54:02,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3234 states. [2020-12-23 13:54:02,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3234 to 2506. [2020-12-23 13:54:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2020-12-23 13:54:02,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 8138 transitions. [2020-12-23 13:54:02,242 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 8138 transitions. Word has length 18 [2020-12-23 13:54:02,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:02,243 INFO L481 AbstractCegarLoop]: Abstraction has 2506 states and 8138 transitions. [2020-12-23 13:54:02,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 13:54:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 8138 transitions. [2020-12-23 13:54:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-23 13:54:02,249 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:02,249 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:02,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 13:54:02,249 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]=== [2020-12-23 13:54:02,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:02,250 INFO L82 PathProgramCache]: Analyzing trace with hash 588258613, now seen corresponding path program 2 times [2020-12-23 13:54:02,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:02,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229680688] [2020-12-23 13:54:02,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:02,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229680688] [2020-12-23 13:54:02,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:02,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 13:54:02,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429854134] [2020-12-23 13:54:02,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 13:54:02,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:02,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 13:54:02,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-12-23 13:54:02,509 INFO L87 Difference]: Start difference. First operand 2506 states and 8138 transitions. Second operand 8 states. [2020-12-23 13:54:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:03,296 INFO L93 Difference]: Finished difference Result 3423 states and 11147 transitions. [2020-12-23 13:54:03,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 13:54:03,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-12-23 13:54:03,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:03,329 INFO L225 Difference]: With dead ends: 3423 [2020-12-23 13:54:03,329 INFO L226 Difference]: Without dead ends: 3247 [2020-12-23 13:54:03,330 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 [2020-12-23 13:54:03,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2020-12-23 13:54:03,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2545. [2020-12-23 13:54:03,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2545 states. [2020-12-23 13:54:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 8321 transitions. [2020-12-23 13:54:03,514 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 8321 transitions. Word has length 18 [2020-12-23 13:54:03,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:03,514 INFO L481 AbstractCegarLoop]: Abstraction has 2545 states and 8321 transitions. [2020-12-23 13:54:03,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 13:54:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 8321 transitions. [2020-12-23 13:54:03,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-23 13:54:03,520 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:03,520 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:03,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 13:54:03,520 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]=== [2020-12-23 13:54:03,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:03,524 INFO L82 PathProgramCache]: Analyzing trace with hash 848973395, now seen corresponding path program 3 times [2020-12-23 13:54:03,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:03,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823899943] [2020-12-23 13:54:03,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:03,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823899943] [2020-12-23 13:54:03,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:03,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 13:54:03,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755068234] [2020-12-23 13:54:03,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 13:54:03,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:03,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 13:54:03,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-23 13:54:03,805 INFO L87 Difference]: Start difference. First operand 2545 states and 8321 transitions. Second operand 8 states. [2020-12-23 13:54:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:04,419 INFO L93 Difference]: Finished difference Result 2651 states and 8539 transitions. [2020-12-23 13:54:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 13:54:04,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-12-23 13:54:04,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:04,442 INFO L225 Difference]: With dead ends: 2651 [2020-12-23 13:54:04,442 INFO L226 Difference]: Without dead ends: 2510 [2020-12-23 13:54:04,442 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 [2020-12-23 13:54:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2510 states. [2020-12-23 13:54:04,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2510 to 2461. [2020-12-23 13:54:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2461 states. [2020-12-23 13:54:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 8022 transitions. [2020-12-23 13:54:04,544 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 8022 transitions. Word has length 18 [2020-12-23 13:54:04,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:04,545 INFO L481 AbstractCegarLoop]: Abstraction has 2461 states and 8022 transitions. [2020-12-23 13:54:04,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 13:54:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 8022 transitions. [2020-12-23 13:54:04,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:04,551 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:04,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] [2020-12-23 13:54:04,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 13:54:04,552 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]=== [2020-12-23 13:54:04,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:04,552 INFO L82 PathProgramCache]: Analyzing trace with hash 197324648, now seen corresponding path program 1 times [2020-12-23 13:54:04,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:04,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301975361] [2020-12-23 13:54:04,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:04,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:04,999 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301975361] [2020-12-23 13:54:04,999 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:04,999 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:54:05,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159324047] [2020-12-23 13:54:05,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 13:54:05,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:05,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 13:54:05,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-12-23 13:54:05,002 INFO L87 Difference]: Start difference. First operand 2461 states and 8022 transitions. Second operand 14 states. [2020-12-23 13:54:06,431 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2020-12-23 13:54:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:07,327 INFO L93 Difference]: Finished difference Result 3016 states and 9709 transitions. [2020-12-23 13:54:07,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 13:54:07,328 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-12-23 13:54:07,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:07,355 INFO L225 Difference]: With dead ends: 3016 [2020-12-23 13:54:07,356 INFO L226 Difference]: Without dead ends: 2941 [2020-12-23 13:54:07,356 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2020-12-23 13:54:07,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2941 states. [2020-12-23 13:54:07,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2832. [2020-12-23 13:54:07,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2832 states. [2020-12-23 13:54:07,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 9248 transitions. [2020-12-23 13:54:07,473 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 9248 transitions. Word has length 25 [2020-12-23 13:54:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:07,475 INFO L481 AbstractCegarLoop]: Abstraction has 2832 states and 9248 transitions. [2020-12-23 13:54:07,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 13:54:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 9248 transitions. [2020-12-23 13:54:07,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:07,485 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:07,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:07,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 13:54:07,486 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]=== [2020-12-23 13:54:07,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:07,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1068686744, now seen corresponding path program 2 times [2020-12-23 13:54:07,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:07,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434558116] [2020-12-23 13:54:07,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:07,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:07,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434558116] [2020-12-23 13:54:07,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:07,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 13:54:07,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383613146] [2020-12-23 13:54:07,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 13:54:07,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:07,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 13:54:07,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-12-23 13:54:07,950 INFO L87 Difference]: Start difference. First operand 2832 states and 9248 transitions. Second operand 13 states. [2020-12-23 13:54:09,650 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2020-12-23 13:54:10,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:10,235 INFO L93 Difference]: Finished difference Result 3121 states and 10026 transitions. [2020-12-23 13:54:10,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 13:54:10,238 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-23 13:54:10,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:10,259 INFO L225 Difference]: With dead ends: 3121 [2020-12-23 13:54:10,259 INFO L226 Difference]: Without dead ends: 3032 [2020-12-23 13:54:10,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=168, Invalid=384, Unknown=0, NotChecked=0, Total=552 [2020-12-23 13:54:10,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2020-12-23 13:54:10,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 2951. [2020-12-23 13:54:10,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2951 states. [2020-12-23 13:54:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2951 states to 2951 states and 9622 transitions. [2020-12-23 13:54:10,368 INFO L78 Accepts]: Start accepts. Automaton has 2951 states and 9622 transitions. Word has length 25 [2020-12-23 13:54:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:10,369 INFO L481 AbstractCegarLoop]: Abstraction has 2951 states and 9622 transitions. [2020-12-23 13:54:10,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 13:54:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 9622 transitions. [2020-12-23 13:54:10,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:10,378 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:10,378 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:10,378 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 13:54:10,378 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]=== [2020-12-23 13:54:10,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:10,379 INFO L82 PathProgramCache]: Analyzing trace with hash -602227060, now seen corresponding path program 1 times [2020-12-23 13:54:10,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:10,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622328556] [2020-12-23 13:54:10,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:10,891 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622328556] [2020-12-23 13:54:10,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:10,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 13:54:10,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349694052] [2020-12-23 13:54:10,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:54:10,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:10,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:54:10,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:54:10,894 INFO L87 Difference]: Start difference. First operand 2951 states and 9622 transitions. Second operand 15 states. [2020-12-23 13:54:11,627 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2020-12-23 13:54:11,988 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2020-12-23 13:54:13,390 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2020-12-23 13:54:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:13,967 INFO L93 Difference]: Finished difference Result 4860 states and 15550 transitions. [2020-12-23 13:54:13,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-23 13:54:13,968 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2020-12-23 13:54:13,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:13,987 INFO L225 Difference]: With dead ends: 4860 [2020-12-23 13:54:13,988 INFO L226 Difference]: Without dead ends: 4771 [2020-12-23 13:54:13,988 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=277, Invalid=653, Unknown=0, NotChecked=0, Total=930 [2020-12-23 13:54:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4771 states. [2020-12-23 13:54:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4771 to 3761. [2020-12-23 13:54:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3761 states. [2020-12-23 13:54:14,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3761 states to 3761 states and 12282 transitions. [2020-12-23 13:54:14,120 INFO L78 Accepts]: Start accepts. Automaton has 3761 states and 12282 transitions. Word has length 25 [2020-12-23 13:54:14,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:14,120 INFO L481 AbstractCegarLoop]: Abstraction has 3761 states and 12282 transitions. [2020-12-23 13:54:14,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:54:14,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3761 states and 12282 transitions. [2020-12-23 13:54:14,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:14,131 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:14,132 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:14,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 13:54:14,132 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]=== [2020-12-23 13:54:14,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:14,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1437674924, now seen corresponding path program 3 times [2020-12-23 13:54:14,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:14,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062924817] [2020-12-23 13:54:14,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:14,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062924817] [2020-12-23 13:54:14,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:14,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:54:14,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183210964] [2020-12-23 13:54:14,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 13:54:14,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:14,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 13:54:14,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-12-23 13:54:14,482 INFO L87 Difference]: Start difference. First operand 3761 states and 12282 transitions. Second operand 14 states. [2020-12-23 13:54:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:16,633 INFO L93 Difference]: Finished difference Result 4452 states and 14292 transitions. [2020-12-23 13:54:16,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 13:54:16,634 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-12-23 13:54:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:16,652 INFO L225 Difference]: With dead ends: 4452 [2020-12-23 13:54:16,652 INFO L226 Difference]: Without dead ends: 4377 [2020-12-23 13:54:16,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2020-12-23 13:54:16,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4377 states. [2020-12-23 13:54:16,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4377 to 4267. [2020-12-23 13:54:16,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4267 states. [2020-12-23 13:54:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 13884 transitions. [2020-12-23 13:54:16,790 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 13884 transitions. Word has length 25 [2020-12-23 13:54:16,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:16,790 INFO L481 AbstractCegarLoop]: Abstraction has 4267 states and 13884 transitions. [2020-12-23 13:54:16,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 13:54:16,791 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 13884 transitions. [2020-12-23 13:54:16,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:16,805 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:16,805 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:16,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 13:54:16,805 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]=== [2020-12-23 13:54:16,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:16,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1985930276, now seen corresponding path program 4 times [2020-12-23 13:54:16,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:16,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28480760] [2020-12-23 13:54:16,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:17,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28480760] [2020-12-23 13:54:17,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:17,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 13:54:17,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289664193] [2020-12-23 13:54:17,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 13:54:17,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:17,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 13:54:17,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-12-23 13:54:17,182 INFO L87 Difference]: Start difference. First operand 4267 states and 13884 transitions. Second operand 13 states. [2020-12-23 13:54:19,145 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2020-12-23 13:54:19,419 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2020-12-23 13:54:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:20,094 INFO L93 Difference]: Finished difference Result 5096 states and 16292 transitions. [2020-12-23 13:54:20,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-23 13:54:20,094 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-23 13:54:20,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:20,114 INFO L225 Difference]: With dead ends: 5096 [2020-12-23 13:54:20,115 INFO L226 Difference]: Without dead ends: 5007 [2020-12-23 13:54:20,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=214, Invalid=488, Unknown=0, NotChecked=0, Total=702 [2020-12-23 13:54:20,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5007 states. [2020-12-23 13:54:20,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5007 to 3641. [2020-12-23 13:54:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2020-12-23 13:54:20,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 11792 transitions. [2020-12-23 13:54:20,251 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 11792 transitions. Word has length 25 [2020-12-23 13:54:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:20,252 INFO L481 AbstractCegarLoop]: Abstraction has 3641 states and 11792 transitions. [2020-12-23 13:54:20,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 13:54:20,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 11792 transitions. [2020-12-23 13:54:20,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:20,263 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:20,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:20,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 13:54:20,263 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]=== [2020-12-23 13:54:20,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:20,264 INFO L82 PathProgramCache]: Analyzing trace with hash -802072470, now seen corresponding path program 5 times [2020-12-23 13:54:20,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:20,264 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144522744] [2020-12-23 13:54:20,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:20,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144522744] [2020-12-23 13:54:20,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:20,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:54:20,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116247747] [2020-12-23 13:54:20,630 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 13:54:20,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:20,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 13:54:20,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-12-23 13:54:20,631 INFO L87 Difference]: Start difference. First operand 3641 states and 11792 transitions. Second operand 14 states. [2020-12-23 13:54:22,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:22,886 INFO L93 Difference]: Finished difference Result 4102 states and 13192 transitions. [2020-12-23 13:54:22,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 13:54:22,886 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-12-23 13:54:22,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:22,901 INFO L225 Difference]: With dead ends: 4102 [2020-12-23 13:54:22,901 INFO L226 Difference]: Without dead ends: 4027 [2020-12-23 13:54:22,902 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2020-12-23 13:54:22,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4027 states. [2020-12-23 13:54:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4027 to 3895. [2020-12-23 13:54:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3895 states. [2020-12-23 13:54:23,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3895 states to 3895 states and 12596 transitions. [2020-12-23 13:54:23,019 INFO L78 Accepts]: Start accepts. Automaton has 3895 states and 12596 transitions. Word has length 25 [2020-12-23 13:54:23,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:23,020 INFO L481 AbstractCegarLoop]: Abstraction has 3895 states and 12596 transitions. [2020-12-23 13:54:23,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 13:54:23,020 INFO L276 IsEmpty]: Start isEmpty. Operand 3895 states and 12596 transitions. [2020-12-23 13:54:23,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:23,032 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:23,032 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:23,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 13:54:23,032 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]=== [2020-12-23 13:54:23,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:23,033 INFO L82 PathProgramCache]: Analyzing trace with hash 69289626, now seen corresponding path program 6 times [2020-12-23 13:54:23,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:23,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454571574] [2020-12-23 13:54:23,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:23,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:23,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454571574] [2020-12-23 13:54:23,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:23,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:54:23,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139426307] [2020-12-23 13:54:23,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 13:54:23,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:23,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 13:54:23,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-12-23 13:54:23,477 INFO L87 Difference]: Start difference. First operand 3895 states and 12596 transitions. Second operand 14 states. [2020-12-23 13:54:25,857 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 57 [2020-12-23 13:54:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:26,465 INFO L93 Difference]: Finished difference Result 4734 states and 15154 transitions. [2020-12-23 13:54:26,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 13:54:26,471 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-12-23 13:54:26,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:26,482 INFO L225 Difference]: With dead ends: 4734 [2020-12-23 13:54:26,482 INFO L226 Difference]: Without dead ends: 4645 [2020-12-23 13:54:26,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=243, Invalid=569, Unknown=0, NotChecked=0, Total=812 [2020-12-23 13:54:26,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4645 states. [2020-12-23 13:54:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4645 to 3401. [2020-12-23 13:54:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2020-12-23 13:54:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 11032 transitions. [2020-12-23 13:54:26,589 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 11032 transitions. Word has length 25 [2020-12-23 13:54:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:26,589 INFO L481 AbstractCegarLoop]: Abstraction has 3401 states and 11032 transitions. [2020-12-23 13:54:26,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 13:54:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 11032 transitions. [2020-12-23 13:54:26,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:26,599 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:26,600 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:26,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 13:54:26,600 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]=== [2020-12-23 13:54:26,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:26,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1779182558, now seen corresponding path program 7 times [2020-12-23 13:54:26,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:26,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445073395] [2020-12-23 13:54:26,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:27,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445073395] [2020-12-23 13:54:27,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:27,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:54:27,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094925731] [2020-12-23 13:54:27,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 13:54:27,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:27,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 13:54:27,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2020-12-23 13:54:27,030 INFO L87 Difference]: Start difference. First operand 3401 states and 11032 transitions. Second operand 14 states. [2020-12-23 13:54:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:28,852 INFO L93 Difference]: Finished difference Result 3490 states and 11127 transitions. [2020-12-23 13:54:28,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 13:54:28,852 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-12-23 13:54:28,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:28,859 INFO L225 Difference]: With dead ends: 3490 [2020-12-23 13:54:28,859 INFO L226 Difference]: Without dead ends: 3415 [2020-12-23 13:54:28,859 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2020-12-23 13:54:28,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3415 states. [2020-12-23 13:54:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3415 to 3295. [2020-12-23 13:54:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3295 states. [2020-12-23 13:54:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3295 states to 3295 states and 10569 transitions. [2020-12-23 13:54:28,950 INFO L78 Accepts]: Start accepts. Automaton has 3295 states and 10569 transitions. Word has length 25 [2020-12-23 13:54:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:28,951 INFO L481 AbstractCegarLoop]: Abstraction has 3295 states and 10569 transitions. [2020-12-23 13:54:28,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 13:54:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 3295 states and 10569 transitions. [2020-12-23 13:54:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:28,959 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:28,960 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:28,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 13:54:28,960 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]=== [2020-12-23 13:54:28,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:28,961 INFO L82 PathProgramCache]: Analyzing trace with hash -907820462, now seen corresponding path program 8 times [2020-12-23 13:54:28,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:28,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62766819] [2020-12-23 13:54:28,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:29,289 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62766819] [2020-12-23 13:54:29,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:29,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 13:54:29,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440729387] [2020-12-23 13:54:29,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 13:54:29,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:29,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 13:54:29,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-12-23 13:54:29,291 INFO L87 Difference]: Start difference. First operand 3295 states and 10569 transitions. Second operand 13 states. [2020-12-23 13:54:31,732 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2020-12-23 13:54:31,910 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2020-12-23 13:54:32,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:32,487 INFO L93 Difference]: Finished difference Result 4168 states and 13231 transitions. [2020-12-23 13:54:32,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-23 13:54:32,488 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2020-12-23 13:54:32,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:32,497 INFO L225 Difference]: With dead ends: 4168 [2020-12-23 13:54:32,497 INFO L226 Difference]: Without dead ends: 4079 [2020-12-23 13:54:32,498 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=248, Invalid=622, Unknown=0, NotChecked=0, Total=870 [2020-12-23 13:54:32,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4079 states. [2020-12-23 13:54:32,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4079 to 3175. [2020-12-23 13:54:32,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3175 states. [2020-12-23 13:54:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 10189 transitions. [2020-12-23 13:54:32,583 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 10189 transitions. Word has length 25 [2020-12-23 13:54:32,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:32,583 INFO L481 AbstractCegarLoop]: Abstraction has 3175 states and 10189 transitions. [2020-12-23 13:54:32,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 13:54:32,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 10189 transitions. [2020-12-23 13:54:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:32,589 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:32,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:32,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 13:54:32,590 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]=== [2020-12-23 13:54:32,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:32,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1462145462, now seen corresponding path program 2 times [2020-12-23 13:54:32,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:32,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235893223] [2020-12-23 13:54:32,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:33,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:33,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235893223] [2020-12-23 13:54:33,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:33,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 13:54:33,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62312041] [2020-12-23 13:54:33,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:54:33,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:33,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:54:33,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:54:33,035 INFO L87 Difference]: Start difference. First operand 3175 states and 10189 transitions. Second operand 15 states. [2020-12-23 13:54:33,764 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 38 [2020-12-23 13:54:34,357 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2020-12-23 13:54:35,879 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2020-12-23 13:54:36,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:36,501 INFO L93 Difference]: Finished difference Result 4584 states and 14507 transitions. [2020-12-23 13:54:36,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-12-23 13:54:36,502 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2020-12-23 13:54:36,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:36,510 INFO L225 Difference]: With dead ends: 4584 [2020-12-23 13:54:36,510 INFO L226 Difference]: Without dead ends: 4495 [2020-12-23 13:54:36,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=295, Invalid=697, Unknown=0, NotChecked=0, Total=992 [2020-12-23 13:54:36,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4495 states. [2020-12-23 13:54:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4495 to 3175. [2020-12-23 13:54:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3175 states. [2020-12-23 13:54:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 10189 transitions. [2020-12-23 13:54:36,640 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 10189 transitions. Word has length 25 [2020-12-23 13:54:36,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:36,641 INFO L481 AbstractCegarLoop]: Abstraction has 3175 states and 10189 transitions. [2020-12-23 13:54:36,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:54:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 10189 transitions. [2020-12-23 13:54:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:36,646 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:36,647 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:36,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 13:54:36,647 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]=== [2020-12-23 13:54:36,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:36,648 INFO L82 PathProgramCache]: Analyzing trace with hash -839111096, now seen corresponding path program 3 times [2020-12-23 13:54:36,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:36,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860476809] [2020-12-23 13:54:36,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:37,110 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860476809] [2020-12-23 13:54:37,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:37,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 13:54:37,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762476137] [2020-12-23 13:54:37,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:54:37,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:37,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:54:37,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:54:37,111 INFO L87 Difference]: Start difference. First operand 3175 states and 10189 transitions. Second operand 15 states. [2020-12-23 13:54:38,531 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2020-12-23 13:54:39,570 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-12-23 13:54:40,190 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2020-12-23 13:54:40,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:40,871 INFO L93 Difference]: Finished difference Result 4384 states and 13907 transitions. [2020-12-23 13:54:40,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-23 13:54:40,876 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 25 [2020-12-23 13:54:40,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:40,886 INFO L225 Difference]: With dead ends: 4384 [2020-12-23 13:54:40,887 INFO L226 Difference]: Without dead ends: 4295 [2020-12-23 13:54:40,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=313, Invalid=743, Unknown=0, NotChecked=0, Total=1056 [2020-12-23 13:54:40,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4295 states. [2020-12-23 13:54:40,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4295 to 3245. [2020-12-23 13:54:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3245 states. [2020-12-23 13:54:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3245 states to 3245 states and 10469 transitions. [2020-12-23 13:54:40,978 INFO L78 Accepts]: Start accepts. Automaton has 3245 states and 10469 transitions. Word has length 25 [2020-12-23 13:54:40,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:40,978 INFO L481 AbstractCegarLoop]: Abstraction has 3245 states and 10469 transitions. [2020-12-23 13:54:40,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:54:40,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3245 states and 10469 transitions. [2020-12-23 13:54:40,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:40,983 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:40,983 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:40,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 13:54:40,984 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]=== [2020-12-23 13:54:40,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:40,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1696407784, now seen corresponding path program 4 times [2020-12-23 13:54:40,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:40,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022412204] [2020-12-23 13:54:40,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:41,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:41,311 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022412204] [2020-12-23 13:54:41,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:41,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:54:41,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453700005] [2020-12-23 13:54:41,312 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 13:54:41,312 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:41,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 13:54:41,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-12-23 13:54:41,313 INFO L87 Difference]: Start difference. First operand 3245 states and 10469 transitions. Second operand 14 states. [2020-12-23 13:54:43,004 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2020-12-23 13:54:44,381 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2020-12-23 13:54:44,652 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2020-12-23 13:54:44,824 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 65 [2020-12-23 13:54:45,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:45,575 INFO L93 Difference]: Finished difference Result 4244 states and 13342 transitions. [2020-12-23 13:54:45,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-12-23 13:54:45,575 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-12-23 13:54:45,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:45,582 INFO L225 Difference]: With dead ends: 4244 [2020-12-23 13:54:45,582 INFO L226 Difference]: Without dead ends: 4155 [2020-12-23 13:54:45,582 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=322, Invalid=800, Unknown=0, NotChecked=0, Total=1122 [2020-12-23 13:54:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2020-12-23 13:54:45,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 3199. [2020-12-23 13:54:45,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3199 states. [2020-12-23 13:54:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3199 states to 3199 states and 10176 transitions. [2020-12-23 13:54:45,662 INFO L78 Accepts]: Start accepts. Automaton has 3199 states and 10176 transitions. Word has length 25 [2020-12-23 13:54:45,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:45,662 INFO L481 AbstractCegarLoop]: Abstraction has 3199 states and 10176 transitions. [2020-12-23 13:54:45,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 13:54:45,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3199 states and 10176 transitions. [2020-12-23 13:54:45,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-23 13:54:45,668 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:45,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:45,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 13:54:45,668 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]=== [2020-12-23 13:54:45,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:45,669 INFO L82 PathProgramCache]: Analyzing trace with hash -2038283772, now seen corresponding path program 5 times [2020-12-23 13:54:45,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:45,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353271836] [2020-12-23 13:54:45,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:45,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353271836] [2020-12-23 13:54:45,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:45,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:54:45,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142365109] [2020-12-23 13:54:45,990 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 13:54:45,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:45,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 13:54:45,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-12-23 13:54:45,992 INFO L87 Difference]: Start difference. First operand 3199 states and 10176 transitions. Second operand 14 states. [2020-12-23 13:54:46,892 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2020-12-23 13:54:47,808 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2020-12-23 13:54:48,018 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2020-12-23 13:54:48,290 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 65 [2020-12-23 13:54:48,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:48,952 INFO L93 Difference]: Finished difference Result 4048 states and 12704 transitions. [2020-12-23 13:54:48,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 13:54:48,952 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2020-12-23 13:54:48,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:48,959 INFO L225 Difference]: With dead ends: 4048 [2020-12-23 13:54:48,959 INFO L226 Difference]: Without dead ends: 3959 [2020-12-23 13:54:48,960 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=217, Invalid=485, Unknown=0, NotChecked=0, Total=702 [2020-12-23 13:54:48,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3959 states. [2020-12-23 13:54:49,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3959 to 2769. [2020-12-23 13:54:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2769 states. [2020-12-23 13:54:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2769 states to 2769 states and 8836 transitions. [2020-12-23 13:54:49,017 INFO L78 Accepts]: Start accepts. Automaton has 2769 states and 8836 transitions. Word has length 25 [2020-12-23 13:54:49,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:49,017 INFO L481 AbstractCegarLoop]: Abstraction has 2769 states and 8836 transitions. [2020-12-23 13:54:49,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 13:54:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2769 states and 8836 transitions. [2020-12-23 13:54:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:54:49,022 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:49,022 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:49,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 13:54:49,022 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]=== [2020-12-23 13:54:49,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:49,022 INFO L82 PathProgramCache]: Analyzing trace with hash -144703769, now seen corresponding path program 1 times [2020-12-23 13:54:49,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:49,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190438518] [2020-12-23 13:54:49,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:49,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190438518] [2020-12-23 13:54:49,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:49,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:54:49,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108770086] [2020-12-23 13:54:49,586 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:54:49,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:49,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:54:49,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:54:49,587 INFO L87 Difference]: Start difference. First operand 2769 states and 8836 transitions. Second operand 15 states. [2020-12-23 13:54:52,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:52,065 INFO L93 Difference]: Finished difference Result 4789 states and 15419 transitions. [2020-12-23 13:54:52,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 13:54:52,066 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:54:52,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:52,074 INFO L225 Difference]: With dead ends: 4789 [2020-12-23 13:54:52,074 INFO L226 Difference]: Without dead ends: 4789 [2020-12-23 13:54:52,074 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2020-12-23 13:54:52,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4789 states. [2020-12-23 13:54:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4789 to 3949. [2020-12-23 13:54:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3949 states. [2020-12-23 13:54:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 12589 transitions. [2020-12-23 13:54:52,180 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 12589 transitions. Word has length 27 [2020-12-23 13:54:52,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:52,180 INFO L481 AbstractCegarLoop]: Abstraction has 3949 states and 12589 transitions. [2020-12-23 13:54:52,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:54:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 12589 transitions. [2020-12-23 13:54:52,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:54:52,187 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:52,187 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:52,188 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 13:54:52,188 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]=== [2020-12-23 13:54:52,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:52,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1191722114, now seen corresponding path program 1 times [2020-12-23 13:54:52,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:52,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698293212] [2020-12-23 13:54:52,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:52,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698293212] [2020-12-23 13:54:52,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:52,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 13:54:52,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448451577] [2020-12-23 13:54:52,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 13:54:52,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:52,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 13:54:52,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-23 13:54:52,843 INFO L87 Difference]: Start difference. First operand 3949 states and 12589 transitions. Second operand 16 states. [2020-12-23 13:54:53,346 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2020-12-23 13:54:53,585 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 46 [2020-12-23 13:54:53,946 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 49 [2020-12-23 13:54:54,238 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2020-12-23 13:54:56,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:56,070 INFO L93 Difference]: Finished difference Result 6639 states and 21182 transitions. [2020-12-23 13:54:56,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 13:54:56,070 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-23 13:54:56,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:56,083 INFO L225 Difference]: With dead ends: 6639 [2020-12-23 13:54:56,084 INFO L226 Difference]: Without dead ends: 6639 [2020-12-23 13:54:56,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2020-12-23 13:54:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6639 states. [2020-12-23 13:54:56,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6639 to 4837. [2020-12-23 13:54:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4837 states. [2020-12-23 13:54:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4837 states to 4837 states and 15293 transitions. [2020-12-23 13:54:56,228 INFO L78 Accepts]: Start accepts. Automaton has 4837 states and 15293 transitions. Word has length 27 [2020-12-23 13:54:56,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:56,229 INFO L481 AbstractCegarLoop]: Abstraction has 4837 states and 15293 transitions. [2020-12-23 13:54:56,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 13:54:56,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4837 states and 15293 transitions. [2020-12-23 13:54:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:54:56,239 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:56,239 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:56,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 13:54:56,239 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]=== [2020-12-23 13:54:56,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:56,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2125970475, now seen corresponding path program 2 times [2020-12-23 13:54:56,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:56,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363114637] [2020-12-23 13:54:56,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:54:56,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:54:56,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363114637] [2020-12-23 13:54:56,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:54:56,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:54:56,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77701524] [2020-12-23 13:54:56,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:54:56,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:54:56,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:54:56,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:54:56,909 INFO L87 Difference]: Start difference. First operand 4837 states and 15293 transitions. Second operand 15 states. [2020-12-23 13:54:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:54:59,632 INFO L93 Difference]: Finished difference Result 6871 states and 21918 transitions. [2020-12-23 13:54:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 13:54:59,632 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:54:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:54:59,647 INFO L225 Difference]: With dead ends: 6871 [2020-12-23 13:54:59,647 INFO L226 Difference]: Without dead ends: 6871 [2020-12-23 13:54:59,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2020-12-23 13:54:59,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6871 states. [2020-12-23 13:54:59,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6871 to 4601. [2020-12-23 13:54:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4601 states. [2020-12-23 13:54:59,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4601 states to 4601 states and 14585 transitions. [2020-12-23 13:54:59,782 INFO L78 Accepts]: Start accepts. Automaton has 4601 states and 14585 transitions. Word has length 27 [2020-12-23 13:54:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:54:59,782 INFO L481 AbstractCegarLoop]: Abstraction has 4601 states and 14585 transitions. [2020-12-23 13:54:59,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:54:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 4601 states and 14585 transitions. [2020-12-23 13:54:59,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:54:59,789 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:54:59,789 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:54:59,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 13:54:59,789 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]=== [2020-12-23 13:54:59,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:54:59,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1507340137, now seen corresponding path program 3 times [2020-12-23 13:54:59,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:54:59,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489645593] [2020-12-23 13:54:59,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:54:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:55:00,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489645593] [2020-12-23 13:55:00,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:00,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:55:00,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059482517] [2020-12-23 13:55:00,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:55:00,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:00,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:55:00,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:55:00,378 INFO L87 Difference]: Start difference. First operand 4601 states and 14585 transitions. Second operand 15 states. [2020-12-23 13:55:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:03,269 INFO L93 Difference]: Finished difference Result 6631 states and 21318 transitions. [2020-12-23 13:55:03,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 13:55:03,270 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:55:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:03,282 INFO L225 Difference]: With dead ends: 6631 [2020-12-23 13:55:03,282 INFO L226 Difference]: Without dead ends: 6631 [2020-12-23 13:55:03,283 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2020-12-23 13:55:03,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6631 states. [2020-12-23 13:55:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6631 to 5551. [2020-12-23 13:55:03,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5551 states. [2020-12-23 13:55:03,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5551 states to 5551 states and 17723 transitions. [2020-12-23 13:55:03,387 INFO L78 Accepts]: Start accepts. Automaton has 5551 states and 17723 transitions. Word has length 27 [2020-12-23 13:55:03,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:03,387 INFO L481 AbstractCegarLoop]: Abstraction has 5551 states and 17723 transitions. [2020-12-23 13:55:03,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:55:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 5551 states and 17723 transitions. [2020-12-23 13:55:03,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:03,396 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:03,396 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:55:03,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 13:55:03,397 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]=== [2020-12-23 13:55:03,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:03,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1507340138, now seen corresponding path program 1 times [2020-12-23 13:55:03,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:03,398 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446139111] [2020-12-23 13:55:03,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:55:04,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446139111] [2020-12-23 13:55:04,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:04,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:55:04,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210217159] [2020-12-23 13:55:04,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:55:04,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:04,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:55:04,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:55:04,030 INFO L87 Difference]: Start difference. First operand 5551 states and 17723 transitions. Second operand 15 states. [2020-12-23 13:55:06,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:06,987 INFO L93 Difference]: Finished difference Result 6631 states and 21198 transitions. [2020-12-23 13:55:06,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 13:55:06,988 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:55:06,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:07,001 INFO L225 Difference]: With dead ends: 6631 [2020-12-23 13:55:07,001 INFO L226 Difference]: Without dead ends: 6631 [2020-12-23 13:55:07,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2020-12-23 13:55:07,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6631 states. [2020-12-23 13:55:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6631 to 4241. [2020-12-23 13:55:07,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4241 states. [2020-12-23 13:55:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4241 states to 4241 states and 13505 transitions. [2020-12-23 13:55:07,101 INFO L78 Accepts]: Start accepts. Automaton has 4241 states and 13505 transitions. Word has length 27 [2020-12-23 13:55:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:07,101 INFO L481 AbstractCegarLoop]: Abstraction has 4241 states and 13505 transitions. [2020-12-23 13:55:07,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:55:07,101 INFO L276 IsEmpty]: Start isEmpty. Operand 4241 states and 13505 transitions. [2020-12-23 13:55:07,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:07,108 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:07,108 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:55:07,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 13:55:07,108 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]=== [2020-12-23 13:55:07,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:07,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1192583903, now seen corresponding path program 4 times [2020-12-23 13:55:07,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:07,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228169484] [2020-12-23 13:55:07,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:07,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:55:07,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228169484] [2020-12-23 13:55:07,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:07,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:55:07,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117972424] [2020-12-23 13:55:07,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:55:07,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:07,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:55:07,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:55:07,790 INFO L87 Difference]: Start difference. First operand 4241 states and 13505 transitions. Second operand 15 states. [2020-12-23 13:55:10,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:10,653 INFO L93 Difference]: Finished difference Result 5911 states and 19158 transitions. [2020-12-23 13:55:10,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 13:55:10,654 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:55:10,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:10,667 INFO L225 Difference]: With dead ends: 5911 [2020-12-23 13:55:10,667 INFO L226 Difference]: Without dead ends: 5911 [2020-12-23 13:55:10,667 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-12-23 13:55:10,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5911 states. [2020-12-23 13:55:10,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5911 to 5071. [2020-12-23 13:55:10,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5071 states. [2020-12-23 13:55:10,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5071 states to 5071 states and 16283 transitions. [2020-12-23 13:55:10,782 INFO L78 Accepts]: Start accepts. Automaton has 5071 states and 16283 transitions. Word has length 27 [2020-12-23 13:55:10,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:10,783 INFO L481 AbstractCegarLoop]: Abstraction has 5071 states and 16283 transitions. [2020-12-23 13:55:10,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:55:10,783 INFO L276 IsEmpty]: Start isEmpty. Operand 5071 states and 16283 transitions. [2020-12-23 13:55:10,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:10,790 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:10,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, 1, 1] [2020-12-23 13:55:10,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 13:55:10,791 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]=== [2020-12-23 13:55:10,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:10,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1192583902, now seen corresponding path program 2 times [2020-12-23 13:55:10,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:10,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987589028] [2020-12-23 13:55:10,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:55:11,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987589028] [2020-12-23 13:55:11,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:11,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:55:11,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117230919] [2020-12-23 13:55:11,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:55:11,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:11,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:55:11,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:55:11,500 INFO L87 Difference]: Start difference. First operand 5071 states and 16283 transitions. Second operand 15 states. [2020-12-23 13:55:14,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:14,351 INFO L93 Difference]: Finished difference Result 5911 states and 19038 transitions. [2020-12-23 13:55:14,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 13:55:14,352 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:55:14,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:14,363 INFO L225 Difference]: With dead ends: 5911 [2020-12-23 13:55:14,363 INFO L226 Difference]: Without dead ends: 5911 [2020-12-23 13:55:14,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-12-23 13:55:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5911 states. [2020-12-23 13:55:14,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5911 to 4121. [2020-12-23 13:55:14,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4121 states. [2020-12-23 13:55:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 13145 transitions. [2020-12-23 13:55:14,474 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 13145 transitions. Word has length 27 [2020-12-23 13:55:14,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:14,474 INFO L481 AbstractCegarLoop]: Abstraction has 4121 states and 13145 transitions. [2020-12-23 13:55:14,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:55:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 13145 transitions. [2020-12-23 13:55:14,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:14,482 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:14,482 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:55:14,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 13:55:14,482 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]=== [2020-12-23 13:55:14,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:14,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1121877513, now seen corresponding path program 5 times [2020-12-23 13:55:14,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:14,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029456097] [2020-12-23 13:55:14,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:15,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:55:15,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029456097] [2020-12-23 13:55:15,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:15,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:55:15,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381690215] [2020-12-23 13:55:15,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:55:15,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:15,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:55:15,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:55:15,056 INFO L87 Difference]: Start difference. First operand 4121 states and 13145 transitions. Second operand 15 states. [2020-12-23 13:55:17,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:17,962 INFO L93 Difference]: Finished difference Result 5651 states and 18358 transitions. [2020-12-23 13:55:17,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 13:55:17,964 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:55:17,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:17,974 INFO L225 Difference]: With dead ends: 5651 [2020-12-23 13:55:17,974 INFO L226 Difference]: Without dead ends: 5651 [2020-12-23 13:55:17,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-12-23 13:55:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2020-12-23 13:55:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 4811. [2020-12-23 13:55:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4811 states. [2020-12-23 13:55:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4811 states to 4811 states and 15483 transitions. [2020-12-23 13:55:18,054 INFO L78 Accepts]: Start accepts. Automaton has 4811 states and 15483 transitions. Word has length 27 [2020-12-23 13:55:18,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:18,054 INFO L481 AbstractCegarLoop]: Abstraction has 4811 states and 15483 transitions. [2020-12-23 13:55:18,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:55:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand 4811 states and 15483 transitions. [2020-12-23 13:55:18,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:18,062 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:18,062 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:55:18,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 13:55:18,062 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]=== [2020-12-23 13:55:18,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:18,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1121877514, now seen corresponding path program 3 times [2020-12-23 13:55:18,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:18,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482506680] [2020-12-23 13:55:18,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:18,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:55:18,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482506680] [2020-12-23 13:55:18,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:18,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:55:18,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481269827] [2020-12-23 13:55:18,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:55:18,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:18,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:55:18,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:55:18,695 INFO L87 Difference]: Start difference. First operand 4811 states and 15483 transitions. Second operand 15 states. [2020-12-23 13:55:21,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:21,622 INFO L93 Difference]: Finished difference Result 5651 states and 18238 transitions. [2020-12-23 13:55:21,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-23 13:55:21,623 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:55:21,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:21,633 INFO L225 Difference]: With dead ends: 5651 [2020-12-23 13:55:21,633 INFO L226 Difference]: Without dead ends: 5651 [2020-12-23 13:55:21,633 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2020-12-23 13:55:21,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5651 states. [2020-12-23 13:55:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5651 to 3981. [2020-12-23 13:55:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3981 states. [2020-12-23 13:55:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3981 states to 3981 states and 12705 transitions. [2020-12-23 13:55:21,709 INFO L78 Accepts]: Start accepts. Automaton has 3981 states and 12705 transitions. Word has length 27 [2020-12-23 13:55:21,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:21,709 INFO L481 AbstractCegarLoop]: Abstraction has 3981 states and 12705 transitions. [2020-12-23 13:55:21,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:55:21,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3981 states and 12705 transitions. [2020-12-23 13:55:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:21,713 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:21,713 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:55:21,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 13:55:21,713 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]=== [2020-12-23 13:55:21,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:21,714 INFO L82 PathProgramCache]: Analyzing trace with hash -948485079, now seen corresponding path program 6 times [2020-12-23 13:55:21,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:21,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485266469] [2020-12-23 13:55:21,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:22,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:55:22,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485266469] [2020-12-23 13:55:22,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:22,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:55:22,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262530782] [2020-12-23 13:55:22,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:55:22,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:22,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:55:22,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:55:22,188 INFO L87 Difference]: Start difference. First operand 3981 states and 12705 transitions. Second operand 15 states. [2020-12-23 13:55:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:25,274 INFO L93 Difference]: Finished difference Result 7034 states and 22897 transitions. [2020-12-23 13:55:25,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 13:55:25,275 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:55:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:25,288 INFO L225 Difference]: With dead ends: 7034 [2020-12-23 13:55:25,288 INFO L226 Difference]: Without dead ends: 7034 [2020-12-23 13:55:25,289 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2020-12-23 13:55:25,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7034 states. [2020-12-23 13:55:25,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7034 to 4716. [2020-12-23 13:55:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4716 states. [2020-12-23 13:55:25,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4716 states to 4716 states and 15188 transitions. [2020-12-23 13:55:25,377 INFO L78 Accepts]: Start accepts. Automaton has 4716 states and 15188 transitions. Word has length 27 [2020-12-23 13:55:25,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:25,378 INFO L481 AbstractCegarLoop]: Abstraction has 4716 states and 15188 transitions. [2020-12-23 13:55:25,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:55:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 4716 states and 15188 transitions. [2020-12-23 13:55:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:25,382 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:25,382 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:55:25,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 13:55:25,383 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]=== [2020-12-23 13:55:25,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:25,383 INFO L82 PathProgramCache]: Analyzing trace with hash -948485078, now seen corresponding path program 4 times [2020-12-23 13:55:25,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:25,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347504175] [2020-12-23 13:55:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:25,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:55:25,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347504175] [2020-12-23 13:55:25,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:25,939 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-23 13:55:25,939 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279705559] [2020-12-23 13:55:25,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 13:55:25,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:25,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 13:55:25,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-12-23 13:55:25,941 INFO L87 Difference]: Start difference. First operand 4716 states and 15188 transitions. Second operand 15 states. [2020-12-23 13:55:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:29,188 INFO L93 Difference]: Finished difference Result 7034 states and 22777 transitions. [2020-12-23 13:55:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 13:55:29,189 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2020-12-23 13:55:29,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:29,202 INFO L225 Difference]: With dead ends: 7034 [2020-12-23 13:55:29,202 INFO L226 Difference]: Without dead ends: 7034 [2020-12-23 13:55:29,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2020-12-23 13:55:29,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7034 states. [2020-12-23 13:55:29,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7034 to 4026. [2020-12-23 13:55:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4026 states. [2020-12-23 13:55:29,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4026 states to 4026 states and 12850 transitions. [2020-12-23 13:55:29,297 INFO L78 Accepts]: Start accepts. Automaton has 4026 states and 12850 transitions. Word has length 27 [2020-12-23 13:55:29,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:29,297 INFO L481 AbstractCegarLoop]: Abstraction has 4026 states and 12850 transitions. [2020-12-23 13:55:29,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 13:55:29,297 INFO L276 IsEmpty]: Start isEmpty. Operand 4026 states and 12850 transitions. [2020-12-23 13:55:29,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:29,302 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:29,303 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:55:29,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 13:55:29,303 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]=== [2020-12-23 13:55:29,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:29,303 INFO L82 PathProgramCache]: Analyzing trace with hash 778825004, now seen corresponding path program 2 times [2020-12-23 13:55:29,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:29,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102263817] [2020-12-23 13:55:29,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:55:30,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102263817] [2020-12-23 13:55:30,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:30,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 13:55:30,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018449430] [2020-12-23 13:55:30,036 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 13:55:30,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:30,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 13:55:30,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-23 13:55:30,037 INFO L87 Difference]: Start difference. First operand 4026 states and 12850 transitions. Second operand 16 states. [2020-12-23 13:55:30,608 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2020-12-23 13:55:30,830 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2020-12-23 13:55:31,197 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 49 [2020-12-23 13:55:31,505 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2020-12-23 13:55:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:33,444 INFO L93 Difference]: Finished difference Result 6170 states and 19805 transitions. [2020-12-23 13:55:33,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 13:55:33,445 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-23 13:55:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:33,456 INFO L225 Difference]: With dead ends: 6170 [2020-12-23 13:55:33,457 INFO L226 Difference]: Without dead ends: 6170 [2020-12-23 13:55:33,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2020-12-23 13:55:33,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6170 states. [2020-12-23 13:55:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6170 to 3960. [2020-12-23 13:55:33,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2020-12-23 13:55:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 12652 transitions. [2020-12-23 13:55:33,534 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 12652 transitions. Word has length 27 [2020-12-23 13:55:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:33,534 INFO L481 AbstractCegarLoop]: Abstraction has 3960 states and 12652 transitions. [2020-12-23 13:55:33,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 13:55:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 12652 transitions. [2020-12-23 13:55:33,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:33,538 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:33,538 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:55:33,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 13:55:33,538 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]=== [2020-12-23 13:55:33,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:33,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1179430206, now seen corresponding path program 3 times [2020-12-23 13:55:33,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:33,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879192178] [2020-12-23 13:55:33,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:34,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:55:34,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879192178] [2020-12-23 13:55:34,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:34,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 13:55:34,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049265906] [2020-12-23 13:55:34,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 13:55:34,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:34,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 13:55:34,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-23 13:55:34,213 INFO L87 Difference]: Start difference. First operand 3960 states and 12652 transitions. Second operand 16 states. [2020-12-23 13:55:34,816 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2020-12-23 13:55:35,057 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2020-12-23 13:55:35,433 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 46 [2020-12-23 13:55:35,755 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2020-12-23 13:55:37,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:37,814 INFO L93 Difference]: Finished difference Result 6050 states and 19445 transitions. [2020-12-23 13:55:37,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 13:55:37,815 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-23 13:55:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:37,830 INFO L225 Difference]: With dead ends: 6050 [2020-12-23 13:55:37,830 INFO L226 Difference]: Without dead ends: 6050 [2020-12-23 13:55:37,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2020-12-23 13:55:37,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6050 states. [2020-12-23 13:55:37,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6050 to 3960. [2020-12-23 13:55:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2020-12-23 13:55:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 12652 transitions. [2020-12-23 13:55:37,940 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 12652 transitions. Word has length 27 [2020-12-23 13:55:37,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:37,940 INFO L481 AbstractCegarLoop]: Abstraction has 3960 states and 12652 transitions. [2020-12-23 13:55:37,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 13:55:37,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 12652 transitions. [2020-12-23 13:55:37,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:37,946 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:37,946 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:55:37,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 13:55:37,946 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]=== [2020-12-23 13:55:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1728350242, now seen corresponding path program 4 times [2020-12-23 13:55:37,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:37,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137788621] [2020-12-23 13:55:37,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:38,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:55:38,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137788621] [2020-12-23 13:55:38,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:38,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 13:55:38,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041776810] [2020-12-23 13:55:38,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 13:55:38,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:38,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 13:55:38,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-23 13:55:38,556 INFO L87 Difference]: Start difference. First operand 3960 states and 12652 transitions. Second operand 16 states. [2020-12-23 13:55:39,696 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-23 13:55:39,978 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2020-12-23 13:55:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:42,106 INFO L93 Difference]: Finished difference Result 5690 states and 18485 transitions. [2020-12-23 13:55:42,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 13:55:42,107 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-23 13:55:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:42,117 INFO L225 Difference]: With dead ends: 5690 [2020-12-23 13:55:42,117 INFO L226 Difference]: Without dead ends: 5690 [2020-12-23 13:55:42,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2020-12-23 13:55:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2020-12-23 13:55:42,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 4850. [2020-12-23 13:55:42,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4850 states. [2020-12-23 13:55:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4850 states to 4850 states and 15610 transitions. [2020-12-23 13:55:42,233 INFO L78 Accepts]: Start accepts. Automaton has 4850 states and 15610 transitions. Word has length 27 [2020-12-23 13:55:42,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:42,233 INFO L481 AbstractCegarLoop]: Abstraction has 4850 states and 15610 transitions. [2020-12-23 13:55:42,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 13:55:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 4850 states and 15610 transitions. [2020-12-23 13:55:42,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:42,238 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:42,238 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:55:42,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 13:55:42,239 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]=== [2020-12-23 13:55:42,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:42,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1728350241, now seen corresponding path program 1 times [2020-12-23 13:55:42,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:42,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802766974] [2020-12-23 13:55:42,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:55:42,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802766974] [2020-12-23 13:55:42,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:42,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 13:55:42,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668643931] [2020-12-23 13:55:42,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 13:55:42,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:42,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 13:55:42,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-23 13:55:42,968 INFO L87 Difference]: Start difference. First operand 4850 states and 15610 transitions. Second operand 16 states. [2020-12-23 13:55:43,577 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2020-12-23 13:55:43,884 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2020-12-23 13:55:44,137 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 49 [2020-12-23 13:55:44,439 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 48 [2020-12-23 13:55:46,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:46,605 INFO L93 Difference]: Finished difference Result 5690 states and 18365 transitions. [2020-12-23 13:55:46,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 13:55:46,606 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-23 13:55:46,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:46,619 INFO L225 Difference]: With dead ends: 5690 [2020-12-23 13:55:46,619 INFO L226 Difference]: Without dead ends: 5690 [2020-12-23 13:55:46,620 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2020-12-23 13:55:46,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5690 states. [2020-12-23 13:55:46,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5690 to 3960. [2020-12-23 13:55:46,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2020-12-23 13:55:46,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 12652 transitions. [2020-12-23 13:55:46,714 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 12652 transitions. Word has length 27 [2020-12-23 13:55:46,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:46,715 INFO L481 AbstractCegarLoop]: Abstraction has 3960 states and 12652 transitions. [2020-12-23 13:55:46,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 13:55:46,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 12652 transitions. [2020-12-23 13:55:46,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:46,720 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:46,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:55:46,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 13:55:46,721 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]=== [2020-12-23 13:55:46,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:46,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1445894704, now seen corresponding path program 5 times [2020-12-23 13:55:46,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:46,722 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633455469] [2020-12-23 13:55:46,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:55:47,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633455469] [2020-12-23 13:55:47,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:47,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 13:55:47,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482695606] [2020-12-23 13:55:47,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 13:55:47,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:47,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 13:55:47,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-23 13:55:47,350 INFO L87 Difference]: Start difference. First operand 3960 states and 12652 transitions. Second operand 16 states. [2020-12-23 13:55:48,503 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2020-12-23 13:55:48,785 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 47 [2020-12-23 13:55:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:51,069 INFO L93 Difference]: Finished difference Result 5630 states and 18305 transitions. [2020-12-23 13:55:51,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 13:55:51,070 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-23 13:55:51,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:51,081 INFO L225 Difference]: With dead ends: 5630 [2020-12-23 13:55:51,082 INFO L226 Difference]: Without dead ends: 5630 [2020-12-23 13:55:51,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2020-12-23 13:55:51,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2020-12-23 13:55:51,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 4790. [2020-12-23 13:55:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4790 states. [2020-12-23 13:55:51,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 15430 transitions. [2020-12-23 13:55:51,170 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 15430 transitions. Word has length 27 [2020-12-23 13:55:51,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:51,170 INFO L481 AbstractCegarLoop]: Abstraction has 4790 states and 15430 transitions. [2020-12-23 13:55:51,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 13:55:51,170 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 15430 transitions. [2020-12-23 13:55:51,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:51,176 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:51,176 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:55:51,176 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 13:55:51,176 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]=== [2020-12-23 13:55:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1445894703, now seen corresponding path program 2 times [2020-12-23 13:55:51,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:51,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908075557] [2020-12-23 13:55:51,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:51,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:55:51,902 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908075557] [2020-12-23 13:55:51,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:51,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 13:55:51,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104104386] [2020-12-23 13:55:51,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 13:55:51,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:51,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 13:55:51,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-23 13:55:51,904 INFO L87 Difference]: Start difference. First operand 4790 states and 15430 transitions. Second operand 16 states. [2020-12-23 13:55:52,844 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2020-12-23 13:55:53,393 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 58 [2020-12-23 13:55:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:55:55,844 INFO L93 Difference]: Finished difference Result 5630 states and 18185 transitions. [2020-12-23 13:55:55,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 13:55:55,845 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-23 13:55:55,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:55:55,855 INFO L225 Difference]: With dead ends: 5630 [2020-12-23 13:55:55,855 INFO L226 Difference]: Without dead ends: 5630 [2020-12-23 13:55:55,856 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2020-12-23 13:55:55,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5630 states. [2020-12-23 13:55:55,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5630 to 3960. [2020-12-23 13:55:55,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3960 states. [2020-12-23 13:55:55,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 12652 transitions. [2020-12-23 13:55:55,934 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 12652 transitions. Word has length 27 [2020-12-23 13:55:55,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:55:55,934 INFO L481 AbstractCegarLoop]: Abstraction has 3960 states and 12652 transitions. [2020-12-23 13:55:55,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 13:55:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 12652 transitions. [2020-12-23 13:55:55,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:55:55,939 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:55:55,939 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:55:55,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 13:55:55,939 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]=== [2020-12-23 13:55:55,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:55:55,940 INFO L82 PathProgramCache]: Analyzing trace with hash -774061944, now seen corresponding path program 6 times [2020-12-23 13:55:55,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:55:55,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810504058] [2020-12-23 13:55:55,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:55:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:55:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:55:56,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810504058] [2020-12-23 13:55:56,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:55:56,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 13:55:56,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424569932] [2020-12-23 13:55:56,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 13:55:56,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:55:56,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 13:55:56,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-23 13:55:56,542 INFO L87 Difference]: Start difference. First operand 3960 states and 12652 transitions. Second operand 16 states. [2020-12-23 13:55:57,438 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2020-12-23 13:55:57,957 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-12-23 13:56:00,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:00,524 INFO L93 Difference]: Finished difference Result 7643 states and 25009 transitions. [2020-12-23 13:56:00,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 13:56:00,525 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-23 13:56:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:00,540 INFO L225 Difference]: With dead ends: 7643 [2020-12-23 13:56:00,541 INFO L226 Difference]: Without dead ends: 7643 [2020-12-23 13:56:00,541 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2020-12-23 13:56:00,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7643 states. [2020-12-23 13:56:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7643 to 4695. [2020-12-23 13:56:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4695 states. [2020-12-23 13:56:00,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4695 states to 4695 states and 15135 transitions. [2020-12-23 13:56:00,638 INFO L78 Accepts]: Start accepts. Automaton has 4695 states and 15135 transitions. Word has length 27 [2020-12-23 13:56:00,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:00,638 INFO L481 AbstractCegarLoop]: Abstraction has 4695 states and 15135 transitions. [2020-12-23 13:56:00,638 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 13:56:00,638 INFO L276 IsEmpty]: Start isEmpty. Operand 4695 states and 15135 transitions. [2020-12-23 13:56:00,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:56:00,643 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:00,643 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:56:00,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 13:56:00,643 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]=== [2020-12-23 13:56:00,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:00,644 INFO L82 PathProgramCache]: Analyzing trace with hash -774061943, now seen corresponding path program 3 times [2020-12-23 13:56:00,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:00,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164800561] [2020-12-23 13:56:00,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:56:01,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164800561] [2020-12-23 13:56:01,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:01,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 13:56:01,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620081545] [2020-12-23 13:56:01,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 13:56:01,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:01,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 13:56:01,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-23 13:56:01,159 INFO L87 Difference]: Start difference. First operand 4695 states and 15135 transitions. Second operand 16 states. [2020-12-23 13:56:01,764 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2020-12-23 13:56:02,597 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-12-23 13:56:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:05,096 INFO L93 Difference]: Finished difference Result 7643 states and 24889 transitions. [2020-12-23 13:56:05,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 13:56:05,097 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-23 13:56:05,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:05,112 INFO L225 Difference]: With dead ends: 7643 [2020-12-23 13:56:05,113 INFO L226 Difference]: Without dead ends: 7643 [2020-12-23 13:56:05,113 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2020-12-23 13:56:05,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7643 states. [2020-12-23 13:56:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7643 to 3966. [2020-12-23 13:56:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3966 states. [2020-12-23 13:56:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3966 states to 3966 states and 12671 transitions. [2020-12-23 13:56:05,258 INFO L78 Accepts]: Start accepts. Automaton has 3966 states and 12671 transitions. Word has length 27 [2020-12-23 13:56:05,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:05,258 INFO L481 AbstractCegarLoop]: Abstraction has 3966 states and 12671 transitions. [2020-12-23 13:56:05,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 13:56:05,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3966 states and 12671 transitions. [2020-12-23 13:56:05,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-23 13:56:05,262 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:05,262 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:56:05,262 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 13:56:05,262 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]=== [2020-12-23 13:56:05,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:05,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1169258132, now seen corresponding path program 7 times [2020-12-23 13:56:05,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:05,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129195681] [2020-12-23 13:56:05,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:56:06,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129195681] [2020-12-23 13:56:06,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:06,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-12-23 13:56:06,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640313873] [2020-12-23 13:56:06,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-23 13:56:06,037 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:06,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-23 13:56:06,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2020-12-23 13:56:06,038 INFO L87 Difference]: Start difference. First operand 3966 states and 12671 transitions. Second operand 16 states. [2020-12-23 13:56:06,700 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 44 [2020-12-23 13:56:06,963 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2020-12-23 13:56:07,379 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2020-12-23 13:56:07,729 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2020-12-23 13:56:09,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:09,924 INFO L93 Difference]: Finished difference Result 5496 states and 17764 transitions. [2020-12-23 13:56:09,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 13:56:09,925 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2020-12-23 13:56:09,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:09,935 INFO L225 Difference]: With dead ends: 5496 [2020-12-23 13:56:09,935 INFO L226 Difference]: Without dead ends: 5496 [2020-12-23 13:56:09,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2020-12-23 13:56:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5496 states. [2020-12-23 13:56:09,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5496 to 3466. [2020-12-23 13:56:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3466 states. [2020-12-23 13:56:10,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3466 states to 3466 states and 11151 transitions. [2020-12-23 13:56:10,003 INFO L78 Accepts]: Start accepts. Automaton has 3466 states and 11151 transitions. Word has length 27 [2020-12-23 13:56:10,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:10,003 INFO L481 AbstractCegarLoop]: Abstraction has 3466 states and 11151 transitions. [2020-12-23 13:56:10,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-23 13:56:10,003 INFO L276 IsEmpty]: Start isEmpty. Operand 3466 states and 11151 transitions. [2020-12-23 13:56:10,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 13:56:10,006 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:10,007 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] [2020-12-23 13:56:10,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-23 13:56:10,007 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]=== [2020-12-23 13:56:10,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:10,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1277136462, now seen corresponding path program 1 times [2020-12-23 13:56:10,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:10,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175384534] [2020-12-23 13:56:10,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:10,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:56:10,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175384534] [2020-12-23 13:56:10,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:10,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 13:56:10,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251844721] [2020-12-23 13:56:10,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 13:56:10,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:10,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 13:56:10,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-23 13:56:10,409 INFO L87 Difference]: Start difference. First operand 3466 states and 11151 transitions. Second operand 12 states. [2020-12-23 13:56:12,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:12,132 INFO L93 Difference]: Finished difference Result 10274 states and 33203 transitions. [2020-12-23 13:56:12,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 13:56:12,133 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-12-23 13:56:12,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:12,153 INFO L225 Difference]: With dead ends: 10274 [2020-12-23 13:56:12,154 INFO L226 Difference]: Without dead ends: 10274 [2020-12-23 13:56:12,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2020-12-23 13:56:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10274 states. [2020-12-23 13:56:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10274 to 7747. [2020-12-23 13:56:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7747 states. [2020-12-23 13:56:12,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7747 states to 7747 states and 25730 transitions. [2020-12-23 13:56:12,319 INFO L78 Accepts]: Start accepts. Automaton has 7747 states and 25730 transitions. Word has length 30 [2020-12-23 13:56:12,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:12,319 INFO L481 AbstractCegarLoop]: Abstraction has 7747 states and 25730 transitions. [2020-12-23 13:56:12,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 13:56:12,319 INFO L276 IsEmpty]: Start isEmpty. Operand 7747 states and 25730 transitions. [2020-12-23 13:56:12,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 13:56:12,328 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:12,328 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] [2020-12-23 13:56:12,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-23 13:56:12,328 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]=== [2020-12-23 13:56:12,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:12,329 INFO L82 PathProgramCache]: Analyzing trace with hash 393782995, now seen corresponding path program 1 times [2020-12-23 13:56:12,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:12,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075111337] [2020-12-23 13:56:12,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:56:12,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075111337] [2020-12-23 13:56:12,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:12,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 13:56:12,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361356416] [2020-12-23 13:56:12,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 13:56:12,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:12,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 13:56:12,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-12-23 13:56:12,721 INFO L87 Difference]: Start difference. First operand 7747 states and 25730 transitions. Second operand 13 states. [2020-12-23 13:56:14,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:14,957 INFO L93 Difference]: Finished difference Result 15340 states and 50453 transitions. [2020-12-23 13:56:14,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 13:56:14,958 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-12-23 13:56:14,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:14,993 INFO L225 Difference]: With dead ends: 15340 [2020-12-23 13:56:14,993 INFO L226 Difference]: Without dead ends: 15340 [2020-12-23 13:56:14,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2020-12-23 13:56:15,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15340 states. [2020-12-23 13:56:15,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15340 to 10253. [2020-12-23 13:56:15,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10253 states. [2020-12-23 13:56:15,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10253 states to 10253 states and 34150 transitions. [2020-12-23 13:56:15,208 INFO L78 Accepts]: Start accepts. Automaton has 10253 states and 34150 transitions. Word has length 30 [2020-12-23 13:56:15,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:15,208 INFO L481 AbstractCegarLoop]: Abstraction has 10253 states and 34150 transitions. [2020-12-23 13:56:15,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 13:56:15,208 INFO L276 IsEmpty]: Start isEmpty. Operand 10253 states and 34150 transitions. [2020-12-23 13:56:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 13:56:15,222 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:15,222 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] [2020-12-23 13:56:15,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-23 13:56:15,223 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]=== [2020-12-23 13:56:15,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:15,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1198627466, now seen corresponding path program 2 times [2020-12-23 13:56:15,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:15,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412059932] [2020-12-23 13:56:15,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:56:15,601 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412059932] [2020-12-23 13:56:15,601 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:15,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 13:56:15,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518762284] [2020-12-23 13:56:15,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 13:56:15,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:15,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 13:56:15,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-12-23 13:56:15,602 INFO L87 Difference]: Start difference. First operand 10253 states and 34150 transitions. Second operand 12 states. [2020-12-23 13:56:18,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:18,490 INFO L93 Difference]: Finished difference Result 19078 states and 63416 transitions. [2020-12-23 13:56:18,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-12-23 13:56:18,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-12-23 13:56:18,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:18,531 INFO L225 Difference]: With dead ends: 19078 [2020-12-23 13:56:18,531 INFO L226 Difference]: Without dead ends: 19078 [2020-12-23 13:56:18,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=593, Unknown=0, NotChecked=0, Total=812 [2020-12-23 13:56:18,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19078 states. [2020-12-23 13:56:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19078 to 10881. [2020-12-23 13:56:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10881 states. [2020-12-23 13:56:18,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10881 states to 10881 states and 36512 transitions. [2020-12-23 13:56:18,924 INFO L78 Accepts]: Start accepts. Automaton has 10881 states and 36512 transitions. Word has length 30 [2020-12-23 13:56:18,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:18,924 INFO L481 AbstractCegarLoop]: Abstraction has 10881 states and 36512 transitions. [2020-12-23 13:56:18,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 13:56:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 10881 states and 36512 transitions. [2020-12-23 13:56:18,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 13:56:18,941 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:18,941 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] [2020-12-23 13:56:18,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2020-12-23 13:56:18,942 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]=== [2020-12-23 13:56:18,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:18,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1286895244, now seen corresponding path program 3 times [2020-12-23 13:56:18,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:18,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957687970] [2020-12-23 13:56:18,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:56:19,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957687970] [2020-12-23 13:56:19,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:19,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-23 13:56:19,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608140902] [2020-12-23 13:56:19,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-23 13:56:19,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:19,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-23 13:56:19,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-12-23 13:56:19,282 INFO L87 Difference]: Start difference. First operand 10881 states and 36512 transitions. Second operand 12 states. [2020-12-23 13:56:21,786 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2020-12-23 13:56:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:22,659 INFO L93 Difference]: Finished difference Result 19831 states and 65965 transitions. [2020-12-23 13:56:22,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-23 13:56:22,660 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2020-12-23 13:56:22,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:22,704 INFO L225 Difference]: With dead ends: 19831 [2020-12-23 13:56:22,705 INFO L226 Difference]: Without dead ends: 19831 [2020-12-23 13:56:22,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2020-12-23 13:56:22,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19831 states. [2020-12-23 13:56:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19831 to 9729. [2020-12-23 13:56:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9729 states. [2020-12-23 13:56:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9729 states to 9729 states and 32472 transitions. [2020-12-23 13:56:22,947 INFO L78 Accepts]: Start accepts. Automaton has 9729 states and 32472 transitions. Word has length 30 [2020-12-23 13:56:22,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:22,948 INFO L481 AbstractCegarLoop]: Abstraction has 9729 states and 32472 transitions. [2020-12-23 13:56:22,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-23 13:56:22,948 INFO L276 IsEmpty]: Start isEmpty. Operand 9729 states and 32472 transitions. [2020-12-23 13:56:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 13:56:22,961 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:22,961 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] [2020-12-23 13:56:22,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2020-12-23 13:56:22,961 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]=== [2020-12-23 13:56:22,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:22,961 INFO L82 PathProgramCache]: Analyzing trace with hash 562314729, now seen corresponding path program 2 times [2020-12-23 13:56:22,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:22,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328316937] [2020-12-23 13:56:22,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:56:23,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328316937] [2020-12-23 13:56:23,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:23,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 13:56:23,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174646719] [2020-12-23 13:56:23,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 13:56:23,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:23,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 13:56:23,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2020-12-23 13:56:23,342 INFO L87 Difference]: Start difference. First operand 9729 states and 32472 transitions. Second operand 13 states. [2020-12-23 13:56:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:26,662 INFO L93 Difference]: Finished difference Result 16868 states and 55552 transitions. [2020-12-23 13:56:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-23 13:56:26,663 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-12-23 13:56:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:26,692 INFO L225 Difference]: With dead ends: 16868 [2020-12-23 13:56:26,693 INFO L226 Difference]: Without dead ends: 16868 [2020-12-23 13:56:26,693 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=275, Invalid=717, Unknown=0, NotChecked=0, Total=992 [2020-12-23 13:56:26,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16868 states. [2020-12-23 13:56:26,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16868 to 9849. [2020-12-23 13:56:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9849 states. [2020-12-23 13:56:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 32878 transitions. [2020-12-23 13:56:26,893 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 32878 transitions. Word has length 30 [2020-12-23 13:56:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:26,893 INFO L481 AbstractCegarLoop]: Abstraction has 9849 states and 32878 transitions. [2020-12-23 13:56:26,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 13:56:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 32878 transitions. [2020-12-23 13:56:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 13:56:26,904 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:26,904 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] [2020-12-23 13:56:26,904 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2020-12-23 13:56:26,904 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]=== [2020-12-23 13:56:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash -722228073, now seen corresponding path program 3 times [2020-12-23 13:56:26,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:26,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383789006] [2020-12-23 13:56:26,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:56:27,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383789006] [2020-12-23 13:56:27,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:27,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 13:56:27,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367013943] [2020-12-23 13:56:27,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 13:56:27,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:27,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 13:56:27,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-12-23 13:56:27,292 INFO L87 Difference]: Start difference. First operand 9849 states and 32878 transitions. Second operand 13 states. [2020-12-23 13:56:31,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:31,017 INFO L93 Difference]: Finished difference Result 18703 states and 61851 transitions. [2020-12-23 13:56:31,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-12-23 13:56:31,018 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-12-23 13:56:31,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:31,057 INFO L225 Difference]: With dead ends: 18703 [2020-12-23 13:56:31,057 INFO L226 Difference]: Without dead ends: 18703 [2020-12-23 13:56:31,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=319, Invalid=871, Unknown=0, NotChecked=0, Total=1190 [2020-12-23 13:56:31,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18703 states. [2020-12-23 13:56:31,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18703 to 9953. [2020-12-23 13:56:31,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9953 states. [2020-12-23 13:56:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9953 states to 9953 states and 33250 transitions. [2020-12-23 13:56:31,341 INFO L78 Accepts]: Start accepts. Automaton has 9953 states and 33250 transitions. Word has length 30 [2020-12-23 13:56:31,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:31,342 INFO L481 AbstractCegarLoop]: Abstraction has 9953 states and 33250 transitions. [2020-12-23 13:56:31,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 13:56:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 9953 states and 33250 transitions. [2020-12-23 13:56:31,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 13:56:31,354 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:31,354 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] [2020-12-23 13:56:31,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2020-12-23 13:56:31,354 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]=== [2020-12-23 13:56:31,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:31,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1184193409, now seen corresponding path program 4 times [2020-12-23 13:56:31,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:31,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852553598] [2020-12-23 13:56:31,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:31,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:56:31,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852553598] [2020-12-23 13:56:31,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:31,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 13:56:31,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795431547] [2020-12-23 13:56:31,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 13:56:31,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:31,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 13:56:31,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-12-23 13:56:31,780 INFO L87 Difference]: Start difference. First operand 9953 states and 33250 transitions. Second operand 13 states. [2020-12-23 13:56:34,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:34,238 INFO L93 Difference]: Finished difference Result 13392 states and 44102 transitions. [2020-12-23 13:56:34,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 13:56:34,239 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-12-23 13:56:34,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:34,264 INFO L225 Difference]: With dead ends: 13392 [2020-12-23 13:56:34,264 INFO L226 Difference]: Without dead ends: 13392 [2020-12-23 13:56:34,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2020-12-23 13:56:34,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13392 states. [2020-12-23 13:56:34,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13392 to 9593. [2020-12-23 13:56:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9593 states. [2020-12-23 13:56:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9593 states to 9593 states and 32170 transitions. [2020-12-23 13:56:34,562 INFO L78 Accepts]: Start accepts. Automaton has 9593 states and 32170 transitions. Word has length 30 [2020-12-23 13:56:34,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:34,562 INFO L481 AbstractCegarLoop]: Abstraction has 9593 states and 32170 transitions. [2020-12-23 13:56:34,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 13:56:34,562 INFO L276 IsEmpty]: Start isEmpty. Operand 9593 states and 32170 transitions. [2020-12-23 13:56:34,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 13:56:34,574 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:34,574 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] [2020-12-23 13:56:34,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2020-12-23 13:56:34,574 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]=== [2020-12-23 13:56:34,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:34,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1639413206, now seen corresponding path program 4 times [2020-12-23 13:56:34,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:34,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286166480] [2020-12-23 13:56:34,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:35,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:56:35,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286166480] [2020-12-23 13:56:35,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:35,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-23 13:56:35,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963860380] [2020-12-23 13:56:35,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 13:56:35,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:35,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 13:56:35,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-12-23 13:56:35,066 INFO L87 Difference]: Start difference. First operand 9593 states and 32170 transitions. Second operand 13 states. [2020-12-23 13:56:36,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:36,950 INFO L93 Difference]: Finished difference Result 16478 states and 54491 transitions. [2020-12-23 13:56:36,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 13:56:36,951 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2020-12-23 13:56:36,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:36,985 INFO L225 Difference]: With dead ends: 16478 [2020-12-23 13:56:36,985 INFO L226 Difference]: Without dead ends: 16478 [2020-12-23 13:56:36,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=162, Invalid=390, Unknown=0, NotChecked=0, Total=552 [2020-12-23 13:56:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16478 states. [2020-12-23 13:56:37,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16478 to 9309. [2020-12-23 13:56:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9309 states. [2020-12-23 13:56:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9309 states to 9309 states and 31271 transitions. [2020-12-23 13:56:37,313 INFO L78 Accepts]: Start accepts. Automaton has 9309 states and 31271 transitions. Word has length 30 [2020-12-23 13:56:37,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:37,313 INFO L481 AbstractCegarLoop]: Abstraction has 9309 states and 31271 transitions. [2020-12-23 13:56:37,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 13:56:37,314 INFO L276 IsEmpty]: Start isEmpty. Operand 9309 states and 31271 transitions. [2020-12-23 13:56:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-12-23 13:56:37,323 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:37,323 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] [2020-12-23 13:56:37,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2020-12-23 13:56:37,324 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]=== [2020-12-23 13:56:37,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:37,324 INFO L82 PathProgramCache]: Analyzing trace with hash 756059739, now seen corresponding path program 5 times [2020-12-23 13:56:37,324 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:37,325 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779262559] [2020-12-23 13:56:37,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:37,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:56:37,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779262559] [2020-12-23 13:56:37,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:37,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-23 13:56:37,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693833615] [2020-12-23 13:56:37,770 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-12-23 13:56:37,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:37,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-12-23 13:56:37,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-12-23 13:56:37,771 INFO L87 Difference]: Start difference. First operand 9309 states and 31271 transitions. Second operand 14 states. [2020-12-23 13:56:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:40,007 INFO L93 Difference]: Finished difference Result 14098 states and 46557 transitions. [2020-12-23 13:56:40,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 13:56:40,008 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2020-12-23 13:56:40,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:40,034 INFO L225 Difference]: With dead ends: 14098 [2020-12-23 13:56:40,034 INFO L226 Difference]: Without dead ends: 14098 [2020-12-23 13:56:40,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2020-12-23 13:56:40,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14098 states. [2020-12-23 13:56:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14098 to 8187. [2020-12-23 13:56:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8187 states. [2020-12-23 13:56:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8187 states to 8187 states and 27721 transitions. [2020-12-23 13:56:40,223 INFO L78 Accepts]: Start accepts. Automaton has 8187 states and 27721 transitions. Word has length 30 [2020-12-23 13:56:40,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:40,223 INFO L481 AbstractCegarLoop]: Abstraction has 8187 states and 27721 transitions. [2020-12-23 13:56:40,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-12-23 13:56:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 8187 states and 27721 transitions. [2020-12-23 13:56:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 13:56:40,230 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:40,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, 1, 1, 1, 1, 1, 1] [2020-12-23 13:56:40,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2020-12-23 13:56:40,231 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]=== [2020-12-23 13:56:40,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:40,231 INFO L82 PathProgramCache]: Analyzing trace with hash -105840897, now seen corresponding path program 1 times [2020-12-23 13:56:40,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:40,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604211428] [2020-12-23 13:56:40,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:41,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:56:41,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604211428] [2020-12-23 13:56:41,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:41,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-12-23 13:56:41,414 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851642483] [2020-12-23 13:56:41,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-23 13:56:41,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:41,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-23 13:56:41,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2020-12-23 13:56:41,415 INFO L87 Difference]: Start difference. First operand 8187 states and 27721 transitions. Second operand 19 states. [2020-12-23 13:56:42,263 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2020-12-23 13:56:42,552 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2020-12-23 13:56:42,898 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2020-12-23 13:56:43,184 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2020-12-23 13:56:43,403 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2020-12-23 13:56:43,732 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2020-12-23 13:56:44,146 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 56 [2020-12-23 13:56:44,882 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 69 [2020-12-23 13:56:45,418 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2020-12-23 13:56:45,688 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2020-12-23 13:56:46,008 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2020-12-23 13:56:46,352 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2020-12-23 13:56:46,524 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2020-12-23 13:56:46,783 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 59 [2020-12-23 13:56:46,974 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2020-12-23 13:56:47,203 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2020-12-23 13:56:47,457 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2020-12-23 13:56:47,752 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2020-12-23 13:56:48,020 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2020-12-23 13:56:48,352 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2020-12-23 13:56:48,631 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2020-12-23 13:56:49,071 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 78 [2020-12-23 13:56:49,365 WARN L197 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 77 [2020-12-23 13:56:50,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:50,030 INFO L93 Difference]: Finished difference Result 9364 states and 31204 transitions. [2020-12-23 13:56:50,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-12-23 13:56:50,031 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2020-12-23 13:56:50,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:50,049 INFO L225 Difference]: With dead ends: 9364 [2020-12-23 13:56:50,049 INFO L226 Difference]: Without dead ends: 9297 [2020-12-23 13:56:50,050 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=665, Invalid=1591, Unknown=0, NotChecked=0, Total=2256 [2020-12-23 13:56:50,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9297 states. [2020-12-23 13:56:50,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9297 to 8341. [2020-12-23 13:56:50,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8341 states. [2020-12-23 13:56:50,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8341 states to 8341 states and 28183 transitions. [2020-12-23 13:56:50,189 INFO L78 Accepts]: Start accepts. Automaton has 8341 states and 28183 transitions. Word has length 31 [2020-12-23 13:56:50,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:50,189 INFO L481 AbstractCegarLoop]: Abstraction has 8341 states and 28183 transitions. [2020-12-23 13:56:50,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-23 13:56:50,190 INFO L276 IsEmpty]: Start isEmpty. Operand 8341 states and 28183 transitions. [2020-12-23 13:56:50,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 13:56:50,197 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:50,197 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] [2020-12-23 13:56:50,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2020-12-23 13:56:50,198 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]=== [2020-12-23 13:56:50,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:50,198 INFO L82 PathProgramCache]: Analyzing trace with hash 765521199, now seen corresponding path program 2 times [2020-12-23 13:56:50,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:50,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473331876] [2020-12-23 13:56:50,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:56:51,098 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2020-12-23 13:56:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:56:51,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473331876] [2020-12-23 13:56:51,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:56:51,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-12-23 13:56:51,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506463510] [2020-12-23 13:56:51,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-23 13:56:51,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:56:51,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-23 13:56:51,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2020-12-23 13:56:51,289 INFO L87 Difference]: Start difference. First operand 8341 states and 28183 transitions. Second operand 19 states. [2020-12-23 13:56:52,018 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2020-12-23 13:56:52,256 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2020-12-23 13:56:52,531 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2020-12-23 13:56:52,883 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-12-23 13:56:53,186 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2020-12-23 13:56:53,406 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2020-12-23 13:56:53,806 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2020-12-23 13:56:54,279 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2020-12-23 13:56:55,143 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2020-12-23 13:56:55,387 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2020-12-23 13:56:55,730 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2020-12-23 13:56:56,022 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2020-12-23 13:56:56,362 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 60 [2020-12-23 13:56:56,716 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2020-12-23 13:56:57,006 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2020-12-23 13:56:57,254 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2020-12-23 13:56:57,603 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 67 [2020-12-23 13:56:57,980 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 69 [2020-12-23 13:56:58,524 WARN L197 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-23 13:56:58,852 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-12-23 13:56:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:56:59,159 INFO L93 Difference]: Finished difference Result 10002 states and 33142 transitions. [2020-12-23 13:56:59,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-12-23 13:56:59,160 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2020-12-23 13:56:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:56:59,179 INFO L225 Difference]: With dead ends: 10002 [2020-12-23 13:56:59,179 INFO L226 Difference]: Without dead ends: 9931 [2020-12-23 13:56:59,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=624, Invalid=1538, Unknown=0, NotChecked=0, Total=2162 [2020-12-23 13:56:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9931 states. [2020-12-23 13:56:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9931 to 8377. [2020-12-23 13:56:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8377 states. [2020-12-23 13:56:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8377 states to 8377 states and 28291 transitions. [2020-12-23 13:56:59,342 INFO L78 Accepts]: Start accepts. Automaton has 8377 states and 28291 transitions. Word has length 31 [2020-12-23 13:56:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:56:59,343 INFO L481 AbstractCegarLoop]: Abstraction has 8377 states and 28291 transitions. [2020-12-23 13:56:59,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-23 13:56:59,343 INFO L276 IsEmpty]: Start isEmpty. Operand 8377 states and 28291 transitions. [2020-12-23 13:56:59,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 13:56:59,351 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:56:59,351 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] [2020-12-23 13:56:59,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2020-12-23 13:56:59,351 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]=== [2020-12-23 13:56:59,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:56:59,352 INFO L82 PathProgramCache]: Analyzing trace with hash -594683273, now seen corresponding path program 3 times [2020-12-23 13:56:59,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:56:59,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671293340] [2020-12-23 13:56:59,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:56:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:57:00,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:57:00,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671293340] [2020-12-23 13:57:00,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:57:00,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-12-23 13:57:00,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565093376] [2020-12-23 13:57:00,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-23 13:57:00,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:57:00,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-23 13:57:00,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2020-12-23 13:57:00,571 INFO L87 Difference]: Start difference. First operand 8377 states and 28291 transitions. Second operand 20 states. [2020-12-23 13:57:01,218 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2020-12-23 13:57:01,473 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2020-12-23 13:57:01,766 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2020-12-23 13:57:02,285 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2020-12-23 13:57:02,724 WARN L197 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 54 [2020-12-23 13:57:03,135 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 59 [2020-12-23 13:57:03,772 WARN L197 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2020-12-23 13:57:04,285 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-12-23 13:57:04,557 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2020-12-23 13:57:04,864 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 59 [2020-12-23 13:57:05,313 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 58 [2020-12-23 13:57:05,657 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 62 [2020-12-23 13:57:06,014 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 67 [2020-12-23 13:57:06,499 WARN L197 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 69 [2020-12-23 13:57:06,747 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2020-12-23 13:57:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:57:07,437 INFO L93 Difference]: Finished difference Result 9385 states and 31267 transitions. [2020-12-23 13:57:07,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-12-23 13:57:07,438 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2020-12-23 13:57:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:57:07,456 INFO L225 Difference]: With dead ends: 9385 [2020-12-23 13:57:07,456 INFO L226 Difference]: Without dead ends: 9318 [2020-12-23 13:57:07,456 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=415, Invalid=1145, Unknown=0, NotChecked=0, Total=1560 [2020-12-23 13:57:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9318 states. [2020-12-23 13:57:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9318 to 8384. [2020-12-23 13:57:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8384 states. [2020-12-23 13:57:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8384 states to 8384 states and 28312 transitions. [2020-12-23 13:57:07,666 INFO L78 Accepts]: Start accepts. Automaton has 8384 states and 28312 transitions. Word has length 31 [2020-12-23 13:57:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:57:07,667 INFO L481 AbstractCegarLoop]: Abstraction has 8384 states and 28312 transitions. [2020-12-23 13:57:07,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-23 13:57:07,667 INFO L276 IsEmpty]: Start isEmpty. Operand 8384 states and 28312 transitions. [2020-12-23 13:57:07,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 13:57:07,676 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:57:07,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, 1, 1, 1, 1] [2020-12-23 13:57:07,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2020-12-23 13:57:07,676 INFO L429 AbstractCegarLoop]: === Iteration 50 === [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]=== [2020-12-23 13:57:07,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:57:07,677 INFO L82 PathProgramCache]: Analyzing trace with hash 647737927, now seen corresponding path program 4 times [2020-12-23 13:57:07,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:57:07,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714988284] [2020-12-23 13:57:07,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:57:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:57:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:57:09,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714988284] [2020-12-23 13:57:09,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:57:09,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-12-23 13:57:09,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83471888] [2020-12-23 13:57:09,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-12-23 13:57:09,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:57:09,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-12-23 13:57:09,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2020-12-23 13:57:09,061 INFO L87 Difference]: Start difference. First operand 8384 states and 28312 transitions. Second operand 20 states. [2020-12-23 13:57:09,765 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 38 [2020-12-23 13:57:10,048 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 42 [2020-12-23 13:57:10,375 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2020-12-23 13:57:11,008 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2020-12-23 13:57:11,457 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2020-12-23 13:57:12,022 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 63 [2020-12-23 13:57:12,812 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 67 [2020-12-23 13:57:13,341 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 57 [2020-12-23 13:57:13,555 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2020-12-23 13:57:13,861 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2020-12-23 13:57:14,235 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2020-12-23 13:57:14,763 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2020-12-23 13:57:15,161 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 69 [2020-12-23 13:57:15,570 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2020-12-23 13:57:16,120 WARN L197 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2020-12-23 13:57:16,402 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 75 [2020-12-23 13:57:16,734 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2020-12-23 13:57:16,990 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2020-12-23 13:57:17,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:57:17,759 INFO L93 Difference]: Finished difference Result 9519 states and 31687 transitions. [2020-12-23 13:57:17,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-12-23 13:57:17,760 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2020-12-23 13:57:17,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:57:17,778 INFO L225 Difference]: With dead ends: 9519 [2020-12-23 13:57:17,778 INFO L226 Difference]: Without dead ends: 9452 [2020-12-23 13:57:17,779 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=475, Invalid=1331, Unknown=0, NotChecked=0, Total=1806 [2020-12-23 13:57:17,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9452 states. [2020-12-23 13:57:17,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9452 to 8401. [2020-12-23 13:57:17,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8401 states. [2020-12-23 13:57:17,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8401 states to 8401 states and 28363 transitions. [2020-12-23 13:57:17,920 INFO L78 Accepts]: Start accepts. Automaton has 8401 states and 28363 transitions. Word has length 31 [2020-12-23 13:57:17,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:57:17,920 INFO L481 AbstractCegarLoop]: Abstraction has 8401 states and 28363 transitions. [2020-12-23 13:57:17,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-12-23 13:57:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand 8401 states and 28363 transitions. [2020-12-23 13:57:17,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 13:57:17,929 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:57:17,929 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] [2020-12-23 13:57:17,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2020-12-23 13:57:17,929 INFO L429 AbstractCegarLoop]: === Iteration 51 === [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]=== [2020-12-23 13:57:17,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:57:17,929 INFO L82 PathProgramCache]: Analyzing trace with hash -200432975, now seen corresponding path program 5 times [2020-12-23 13:57:17,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:57:17,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437490510] [2020-12-23 13:57:17,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:57:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:57:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:57:19,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437490510] [2020-12-23 13:57:19,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:57:19,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-12-23 13:57:19,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566251656] [2020-12-23 13:57:19,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-23 13:57:19,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:57:19,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-23 13:57:19,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2020-12-23 13:57:19,082 INFO L87 Difference]: Start difference. First operand 8401 states and 28363 transitions. Second operand 19 states. [2020-12-23 13:57:19,979 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2020-12-23 13:57:20,267 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2020-12-23 13:57:20,606 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2020-12-23 13:57:21,248 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2020-12-23 13:57:21,766 WARN L197 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2020-12-23 13:57:22,344 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2020-12-23 13:57:23,294 WARN L197 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 65 [2020-12-23 13:57:23,524 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2020-12-23 13:57:23,829 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2020-12-23 13:57:24,067 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2020-12-23 13:57:24,407 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2020-12-23 13:57:24,814 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2020-12-23 13:57:25,340 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2020-12-23 13:57:25,743 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 71 [2020-12-23 13:57:26,173 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 76 [2020-12-23 13:57:26,699 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 73 [2020-12-23 13:57:27,008 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 62 [2020-12-23 13:57:27,428 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-12-23 13:57:28,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:57:28,029 INFO L93 Difference]: Finished difference Result 9922 states and 32882 transitions. [2020-12-23 13:57:28,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-12-23 13:57:28,031 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 31 [2020-12-23 13:57:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:57:28,050 INFO L225 Difference]: With dead ends: 9922 [2020-12-23 13:57:28,050 INFO L226 Difference]: Without dead ends: 9851 [2020-12-23 13:57:28,050 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=546, Invalid=1434, Unknown=0, NotChecked=0, Total=1980 [2020-12-23 13:57:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9851 states. [2020-12-23 13:57:28,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9851 to 8397. [2020-12-23 13:57:28,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8397 states. [2020-12-23 13:57:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8397 states to 8397 states and 28351 transitions. [2020-12-23 13:57:28,193 INFO L78 Accepts]: Start accepts. Automaton has 8397 states and 28351 transitions. Word has length 31 [2020-12-23 13:57:28,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:57:28,193 INFO L481 AbstractCegarLoop]: Abstraction has 8397 states and 28351 transitions. [2020-12-23 13:57:28,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-23 13:57:28,193 INFO L276 IsEmpty]: Start isEmpty. Operand 8397 states and 28351 transitions. [2020-12-23 13:57:28,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-12-23 13:57:28,201 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:57:28,202 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] [2020-12-23 13:57:28,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2020-12-23 13:57:28,202 INFO L429 AbstractCegarLoop]: === Iteration 52 === [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]=== [2020-12-23 13:57:28,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:57:28,202 INFO L82 PathProgramCache]: Analyzing trace with hash 26460543, now seen corresponding path program 6 times [2020-12-23 13:57:28,202 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:57:28,202 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311279589] [2020-12-23 13:57:28,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:57:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:57:29,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:57:29,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311279589] [2020-12-23 13:57:29,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:57:29,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-12-23 13:57:29,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815354901] [2020-12-23 13:57:29,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-12-23 13:57:29,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:57:29,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-12-23 13:57:29,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2020-12-23 13:57:29,169 INFO L87 Difference]: Start difference. First operand 8397 states and 28351 transitions. Second operand 18 states. [2020-12-23 13:57:29,808 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2020-12-23 13:57:30,064 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2020-12-23 13:57:30,354 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2020-12-23 13:57:30,856 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2020-12-23 13:57:31,234 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2020-12-23 13:57:32,094 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2020-12-23 13:57:32,370 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2020-12-23 13:57:32,625 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2020-12-23 13:57:32,914 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2020-12-23 13:57:33,323 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2020-12-23 13:57:33,665 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2020-12-23 13:57:33,909 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2020-12-23 13:57:34,506 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 69