/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-8a14012e553caa636f65c1137831746b6d9875cd-8a14012 [2021-08-06 13:54:57,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-06 13:54:57,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-06 13:54:57,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-06 13:54:57,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-06 13:54:57,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-06 13:54:57,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-06 13:54:57,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-06 13:54:57,980 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-06 13:54:57,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-06 13:54:57,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-06 13:54:57,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-06 13:54:57,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-06 13:54:57,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-06 13:54:57,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-06 13:54:57,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-06 13:54:57,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-06 13:54:57,997 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-06 13:54:57,999 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-06 13:54:58,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-06 13:54:58,005 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-06 13:54:58,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-06 13:54:58,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-06 13:54:58,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-06 13:54:58,015 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-06 13:54:58,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-06 13:54:58,016 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-06 13:54:58,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-06 13:54:58,017 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-06 13:54:58,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-06 13:54:58,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-06 13:54:58,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-06 13:54:58,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-06 13:54:58,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-06 13:54:58,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-06 13:54:58,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-06 13:54:58,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-06 13:54:58,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-06 13:54:58,021 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-06 13:54:58,022 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-06 13:54:58,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-06 13:54:58,026 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2021-08-06 13:54:58,057 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-06 13:54:58,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-06 13:54:58,058 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-06 13:54:58,058 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-06 13:54:58,061 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-06 13:54:58,061 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-06 13:54:58,061 INFO L138 SettingsManager]: * Use SBE=true [2021-08-06 13:54:58,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-06 13:54:58,062 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-06 13:54:58,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-06 13:54:58,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-06 13:54:58,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-06 13:54:58,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-06 13:54:58,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-06 13:54:58,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-06 13:54:58,063 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-06 13:54:58,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-06 13:54:58,063 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-06 13:54:58,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-06 13:54:58,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-06 13:54:58,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-06 13:54:58,064 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-06 13:54:58,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-06 13:54:58,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 13:54:58,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-06 13:54:58,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-06 13:54:58,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-06 13:54:58,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-06 13:54:58,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-06 13:54:58,065 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-06 13:54:58,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-06 13:54:58,066 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-08-06 13:54:58,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-06 13:54:58,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-06 13:54:58,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-06 13:54:58,420 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-06 13:54:58,420 INFO L275 PluginConnector]: CDTParser initialized [2021-08-06 13:54:58,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2021-08-06 13:54:58,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ded639eff/c0c692029cae4dfa80ab477191efbc82/FLAGe85976c9c [2021-08-06 13:54:59,011 INFO L306 CDTParser]: Found 1 translation units. [2021-08-06 13:54:59,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i [2021-08-06 13:54:59,030 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ded639eff/c0c692029cae4dfa80ab477191efbc82/FLAGe85976c9c [2021-08-06 13:54:59,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ded639eff/c0c692029cae4dfa80ab477191efbc82 [2021-08-06 13:54:59,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-06 13:54:59,313 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-06 13:54:59,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-06 13:54:59,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-06 13:54:59,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-06 13:54:59,320 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 01:54:59" (1/1) ... [2021-08-06 13:54:59,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@290737ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:54:59, skipping insertion in model container [2021-08-06 13:54:59,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.08 01:54:59" (1/1) ... [2021-08-06 13:54:59,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-06 13:54:59,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-06 13:54:59,476 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-08-06 13:54:59,788 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2021-08-06 13:54:59,796 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2021-08-06 13:54:59,796 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2021-08-06 13:54:59,881 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2021-08-06 13:54:59,884 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2021-08-06 13:54:59,886 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2021-08-06 13:54:59,887 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2021-08-06 13:54:59,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 13:54:59,903 INFO L203 MainTranslator]: Completed pre-run [2021-08-06 13:54:59,920 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-08-06 13:54:59,946 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39095,39108] [2021-08-06 13:54:59,947 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39180,39193] [2021-08-06 13:54:59,948 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[39232,39245] [2021-08-06 13:54:59,962 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49388,49401] [2021-08-06 13:54:59,966 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49437,49450] [2021-08-06 13:54:59,969 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49565,49578] [2021-08-06 13:54:59,970 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/ring_2w1r-1.i[49623,49636] [2021-08-06 13:54:59,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-06 13:55:00,041 INFO L208 MainTranslator]: Completed translation [2021-08-06 13:55:00,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:55:00 WrapperNode [2021-08-06 13:55:00,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-06 13:55:00,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-06 13:55:00,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-06 13:55:00,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-06 13:55:00,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:55:00" (1/1) ... [2021-08-06 13:55:00,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:55:00" (1/1) ... [2021-08-06 13:55:00,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-06 13:55:00,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-06 13:55:00,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-06 13:55:00,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-06 13:55:00,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:55:00" (1/1) ... [2021-08-06 13:55:00,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:55:00" (1/1) ... [2021-08-06 13:55:00,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:55:00" (1/1) ... [2021-08-06 13:55:00,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:55:00" (1/1) ... [2021-08-06 13:55:00,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:55:00" (1/1) ... [2021-08-06 13:55:00,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:55:00" (1/1) ... [2021-08-06 13:55:00,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:55:00" (1/1) ... [2021-08-06 13:55:00,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-06 13:55:00,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-06 13:55:00,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-06 13:55:00,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-06 13:55:00,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:55:00" (1/1) ... [2021-08-06 13:55:00,164 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-06 13:55:00,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-06 13:55:00,186 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-06 13:55:00,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-06 13:55:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure reader_two [2021-08-06 13:55:00,233 INFO L138 BoogieDeclarations]: Found implementation of procedure reader_two [2021-08-06 13:55:00,233 INFO L130 BoogieDeclarations]: Found specification of procedure writer_fn [2021-08-06 13:55:00,233 INFO L138 BoogieDeclarations]: Found implementation of procedure writer_fn [2021-08-06 13:55:00,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-06 13:55:00,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-06 13:55:00,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-06 13:55:00,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-06 13:55:00,234 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-08-06 13:55:00,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-06 13:55:00,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-06 13:55:00,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-06 13:55:00,236 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-06 13:55:00,800 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-06 13:55:00,800 INFO L299 CfgBuilder]: Removed 22 assume(true) statements. [2021-08-06 13:55:00,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 01:55:00 BoogieIcfgContainer [2021-08-06 13:55:00,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-06 13:55:00,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-06 13:55:00,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-06 13:55:00,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-06 13:55:00,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.08 01:54:59" (1/3) ... [2021-08-06 13:55:00,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5570c662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 01:55:00, skipping insertion in model container [2021-08-06 13:55:00,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.08 01:55:00" (2/3) ... [2021-08-06 13:55:00,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5570c662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.08 01:55:00, skipping insertion in model container [2021-08-06 13:55:00,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.08 01:55:00" (3/3) ... [2021-08-06 13:55:00,814 INFO L111 eAbstractionObserver]: Analyzing ICFG ring_2w1r-1.i [2021-08-06 13:55:00,818 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-06 13:55:00,818 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-06 13:55:00,818 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2021-08-06 13:55:00,818 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-06 13:55:00,887 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,887 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,887 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,888 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,888 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,889 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,889 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,889 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,889 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,890 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,890 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,890 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,890 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,890 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,891 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,891 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,891 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,891 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,894 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,894 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,894 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,894 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,894 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,894 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,895 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,895 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,895 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,895 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,895 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,895 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,895 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,895 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,895 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,896 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,896 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,896 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,896 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,896 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,896 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,896 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,896 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,897 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,897 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,897 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,897 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,897 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,897 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,897 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,898 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,898 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,898 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,898 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,898 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,898 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,898 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,898 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,898 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,899 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,899 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,899 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,899 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,899 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,899 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,899 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,899 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,900 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,900 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,900 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,900 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,900 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,900 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,900 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,900 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,900 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,901 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,901 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,901 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,901 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,901 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,901 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,901 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,901 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,901 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,902 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,902 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,902 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,902 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,902 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,902 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,902 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,902 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,902 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,903 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,903 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,903 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,903 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,903 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,903 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,903 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,903 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,903 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,903 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,904 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,904 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,904 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,904 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,904 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,904 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,913 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,913 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,913 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,913 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,913 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,913 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,914 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,914 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,914 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,914 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,914 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,915 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,915 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,915 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,915 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,915 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,915 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,915 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,915 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,915 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,916 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,916 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,916 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,916 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,916 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,916 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,916 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,916 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,916 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,917 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,917 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,917 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,917 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,917 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,917 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,917 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,917 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,917 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,918 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,918 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,918 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,919 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,919 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,919 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,919 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,919 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,919 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,919 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,920 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,920 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,920 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,920 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,920 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,920 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,920 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,920 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,921 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,921 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,921 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,921 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,921 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,921 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,922 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,922 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,922 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,922 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,922 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,922 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,922 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,923 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,923 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,923 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,924 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,924 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,924 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,924 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,924 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,924 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,924 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,925 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,925 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,925 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,925 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,925 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,926 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,926 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,927 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,927 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,927 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,927 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,928 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,928 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,928 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,928 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,928 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,929 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,929 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,929 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,929 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,929 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,929 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,930 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,939 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,940 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,940 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,940 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,940 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,940 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,941 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,941 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,941 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,941 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,941 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,941 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,941 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,941 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,942 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,942 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,942 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,942 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,942 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,942 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,942 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,942 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,943 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,943 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,943 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,943 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,943 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,943 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,943 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,943 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,943 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,944 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,944 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,944 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,944 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,944 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,944 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,944 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,944 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,945 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,945 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,945 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,945 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,945 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,945 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,945 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,945 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,946 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,946 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,946 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,946 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,946 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,946 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,946 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,946 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,946 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,947 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,947 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,947 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,947 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,947 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,947 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,947 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,947 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,948 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,948 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,948 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,948 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,948 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,948 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,948 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,948 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,949 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,949 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,949 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,949 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,949 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,949 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,949 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,949 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,950 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,950 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,950 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,950 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,950 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,950 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,950 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,951 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,951 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,951 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,951 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,951 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,952 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,952 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,952 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,952 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,952 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,952 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,955 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,956 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,956 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,956 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,956 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,956 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,957 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,957 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,957 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,957 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,957 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,957 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,957 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,957 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,958 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,958 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,958 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,958 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,958 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,958 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,958 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,959 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,959 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,959 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,959 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,959 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,959 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,959 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,960 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,960 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,960 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,960 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,962 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,967 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,967 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,968 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,968 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,968 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,968 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,968 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,968 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,968 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,968 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,969 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,969 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,969 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,969 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,969 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,970 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,970 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,970 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,970 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,970 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,970 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,970 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,971 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,971 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,971 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,971 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,971 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,971 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,971 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,972 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,972 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,972 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,972 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,972 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,973 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,973 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,973 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,973 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,973 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,973 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,973 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,973 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,974 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,974 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,974 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,974 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,975 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,975 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,975 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,975 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,975 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,975 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,975 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,975 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,976 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,976 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,976 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,976 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,976 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,976 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,976 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,976 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,977 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,977 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,979 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,979 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,979 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,979 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,979 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,979 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,979 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,980 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,980 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,980 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,980 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,980 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,980 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,980 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,980 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,980 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,980 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,981 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,981 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,981 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,981 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,981 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,981 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,981 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,995 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,996 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,996 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,996 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,996 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,996 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,996 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,996 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,996 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:00,999 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,000 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,000 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_~#read~0.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,000 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,000 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,000 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~ret24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,000 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,000 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,000 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,003 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~r~2.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,003 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,004 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,004 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~i~3 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,004 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,005 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~val~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,005 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,005 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,005 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,005 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~pre31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,005 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,005 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,005 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,007 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,008 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_empty_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,009 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_ring_dequeue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,009 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,009 WARN L313 ript$VariableManager]: TermVariabe reader_twoThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,009 WARN L313 ript$VariableManager]: TermVariabe |reader_twoThread1of1ForFork0_ring_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,016 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,016 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,016 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,016 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,016 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,017 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,017 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~pre19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,017 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,017 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,017 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,017 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,017 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,017 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,017 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#in~r.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,017 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~r~1.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,017 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,017 WARN L313 ript$VariableManager]: TermVariabe |writer_fnThread1of1ForFork1_ring_enqueue_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,018 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_ring_enqueue_~r.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,018 WARN L313 ript$VariableManager]: TermVariabe writer_fnThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-06 13:55:01,033 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-08-06 13:55:01,083 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2021-08-06 13:55:01,088 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-06 13:55:01,089 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-08-06 13:55:01,101 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 206 places, 218 transitions, 458 flow [2021-08-06 13:55:01,150 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 508 states, 503 states have (on average 1.8906560636182903) internal successors, (951), 507 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:01,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 508 states, 503 states have (on average 1.8906560636182903) internal successors, (951), 507 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:01,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-06 13:55:01,166 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-06 13:55:01,167 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-06 13:55:01,170 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (1/2) [2021-08-06 13:55:01,172 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == reader_twoThread1of1ForFork0 ======== [2021-08-06 13:55:01,173 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-06 13:55:01,174 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-08-06 13:55:01,177 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 206 places, 218 transitions, 458 flow [2021-08-06 13:55:03,462 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 85060 states, 85056 states have (on average 3.263555775018811) internal successors, (277585), 85059 states have internal predecessors, (277585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 85060 states, 85056 states have (on average 3.263555775018811) internal successors, (277585), 85059 states have internal predecessors, (277585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:03,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-08-06 13:55:03,903 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:55:03,904 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:55:03,906 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 13:55:03,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:55:03,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1691269654, now seen corresponding path program 1 times [2021-08-06 13:55:03,919 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:55:03,919 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578729104] [2021-08-06 13:55:03,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:55:03,920 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:55:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:55:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:55:04,968 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:55:04,968 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578729104] [2021-08-06 13:55:04,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578729104] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:55:04,969 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:55:04,969 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2021-08-06 13:55:04,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790011490] [2021-08-06 13:55:04,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-08-06 13:55:04,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:55:04,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-08-06 13:55:04,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2021-08-06 13:55:05,174 INFO L87 Difference]: Start difference. First operand has 85060 states, 85056 states have (on average 3.263555775018811) internal successors, (277585), 85059 states have internal predecessors, (277585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:55:08,654 INFO L93 Difference]: Finished difference Result 95141 states and 292800 transitions. [2021-08-06 13:55:08,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-06 13:55:08,655 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2021-08-06 13:55:08,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:55:09,340 INFO L225 Difference]: With dead ends: 95141 [2021-08-06 13:55:09,341 INFO L226 Difference]: Without dead ends: 95141 [2021-08-06 13:55:09,342 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1641.5ms TimeCoverageRelationStatistics Valid=375, Invalid=1031, Unknown=0, NotChecked=0, Total=1406 [2021-08-06 13:55:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95141 states. [2021-08-06 13:55:12,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95141 to 90545. [2021-08-06 13:55:13,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90545 states, 90541 states have (on average 3.0790028826719387) internal successors, (278776), 90544 states have internal predecessors, (278776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:13,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90545 states to 90545 states and 278776 transitions. [2021-08-06 13:55:13,600 INFO L78 Accepts]: Start accepts. Automaton has 90545 states and 278776 transitions. Word has length 80 [2021-08-06 13:55:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:55:13,600 INFO L470 AbstractCegarLoop]: Abstraction has 90545 states and 278776 transitions. [2021-08-06 13:55:13,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 19 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:13,601 INFO L276 IsEmpty]: Start isEmpty. Operand 90545 states and 278776 transitions. [2021-08-06 13:55:14,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-06 13:55:14,012 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:55:14,012 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:55:14,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-06 13:55:14,013 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 13:55:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:55:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1395660344, now seen corresponding path program 1 times [2021-08-06 13:55:14,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:55:14,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521396927] [2021-08-06 13:55:14,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:55:14,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:55:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:55:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:55:14,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:55:14,748 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521396927] [2021-08-06 13:55:14,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521396927] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:55:14,749 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:55:14,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-08-06 13:55:14,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875187460] [2021-08-06 13:55:14,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-06 13:55:14,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:55:14,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-06 13:55:14,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2021-08-06 13:55:14,751 INFO L87 Difference]: Start difference. First operand 90545 states and 278776 transitions. Second operand has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:20,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:55:20,427 INFO L93 Difference]: Finished difference Result 192514 states and 593898 transitions. [2021-08-06 13:55:20,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-08-06 13:55:20,427 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-06 13:55:20,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:55:21,826 INFO L225 Difference]: With dead ends: 192514 [2021-08-06 13:55:21,826 INFO L226 Difference]: Without dead ends: 191779 [2021-08-06 13:55:21,827 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 3185.5ms TimeCoverageRelationStatistics Valid=697, Invalid=1753, Unknown=0, NotChecked=0, Total=2450 [2021-08-06 13:55:22,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191779 states. [2021-08-06 13:55:25,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191779 to 113312. [2021-08-06 13:55:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113312 states, 113308 states have (on average 3.0838334451230276) internal successors, (349423), 113311 states have internal predecessors, (349423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:26,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113312 states to 113312 states and 349423 transitions. [2021-08-06 13:55:26,192 INFO L78 Accepts]: Start accepts. Automaton has 113312 states and 349423 transitions. Word has length 85 [2021-08-06 13:55:26,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:55:26,192 INFO L470 AbstractCegarLoop]: Abstraction has 113312 states and 349423 transitions. [2021-08-06 13:55:26,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 113312 states and 349423 transitions. [2021-08-06 13:55:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-06 13:55:26,667 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:55:26,667 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:55:26,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-06 13:55:26,669 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 13:55:26,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:55:26,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1297657036, now seen corresponding path program 2 times [2021-08-06 13:55:26,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:55:26,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570492582] [2021-08-06 13:55:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:55:26,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:55:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:55:27,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:55:27,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:55:27,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570492582] [2021-08-06 13:55:27,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570492582] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:55:27,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:55:27,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-08-06 13:55:27,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117356232] [2021-08-06 13:55:27,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-06 13:55:27,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:55:27,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-06 13:55:27,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2021-08-06 13:55:27,368 INFO L87 Difference]: Start difference. First operand 113312 states and 349423 transitions. Second operand has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:55:33,003 INFO L93 Difference]: Finished difference Result 211765 states and 653124 transitions. [2021-08-06 13:55:33,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-08-06 13:55:33,004 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-06 13:55:33,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:55:34,022 INFO L225 Difference]: With dead ends: 211765 [2021-08-06 13:55:34,022 INFO L226 Difference]: Without dead ends: 211555 [2021-08-06 13:55:34,023 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 3000.5ms TimeCoverageRelationStatistics Valid=653, Invalid=1699, Unknown=0, NotChecked=0, Total=2352 [2021-08-06 13:55:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211555 states. [2021-08-06 13:55:37,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211555 to 111320. [2021-08-06 13:55:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111320 states, 111316 states have (on average 3.0840400301843403) internal successors, (343303), 111319 states have internal predecessors, (343303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111320 states to 111320 states and 343303 transitions. [2021-08-06 13:55:38,417 INFO L78 Accepts]: Start accepts. Automaton has 111320 states and 343303 transitions. Word has length 85 [2021-08-06 13:55:38,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:55:38,418 INFO L470 AbstractCegarLoop]: Abstraction has 111320 states and 343303 transitions. [2021-08-06 13:55:38,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand 111320 states and 343303 transitions. [2021-08-06 13:55:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-06 13:55:38,513 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:55:38,514 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:55:38,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-06 13:55:38,514 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 13:55:38,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:55:38,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1331200176, now seen corresponding path program 3 times [2021-08-06 13:55:38,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:55:38,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912018342] [2021-08-06 13:55:38,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:55:38,518 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:55:38,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:55:39,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:55:39,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:55:39,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912018342] [2021-08-06 13:55:39,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912018342] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:55:39,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:55:39,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2021-08-06 13:55:39,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114178371] [2021-08-06 13:55:39,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-08-06 13:55:39,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:55:39,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-08-06 13:55:39,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2021-08-06 13:55:39,163 INFO L87 Difference]: Start difference. First operand 111320 states and 343303 transitions. Second operand has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:44,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:55:44,357 INFO L93 Difference]: Finished difference Result 199111 states and 614272 transitions. [2021-08-06 13:55:44,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-08-06 13:55:44,357 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-06 13:55:44,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:55:45,090 INFO L225 Difference]: With dead ends: 199111 [2021-08-06 13:55:45,090 INFO L226 Difference]: Without dead ends: 198964 [2021-08-06 13:55:45,091 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2892.8ms TimeCoverageRelationStatistics Valid=615, Invalid=1641, Unknown=0, NotChecked=0, Total=2256 [2021-08-06 13:55:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198964 states. [2021-08-06 13:55:48,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198964 to 110656. [2021-08-06 13:55:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110656 states, 110652 states have (on average 3.0841105447709936) internal successors, (341263), 110655 states have internal predecessors, (341263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110656 states to 110656 states and 341263 transitions. [2021-08-06 13:55:49,441 INFO L78 Accepts]: Start accepts. Automaton has 110656 states and 341263 transitions. Word has length 85 [2021-08-06 13:55:49,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:55:49,442 INFO L470 AbstractCegarLoop]: Abstraction has 110656 states and 341263 transitions. [2021-08-06 13:55:49,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:49,442 INFO L276 IsEmpty]: Start isEmpty. Operand 110656 states and 341263 transitions. [2021-08-06 13:55:49,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-08-06 13:55:49,511 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:55:49,511 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:55:49,511 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-06 13:55:49,511 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 13:55:49,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:55:49,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1499481560, now seen corresponding path program 4 times [2021-08-06 13:55:49,512 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:55:49,512 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934626059] [2021-08-06 13:55:49,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:55:49,512 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:55:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:55:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:55:50,130 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:55:50,130 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934626059] [2021-08-06 13:55:50,130 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934626059] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:55:50,130 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:55:50,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2021-08-06 13:55:50,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138860276] [2021-08-06 13:55:50,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-08-06 13:55:50,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:55:50,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-08-06 13:55:50,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2021-08-06 13:55:50,131 INFO L87 Difference]: Start difference. First operand 110656 states and 341263 transitions. Second operand has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:53,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:55:53,786 INFO L93 Difference]: Finished difference Result 145256 states and 446917 transitions. [2021-08-06 13:55:53,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-08-06 13:55:53,787 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2021-08-06 13:55:53,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:55:54,207 INFO L225 Difference]: With dead ends: 145256 [2021-08-06 13:55:54,207 INFO L226 Difference]: Without dead ends: 144374 [2021-08-06 13:55:54,208 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1994.6ms TimeCoverageRelationStatistics Valid=407, Invalid=1153, Unknown=0, NotChecked=0, Total=1560 [2021-08-06 13:55:54,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144374 states. [2021-08-06 13:55:57,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144374 to 105931. [2021-08-06 13:55:57,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105931 states, 105927 states have (on average 3.08080092894163) internal successors, (326340), 105930 states have internal predecessors, (326340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105931 states to 105931 states and 326340 transitions. [2021-08-06 13:55:57,653 INFO L78 Accepts]: Start accepts. Automaton has 105931 states and 326340 transitions. Word has length 85 [2021-08-06 13:55:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:55:57,653 INFO L470 AbstractCegarLoop]: Abstraction has 105931 states and 326340 transitions. [2021-08-06 13:55:57,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.0476190476190474) internal successors, (85), 21 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:55:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 105931 states and 326340 transitions. [2021-08-06 13:55:57,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-06 13:55:57,749 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:55:57,750 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:55:57,750 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-06 13:55:57,750 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 13:55:57,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:55:57,750 INFO L82 PathProgramCache]: Analyzing trace with hash -188007250, now seen corresponding path program 1 times [2021-08-06 13:55:57,750 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:55:57,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137920181] [2021-08-06 13:55:57,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:55:57,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:55:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:55:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:55:59,453 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:55:59,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137920181] [2021-08-06 13:55:59,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137920181] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:55:59,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:55:59,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-08-06 13:55:59,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440825688] [2021-08-06 13:55:59,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-06 13:55:59,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:55:59,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-06 13:55:59,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2021-08-06 13:55:59,454 INFO L87 Difference]: Start difference. First operand 105931 states and 326340 transitions. Second operand has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:17,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:56:17,664 INFO L93 Difference]: Finished difference Result 146161 states and 449796 transitions. [2021-08-06 13:56:17,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2021-08-06 13:56:17,665 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-06 13:56:17,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:56:18,039 INFO L225 Difference]: With dead ends: 146161 [2021-08-06 13:56:18,039 INFO L226 Difference]: Without dead ends: 146161 [2021-08-06 13:56:18,041 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1693 ImplicationChecksByTransitivity, 14839.8ms TimeCoverageRelationStatistics Valid=3247, Invalid=7883, Unknown=0, NotChecked=0, Total=11130 [2021-08-06 13:56:18,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146161 states. [2021-08-06 13:56:21,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146161 to 123223. [2021-08-06 13:56:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123223 states, 123219 states have (on average 3.0854170217255454) internal successors, (380182), 123222 states have internal predecessors, (380182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123223 states to 123223 states and 380182 transitions. [2021-08-06 13:56:22,680 INFO L78 Accepts]: Start accepts. Automaton has 123223 states and 380182 transitions. Word has length 103 [2021-08-06 13:56:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:56:22,682 INFO L470 AbstractCegarLoop]: Abstraction has 123223 states and 380182 transitions. [2021-08-06 13:56:22,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 123223 states and 380182 transitions. [2021-08-06 13:56:22,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-06 13:56:22,832 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:56:22,833 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:56:22,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-06 13:56:22,834 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 13:56:22,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:56:22,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1065077806, now seen corresponding path program 2 times [2021-08-06 13:56:22,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:56:22,837 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84230898] [2021-08-06 13:56:22,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:56:22,837 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:56:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:56:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:56:24,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:56:24,736 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84230898] [2021-08-06 13:56:24,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84230898] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:56:24,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:56:24,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-08-06 13:56:24,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787287259] [2021-08-06 13:56:24,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-06 13:56:24,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:56:24,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-06 13:56:24,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2021-08-06 13:56:24,738 INFO L87 Difference]: Start difference. First operand 123223 states and 380182 transitions. Second operand has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:49,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:56:49,486 INFO L93 Difference]: Finished difference Result 207443 states and 640014 transitions. [2021-08-06 13:56:49,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2021-08-06 13:56:49,486 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-06 13:56:49,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:56:50,183 INFO L225 Difference]: With dead ends: 207443 [2021-08-06 13:56:50,183 INFO L226 Difference]: Without dead ends: 207443 [2021-08-06 13:56:50,186 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3896 ImplicationChecksByTransitivity, 18830.9ms TimeCoverageRelationStatistics Valid=4955, Invalid=13951, Unknown=0, NotChecked=0, Total=18906 [2021-08-06 13:56:50,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207443 states. [2021-08-06 13:56:53,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207443 to 134743. [2021-08-06 13:56:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134743 states, 134739 states have (on average 3.0867083769361505) internal successors, (415900), 134742 states have internal predecessors, (415900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134743 states to 134743 states and 415900 transitions. [2021-08-06 13:56:54,502 INFO L78 Accepts]: Start accepts. Automaton has 134743 states and 415900 transitions. Word has length 103 [2021-08-06 13:56:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:56:54,502 INFO L470 AbstractCegarLoop]: Abstraction has 134743 states and 415900 transitions. [2021-08-06 13:56:54,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:56:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 134743 states and 415900 transitions. [2021-08-06 13:56:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-06 13:56:55,118 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:56:55,118 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:56:55,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-06 13:56:55,119 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 13:56:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:56:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1043367570, now seen corresponding path program 3 times [2021-08-06 13:56:55,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:56:55,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556057058] [2021-08-06 13:56:55,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:56:55,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:56:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:56:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:56:56,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:56:56,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556057058] [2021-08-06 13:56:56,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556057058] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:56:56,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:56:56,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2021-08-06 13:56:56,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89001503] [2021-08-06 13:56:56,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2021-08-06 13:56:56,221 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:56:56,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-08-06 13:56:56,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2021-08-06 13:56:56,222 INFO L87 Difference]: Start difference. First operand 134743 states and 415900 transitions. Second operand has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:22,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:57:22,370 INFO L93 Difference]: Finished difference Result 204845 states and 631303 transitions. [2021-08-06 13:57:22,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2021-08-06 13:57:22,371 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-06 13:57:22,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:57:22,976 INFO L225 Difference]: With dead ends: 204845 [2021-08-06 13:57:22,976 INFO L226 Difference]: Without dead ends: 204845 [2021-08-06 13:57:22,980 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4609 ImplicationChecksByTransitivity, 19580.7ms TimeCoverageRelationStatistics Valid=5202, Invalid=15678, Unknown=0, NotChecked=0, Total=20880 [2021-08-06 13:57:23,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204845 states. [2021-08-06 13:57:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204845 to 140408. [2021-08-06 13:57:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140408 states, 140404 states have (on average 3.0888578672972278) internal successors, (433688), 140407 states have internal predecessors, (433688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140408 states to 140408 states and 433688 transitions. [2021-08-06 13:57:27,966 INFO L78 Accepts]: Start accepts. Automaton has 140408 states and 433688 transitions. Word has length 103 [2021-08-06 13:57:27,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:57:27,967 INFO L470 AbstractCegarLoop]: Abstraction has 140408 states and 433688 transitions. [2021-08-06 13:57:27,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3225806451612905) internal successors, (103), 31 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:27,967 INFO L276 IsEmpty]: Start isEmpty. Operand 140408 states and 433688 transitions. [2021-08-06 13:57:28,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-06 13:57:28,157 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:57:28,158 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:57:28,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-06 13:57:28,158 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 13:57:28,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:57:28,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1488904782, now seen corresponding path program 4 times [2021-08-06 13:57:28,158 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:57:28,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756848161] [2021-08-06 13:57:28,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:57:28,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:57:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:57:29,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:57:29,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:57:29,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756848161] [2021-08-06 13:57:29,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756848161] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:57:29,112 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:57:29,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-08-06 13:57:29,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150046982] [2021-08-06 13:57:29,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-06 13:57:29,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:57:29,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-06 13:57:29,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2021-08-06 13:57:29,113 INFO L87 Difference]: Start difference. First operand 140408 states and 433688 transitions. Second operand has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:57:45,107 INFO L93 Difference]: Finished difference Result 205544 states and 635213 transitions. [2021-08-06 13:57:45,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2021-08-06 13:57:45,108 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-06 13:57:45,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:57:45,808 INFO L225 Difference]: With dead ends: 205544 [2021-08-06 13:57:45,808 INFO L226 Difference]: Without dead ends: 205544 [2021-08-06 13:57:45,809 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1308 ImplicationChecksByTransitivity, 11417.7ms TimeCoverageRelationStatistics Valid=2606, Invalid=5950, Unknown=0, NotChecked=0, Total=8556 [2021-08-06 13:57:46,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205544 states. [2021-08-06 13:57:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205544 to 140618. [2021-08-06 13:57:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140618 states, 140614 states have (on average 3.088945624191048) internal successors, (434349), 140617 states have internal predecessors, (434349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140618 states to 140618 states and 434349 transitions. [2021-08-06 13:57:50,252 INFO L78 Accepts]: Start accepts. Automaton has 140618 states and 434349 transitions. Word has length 103 [2021-08-06 13:57:50,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:57:50,252 INFO L470 AbstractCegarLoop]: Abstraction has 140618 states and 434349 transitions. [2021-08-06 13:57:50,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:57:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand 140618 states and 434349 transitions. [2021-08-06 13:57:50,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-06 13:57:50,405 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:57:50,405 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:57:50,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-06 13:57:50,405 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 13:57:50,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:57:50,405 INFO L82 PathProgramCache]: Analyzing trace with hash 697617138, now seen corresponding path program 5 times [2021-08-06 13:57:50,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:57:50,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163940254] [2021-08-06 13:57:50,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:57:50,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:57:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:57:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:57:51,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:57:51,680 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163940254] [2021-08-06 13:57:51,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163940254] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:57:51,681 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:57:51,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-08-06 13:57:51,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317240489] [2021-08-06 13:57:51,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-06 13:57:51,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:57:51,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-06 13:57:51,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2021-08-06 13:57:51,682 INFO L87 Difference]: Start difference. First operand 140618 states and 434349 transitions. Second operand has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:58:15,003 INFO L93 Difference]: Finished difference Result 229002 states and 706870 transitions. [2021-08-06 13:58:15,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2021-08-06 13:58:15,004 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-06 13:58:15,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:58:16,152 INFO L225 Difference]: With dead ends: 229002 [2021-08-06 13:58:16,152 INFO L226 Difference]: Without dead ends: 229002 [2021-08-06 13:58:16,154 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3246 ImplicationChecksByTransitivity, 17433.0ms TimeCoverageRelationStatistics Valid=4823, Invalid=12469, Unknown=0, NotChecked=0, Total=17292 [2021-08-06 13:58:16,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229002 states. [2021-08-06 13:58:19,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229002 to 141008. [2021-08-06 13:58:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141008 states, 141004 states have (on average 3.0890045672463193) internal successors, (435562), 141007 states have internal predecessors, (435562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141008 states to 141008 states and 435562 transitions. [2021-08-06 13:58:20,912 INFO L78 Accepts]: Start accepts. Automaton has 141008 states and 435562 transitions. Word has length 103 [2021-08-06 13:58:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:58:20,912 INFO L470 AbstractCegarLoop]: Abstraction has 141008 states and 435562 transitions. [2021-08-06 13:58:20,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 141008 states and 435562 transitions. [2021-08-06 13:58:21,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-06 13:58:21,053 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:58:21,053 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:58:21,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-06 13:58:21,054 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 13:58:21,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:58:21,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1858281620, now seen corresponding path program 6 times [2021-08-06 13:58:21,054 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:58:21,054 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519642099] [2021-08-06 13:58:21,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:58:21,054 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:58:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:58:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:58:22,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:58:22,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519642099] [2021-08-06 13:58:22,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519642099] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:58:22,258 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:58:22,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-08-06 13:58:22,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312137181] [2021-08-06 13:58:22,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-06 13:58:22,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:58:22,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-06 13:58:22,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2021-08-06 13:58:22,259 INFO L87 Difference]: Start difference. First operand 141008 states and 435562 transitions. Second operand has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:33,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:58:33,672 INFO L93 Difference]: Finished difference Result 177974 states and 549850 transitions. [2021-08-06 13:58:33,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-06 13:58:33,673 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-06 13:58:33,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:58:34,193 INFO L225 Difference]: With dead ends: 177974 [2021-08-06 13:58:34,193 INFO L226 Difference]: Without dead ends: 177974 [2021-08-06 13:58:34,193 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 8306.8ms TimeCoverageRelationStatistics Valid=1743, Invalid=4109, Unknown=0, NotChecked=0, Total=5852 [2021-08-06 13:58:34,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177974 states. [2021-08-06 13:58:37,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177974 to 141068. [2021-08-06 13:58:38,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141068 states, 141064 states have (on average 3.0889808881075256) internal successors, (435744), 141067 states have internal predecessors, (435744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141068 states to 141068 states and 435744 transitions. [2021-08-06 13:58:38,518 INFO L78 Accepts]: Start accepts. Automaton has 141068 states and 435744 transitions. Word has length 103 [2021-08-06 13:58:38,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:58:38,518 INFO L470 AbstractCegarLoop]: Abstraction has 141068 states and 435744 transitions. [2021-08-06 13:58:38,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:58:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 141068 states and 435744 transitions. [2021-08-06 13:58:38,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-06 13:58:38,669 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:58:38,669 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:58:38,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-06 13:58:38,669 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 13:58:38,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:58:38,669 INFO L82 PathProgramCache]: Analyzing trace with hash -250163756, now seen corresponding path program 7 times [2021-08-06 13:58:38,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:58:38,670 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921914836] [2021-08-06 13:58:38,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:58:38,670 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:58:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:58:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:58:39,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:58:39,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921914836] [2021-08-06 13:58:39,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921914836] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:58:39,959 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:58:39,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-08-06 13:58:39,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602449571] [2021-08-06 13:58:39,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-06 13:58:39,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:58:39,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-06 13:58:39,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=799, Unknown=0, NotChecked=0, Total=870 [2021-08-06 13:58:39,960 INFO L87 Difference]: Start difference. First operand 141068 states and 435744 transitions. Second operand has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:59:04,503 INFO L93 Difference]: Finished difference Result 234192 states and 724215 transitions. [2021-08-06 13:59:04,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2021-08-06 13:59:04,504 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-06 13:59:04,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:59:05,677 INFO L225 Difference]: With dead ends: 234192 [2021-08-06 13:59:05,677 INFO L226 Difference]: Without dead ends: 234192 [2021-08-06 13:59:05,678 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3265 ImplicationChecksByTransitivity, 17830.3ms TimeCoverageRelationStatistics Valid=4989, Invalid=13101, Unknown=0, NotChecked=0, Total=18090 [2021-08-06 13:59:06,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234192 states. [2021-08-06 13:59:09,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234192 to 141008. [2021-08-06 13:59:09,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141008 states, 141004 states have (on average 3.0890045672463193) internal successors, (435562), 141007 states have internal predecessors, (435562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141008 states to 141008 states and 435562 transitions. [2021-08-06 13:59:10,615 INFO L78 Accepts]: Start accepts. Automaton has 141008 states and 435562 transitions. Word has length 103 [2021-08-06 13:59:10,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:59:10,616 INFO L470 AbstractCegarLoop]: Abstraction has 141008 states and 435562 transitions. [2021-08-06 13:59:10,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 141008 states and 435562 transitions. [2021-08-06 13:59:10,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-08-06 13:59:10,762 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:59:10,762 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:59:10,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-06 13:59:10,762 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 13:59:10,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:59:10,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1291088936, now seen corresponding path program 8 times [2021-08-06 13:59:10,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:59:10,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174956576] [2021-08-06 13:59:10,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:59:10,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:59:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:59:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:59:12,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:59:12,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174956576] [2021-08-06 13:59:12,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174956576] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:59:12,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:59:12,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2021-08-06 13:59:12,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944323809] [2021-08-06 13:59:12,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-08-06 13:59:12,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:59:12,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-08-06 13:59:12,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2021-08-06 13:59:12,079 INFO L87 Difference]: Start difference. First operand 141008 states and 435562 transitions. Second operand has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:37,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:59:37,587 INFO L93 Difference]: Finished difference Result 208543 states and 643760 transitions. [2021-08-06 13:59:37,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2021-08-06 13:59:37,587 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-08-06 13:59:37,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:59:38,217 INFO L225 Difference]: With dead ends: 208543 [2021-08-06 13:59:38,217 INFO L226 Difference]: Without dead ends: 208543 [2021-08-06 13:59:38,219 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5189 ImplicationChecksByTransitivity, 18170.4ms TimeCoverageRelationStatistics Valid=5535, Invalid=17115, Unknown=0, NotChecked=0, Total=22650 [2021-08-06 13:59:39,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208543 states. [2021-08-06 13:59:42,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208543 to 125678. [2021-08-06 13:59:42,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125678 states, 125674 states have (on average 3.0841940258128173) internal successors, (387603), 125677 states have internal predecessors, (387603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125678 states to 125678 states and 387603 transitions. [2021-08-06 13:59:43,462 INFO L78 Accepts]: Start accepts. Automaton has 125678 states and 387603 transitions. Word has length 103 [2021-08-06 13:59:43,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 13:59:43,462 INFO L470 AbstractCegarLoop]: Abstraction has 125678 states and 387603 transitions. [2021-08-06 13:59:43,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:43,463 INFO L276 IsEmpty]: Start isEmpty. Operand 125678 states and 387603 transitions. [2021-08-06 13:59:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-06 13:59:43,617 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 13:59:43,617 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 13:59:43,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-06 13:59:43,618 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 13:59:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 13:59:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash -883897449, now seen corresponding path program 1 times [2021-08-06 13:59:43,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 13:59:43,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443294221] [2021-08-06 13:59:43,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 13:59:43,623 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 13:59:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 13:59:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 13:59:45,661 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 13:59:45,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443294221] [2021-08-06 13:59:45,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443294221] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 13:59:45,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 13:59:45,661 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-06 13:59:45,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715931639] [2021-08-06 13:59:45,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-06 13:59:45,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 13:59:45,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-06 13:59:45,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2021-08-06 13:59:45,663 INFO L87 Difference]: Start difference. First operand 125678 states and 387603 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 13:59:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 13:59:56,509 INFO L93 Difference]: Finished difference Result 264857 states and 817369 transitions. [2021-08-06 13:59:56,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-06 13:59:56,509 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-06 13:59:56,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 13:59:57,743 INFO L225 Difference]: With dead ends: 264857 [2021-08-06 13:59:57,743 INFO L226 Difference]: Without dead ends: 264857 [2021-08-06 13:59:57,745 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 5273.1ms TimeCoverageRelationStatistics Valid=1164, Invalid=5478, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 13:59:58,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264857 states. [2021-08-06 14:00:02,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264857 to 181277. [2021-08-06 14:00:02,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181277 states, 181273 states have (on average 3.0807345826460644) internal successors, (558454), 181276 states have internal predecessors, (558454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181277 states to 181277 states and 558454 transitions. [2021-08-06 14:00:03,819 INFO L78 Accepts]: Start accepts. Automaton has 181277 states and 558454 transitions. Word has length 106 [2021-08-06 14:00:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:00:03,819 INFO L470 AbstractCegarLoop]: Abstraction has 181277 states and 558454 transitions. [2021-08-06 14:00:03,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 181277 states and 558454 transitions. [2021-08-06 14:00:04,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-06 14:00:04,567 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:00:04,567 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:00:04,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-06 14:00:04,568 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 14:00:04,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:00:04,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2082730985, now seen corresponding path program 2 times [2021-08-06 14:00:04,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:00:04,568 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368629100] [2021-08-06 14:00:04,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:00:04,569 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:00:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:00:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:00:05,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:00:05,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368629100] [2021-08-06 14:00:05,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368629100] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:00:05,774 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:00:05,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-06 14:00:05,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680215464] [2021-08-06 14:00:05,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-06 14:00:05,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:00:05,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-06 14:00:05,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2021-08-06 14:00:05,775 INFO L87 Difference]: Start difference. First operand 181277 states and 558454 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:00:18,419 INFO L93 Difference]: Finished difference Result 337526 states and 1042129 transitions. [2021-08-06 14:00:18,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-06 14:00:18,420 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-06 14:00:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:00:19,827 INFO L225 Difference]: With dead ends: 337526 [2021-08-06 14:00:19,827 INFO L226 Difference]: Without dead ends: 337526 [2021-08-06 14:00:19,828 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 5714.5ms TimeCoverageRelationStatistics Valid=1165, Invalid=5477, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 14:00:20,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337526 states. [2021-08-06 14:00:26,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337526 to 183947. [2021-08-06 14:00:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183947 states, 183943 states have (on average 3.080698912163007) internal successors, (566673), 183946 states have internal predecessors, (566673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183947 states to 183947 states and 566673 transitions. [2021-08-06 14:00:27,747 INFO L78 Accepts]: Start accepts. Automaton has 183947 states and 566673 transitions. Word has length 106 [2021-08-06 14:00:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:00:27,748 INFO L470 AbstractCegarLoop]: Abstraction has 183947 states and 566673 transitions. [2021-08-06 14:00:27,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 183947 states and 566673 transitions. [2021-08-06 14:00:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-06 14:00:28,015 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:00:28,015 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:00:28,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-06 14:00:28,016 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 14:00:28,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:00:28,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1665972649, now seen corresponding path program 3 times [2021-08-06 14:00:28,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:00:28,016 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302275928] [2021-08-06 14:00:28,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:00:28,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:00:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:00:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:00:29,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:00:29,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302275928] [2021-08-06 14:00:29,462 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302275928] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:00:29,462 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:00:29,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-08-06 14:00:29,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460438643] [2021-08-06 14:00:29,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-08-06 14:00:29,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:00:29,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-06 14:00:29,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1247, Unknown=0, NotChecked=0, Total=1332 [2021-08-06 14:00:29,464 INFO L87 Difference]: Start difference. First operand 183947 states and 566673 transitions. Second operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:00:42,317 INFO L93 Difference]: Finished difference Result 342230 states and 1055142 transitions. [2021-08-06 14:00:42,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-06 14:00:42,318 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-06 14:00:42,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:00:44,121 INFO L225 Difference]: With dead ends: 342230 [2021-08-06 14:00:44,121 INFO L226 Difference]: Without dead ends: 342230 [2021-08-06 14:00:44,122 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 5947.0ms TimeCoverageRelationStatistics Valid=1255, Invalid=5885, Unknown=0, NotChecked=0, Total=7140 [2021-08-06 14:00:45,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342230 states. [2021-08-06 14:00:49,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342230 to 184730. [2021-08-06 14:00:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184730 states, 184726 states have (on average 3.0806437642779034) internal successors, (569075), 184729 states have internal predecessors, (569075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184730 states to 184730 states and 569075 transitions. [2021-08-06 14:00:51,556 INFO L78 Accepts]: Start accepts. Automaton has 184730 states and 569075 transitions. Word has length 106 [2021-08-06 14:00:51,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:00:51,557 INFO L470 AbstractCegarLoop]: Abstraction has 184730 states and 569075 transitions. [2021-08-06 14:00:51,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:00:51,557 INFO L276 IsEmpty]: Start isEmpty. Operand 184730 states and 569075 transitions. [2021-08-06 14:00:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-06 14:00:51,815 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:00:51,815 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:00:51,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-06 14:00:51,815 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 14:00:51,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:00:51,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1885157345, now seen corresponding path program 4 times [2021-08-06 14:00:51,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:00:51,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886006409] [2021-08-06 14:00:51,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:00:51,816 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:00:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:00:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:00:53,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:00:53,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886006409] [2021-08-06 14:00:53,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886006409] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:00:53,570 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:00:53,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-06 14:00:53,571 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124685509] [2021-08-06 14:00:53,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-06 14:00:53,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:00:53,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-06 14:00:53,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2021-08-06 14:00:53,572 INFO L87 Difference]: Start difference. First operand 184730 states and 569075 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:01:05,661 INFO L93 Difference]: Finished difference Result 325259 states and 1003416 transitions. [2021-08-06 14:01:05,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-06 14:01:05,673 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-06 14:01:05,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:01:06,952 INFO L225 Difference]: With dead ends: 325259 [2021-08-06 14:01:06,952 INFO L226 Difference]: Without dead ends: 325259 [2021-08-06 14:01:06,952 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 5839.6ms TimeCoverageRelationStatistics Valid=1161, Invalid=5481, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 14:01:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325259 states. [2021-08-06 14:01:12,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325259 to 184730. [2021-08-06 14:01:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184730 states, 184726 states have (on average 3.0806437642779034) internal successors, (569075), 184729 states have internal predecessors, (569075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184730 states to 184730 states and 569075 transitions. [2021-08-06 14:01:14,176 INFO L78 Accepts]: Start accepts. Automaton has 184730 states and 569075 transitions. Word has length 106 [2021-08-06 14:01:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:01:14,176 INFO L470 AbstractCegarLoop]: Abstraction has 184730 states and 569075 transitions. [2021-08-06 14:01:14,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 184730 states and 569075 transitions. [2021-08-06 14:01:14,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-06 14:01:14,422 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:01:14,422 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:01:14,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-06 14:01:14,422 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 14:01:14,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:01:14,423 INFO L82 PathProgramCache]: Analyzing trace with hash -141007891, now seen corresponding path program 5 times [2021-08-06 14:01:14,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:01:14,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565118512] [2021-08-06 14:01:14,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:01:14,423 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:01:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:01:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:01:16,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:01:16,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565118512] [2021-08-06 14:01:16,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565118512] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:01:16,244 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:01:16,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-06 14:01:16,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127748362] [2021-08-06 14:01:16,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-06 14:01:16,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:01:16,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-06 14:01:16,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2021-08-06 14:01:16,245 INFO L87 Difference]: Start difference. First operand 184730 states and 569075 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:01:28,430 INFO L93 Difference]: Finished difference Result 329009 states and 1015541 transitions. [2021-08-06 14:01:28,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-06 14:01:28,431 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-06 14:01:28,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:01:29,649 INFO L225 Difference]: With dead ends: 329009 [2021-08-06 14:01:29,649 INFO L226 Difference]: Without dead ends: 329009 [2021-08-06 14:01:29,650 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 5690.9ms TimeCoverageRelationStatistics Valid=1206, Invalid=5600, Unknown=0, NotChecked=0, Total=6806 [2021-08-06 14:01:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329009 states. [2021-08-06 14:01:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329009 to 184730. [2021-08-06 14:01:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184730 states, 184726 states have (on average 3.0806437642779034) internal successors, (569075), 184729 states have internal predecessors, (569075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184730 states to 184730 states and 569075 transitions. [2021-08-06 14:01:37,592 INFO L78 Accepts]: Start accepts. Automaton has 184730 states and 569075 transitions. Word has length 106 [2021-08-06 14:01:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:01:37,593 INFO L470 AbstractCegarLoop]: Abstraction has 184730 states and 569075 transitions. [2021-08-06 14:01:37,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:37,593 INFO L276 IsEmpty]: Start isEmpty. Operand 184730 states and 569075 transitions. [2021-08-06 14:01:37,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-06 14:01:37,932 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:01:37,932 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:01:37,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-06 14:01:37,932 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 14:01:37,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:01:37,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1386556415, now seen corresponding path program 6 times [2021-08-06 14:01:37,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:01:37,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616553127] [2021-08-06 14:01:37,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:01:37,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:01:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:01:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:01:40,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:01:40,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616553127] [2021-08-06 14:01:40,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616553127] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:01:40,182 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:01:40,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-06 14:01:40,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123318286] [2021-08-06 14:01:40,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-06 14:01:40,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:01:40,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-06 14:01:40,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2021-08-06 14:01:40,185 INFO L87 Difference]: Start difference. First operand 184730 states and 569075 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:01:52,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:01:52,518 INFO L93 Difference]: Finished difference Result 335759 states and 1036766 transitions. [2021-08-06 14:01:52,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-06 14:01:52,519 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-06 14:01:52,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:01:53,947 INFO L225 Difference]: With dead ends: 335759 [2021-08-06 14:01:53,947 INFO L226 Difference]: Without dead ends: 335759 [2021-08-06 14:01:53,947 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 5919.4ms TimeCoverageRelationStatistics Valid=1165, Invalid=5477, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 14:01:54,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335759 states. [2021-08-06 14:02:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335759 to 184730. [2021-08-06 14:02:00,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184730 states, 184726 states have (on average 3.0806437642779034) internal successors, (569075), 184729 states have internal predecessors, (569075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:01,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184730 states to 184730 states and 569075 transitions. [2021-08-06 14:02:01,430 INFO L78 Accepts]: Start accepts. Automaton has 184730 states and 569075 transitions. Word has length 106 [2021-08-06 14:02:01,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:02:01,430 INFO L470 AbstractCegarLoop]: Abstraction has 184730 states and 569075 transitions. [2021-08-06 14:02:01,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:01,431 INFO L276 IsEmpty]: Start isEmpty. Operand 184730 states and 569075 transitions. [2021-08-06 14:02:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-06 14:02:02,249 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:02:02,249 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:02:02,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-06 14:02:02,249 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 14:02:02,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:02:02,249 INFO L82 PathProgramCache]: Analyzing trace with hash 412610391, now seen corresponding path program 7 times [2021-08-06 14:02:02,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:02:02,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227190668] [2021-08-06 14:02:02,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:02:02,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:02:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:02:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:02:03,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:02:03,695 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227190668] [2021-08-06 14:02:03,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227190668] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:02:03,695 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:02:03,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-06 14:02:03,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184524036] [2021-08-06 14:02:03,695 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-06 14:02:03,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:02:03,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-06 14:02:03,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2021-08-06 14:02:03,696 INFO L87 Difference]: Start difference. First operand 184730 states and 569075 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:02:15,660 INFO L93 Difference]: Finished difference Result 342509 states and 1057241 transitions. [2021-08-06 14:02:15,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-06 14:02:15,660 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-06 14:02:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:02:17,468 INFO L225 Difference]: With dead ends: 342509 [2021-08-06 14:02:17,468 INFO L226 Difference]: Without dead ends: 342509 [2021-08-06 14:02:17,469 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 5685.3ms TimeCoverageRelationStatistics Valid=1165, Invalid=5477, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 14:02:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342509 states. [2021-08-06 14:02:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342509 to 184730. [2021-08-06 14:02:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184730 states, 184726 states have (on average 3.0806437642779034) internal successors, (569075), 184729 states have internal predecessors, (569075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:26,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184730 states to 184730 states and 569075 transitions. [2021-08-06 14:02:26,136 INFO L78 Accepts]: Start accepts. Automaton has 184730 states and 569075 transitions. Word has length 106 [2021-08-06 14:02:26,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:02:26,137 INFO L470 AbstractCegarLoop]: Abstraction has 184730 states and 569075 transitions. [2021-08-06 14:02:26,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 184730 states and 569075 transitions. [2021-08-06 14:02:26,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-06 14:02:26,469 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:02:26,469 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:02:26,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-06 14:02:26,469 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 14:02:26,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:02:26,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1426804225, now seen corresponding path program 8 times [2021-08-06 14:02:26,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:02:26,473 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761181379] [2021-08-06 14:02:26,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:02:26,474 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:02:26,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:02:28,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:02:28,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:02:28,620 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761181379] [2021-08-06 14:02:28,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761181379] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:02:28,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:02:28,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-06 14:02:28,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730884306] [2021-08-06 14:02:28,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-06 14:02:28,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:02:28,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-06 14:02:28,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2021-08-06 14:02:28,622 INFO L87 Difference]: Start difference. First operand 184730 states and 569075 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:40,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:02:40,519 INFO L93 Difference]: Finished difference Result 346259 states and 1068616 transitions. [2021-08-06 14:02:40,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-06 14:02:40,519 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-06 14:02:40,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:02:42,250 INFO L225 Difference]: With dead ends: 346259 [2021-08-06 14:02:42,251 INFO L226 Difference]: Without dead ends: 346259 [2021-08-06 14:02:42,251 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 6157.2ms TimeCoverageRelationStatistics Valid=1165, Invalid=5477, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 14:02:43,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346259 states. [2021-08-06 14:02:48,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346259 to 184730. [2021-08-06 14:02:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184730 states, 184726 states have (on average 3.0806437642779034) internal successors, (569075), 184729 states have internal predecessors, (569075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:49,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184730 states to 184730 states and 569075 transitions. [2021-08-06 14:02:49,648 INFO L78 Accepts]: Start accepts. Automaton has 184730 states and 569075 transitions. Word has length 106 [2021-08-06 14:02:49,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:02:49,649 INFO L470 AbstractCegarLoop]: Abstraction has 184730 states and 569075 transitions. [2021-08-06 14:02:49,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:02:49,649 INFO L276 IsEmpty]: Start isEmpty. Operand 184730 states and 569075 transitions. [2021-08-06 14:02:49,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-06 14:02:49,894 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:02:49,894 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:02:49,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-06 14:02:49,894 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 14:02:49,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:02:49,894 INFO L82 PathProgramCache]: Analyzing trace with hash 668528463, now seen corresponding path program 9 times [2021-08-06 14:02:49,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:02:49,894 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602755058] [2021-08-06 14:02:49,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:02:49,894 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:02:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:02:51,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:02:51,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:02:51,676 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602755058] [2021-08-06 14:02:51,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602755058] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:02:51,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:02:51,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-06 14:02:51,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646253366] [2021-08-06 14:02:51,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-06 14:02:51,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:02:51,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-06 14:02:51,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2021-08-06 14:02:51,677 INFO L87 Difference]: Start difference. First operand 184730 states and 569075 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:02,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:03:02,928 INFO L93 Difference]: Finished difference Result 347759 states and 1073166 transitions. [2021-08-06 14:03:02,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-06 14:03:02,929 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-06 14:03:02,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:03:04,565 INFO L225 Difference]: With dead ends: 347759 [2021-08-06 14:03:04,565 INFO L226 Difference]: Without dead ends: 347759 [2021-08-06 14:03:04,566 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 5405.4ms TimeCoverageRelationStatistics Valid=1165, Invalid=5477, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 14:03:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347759 states. [2021-08-06 14:03:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347759 to 184730. [2021-08-06 14:03:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184730 states, 184726 states have (on average 3.0806437642779034) internal successors, (569075), 184729 states have internal predecessors, (569075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184730 states to 184730 states and 569075 transitions. [2021-08-06 14:03:13,119 INFO L78 Accepts]: Start accepts. Automaton has 184730 states and 569075 transitions. Word has length 106 [2021-08-06 14:03:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:03:13,119 INFO L470 AbstractCegarLoop]: Abstraction has 184730 states and 569075 transitions. [2021-08-06 14:03:13,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 184730 states and 569075 transitions. [2021-08-06 14:03:13,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-06 14:03:13,452 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:03:13,452 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:03:13,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-06 14:03:13,453 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 14:03:13,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:03:13,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2115890147, now seen corresponding path program 10 times [2021-08-06 14:03:13,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:03:13,455 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287479995] [2021-08-06 14:03:13,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:03:13,455 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:03:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:03:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:03:15,400 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:03:15,400 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287479995] [2021-08-06 14:03:15,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287479995] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:03:15,400 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:03:15,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-06 14:03:15,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125449215] [2021-08-06 14:03:15,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-06 14:03:15,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:03:15,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-06 14:03:15,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1178, Unknown=0, NotChecked=0, Total=1260 [2021-08-06 14:03:15,401 INFO L87 Difference]: Start difference. First operand 184730 states and 569075 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:26,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:03:26,667 INFO L93 Difference]: Finished difference Result 335009 states and 1033741 transitions. [2021-08-06 14:03:26,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-06 14:03:26,668 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-06 14:03:26,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:03:28,366 INFO L225 Difference]: With dead ends: 335009 [2021-08-06 14:03:28,366 INFO L226 Difference]: Without dead ends: 335009 [2021-08-06 14:03:28,367 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 5450.6ms TimeCoverageRelationStatistics Valid=1165, Invalid=5477, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 14:03:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335009 states. [2021-08-06 14:03:33,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335009 to 182330. [2021-08-06 14:03:34,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182330 states, 182326 states have (on average 3.080608360848151) internal successors, (561675), 182329 states have internal predecessors, (561675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:35,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182330 states to 182330 states and 561675 transitions. [2021-08-06 14:03:35,175 INFO L78 Accepts]: Start accepts. Automaton has 182330 states and 561675 transitions. Word has length 106 [2021-08-06 14:03:35,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:03:35,175 INFO L470 AbstractCegarLoop]: Abstraction has 182330 states and 561675 transitions. [2021-08-06 14:03:35,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:35,175 INFO L276 IsEmpty]: Start isEmpty. Operand 182330 states and 561675 transitions. [2021-08-06 14:03:35,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-06 14:03:35,387 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:03:35,387 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:03:35,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-06 14:03:35,387 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 14:03:35,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:03:35,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1862605843, now seen corresponding path program 11 times [2021-08-06 14:03:35,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:03:35,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117903993] [2021-08-06 14:03:35,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:03:35,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:03:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:03:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:03:36,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:03:36,990 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117903993] [2021-08-06 14:03:36,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117903993] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:03:36,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:03:36,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-06 14:03:36,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851866883] [2021-08-06 14:03:36,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-06 14:03:36,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:03:36,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-06 14:03:36,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1177, Unknown=0, NotChecked=0, Total=1260 [2021-08-06 14:03:36,991 INFO L87 Difference]: Start difference. First operand 182330 states and 561675 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:48,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:03:48,694 INFO L93 Difference]: Finished difference Result 343655 states and 1061511 transitions. [2021-08-06 14:03:48,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-06 14:03:48,695 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-06 14:03:48,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:03:50,552 INFO L225 Difference]: With dead ends: 343655 [2021-08-06 14:03:50,552 INFO L226 Difference]: Without dead ends: 343655 [2021-08-06 14:03:50,553 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 5906.4ms TimeCoverageRelationStatistics Valid=1167, Invalid=5475, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 14:03:51,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343655 states. [2021-08-06 14:03:57,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343655 to 180566. [2021-08-06 14:03:57,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180566 states, 180562 states have (on average 3.0809804942346672) internal successors, (556308), 180565 states have internal predecessors, (556308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180566 states to 180566 states and 556308 transitions. [2021-08-06 14:03:59,320 INFO L78 Accepts]: Start accepts. Automaton has 180566 states and 556308 transitions. Word has length 106 [2021-08-06 14:03:59,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:03:59,320 INFO L470 AbstractCegarLoop]: Abstraction has 180566 states and 556308 transitions. [2021-08-06 14:03:59,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:03:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 180566 states and 556308 transitions. [2021-08-06 14:03:59,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-06 14:03:59,641 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:03:59,642 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:03:59,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-08-06 14:03:59,642 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 14:03:59,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:03:59,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2015603117, now seen corresponding path program 12 times [2021-08-06 14:03:59,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:03:59,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502360390] [2021-08-06 14:03:59,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:03:59,644 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:03:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:04:01,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:04:01,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:04:01,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502360390] [2021-08-06 14:04:01,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502360390] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:04:01,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:04:01,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-08-06 14:04:01,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170667404] [2021-08-06 14:04:01,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-08-06 14:04:01,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:04:01,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-06 14:04:01,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1246, Unknown=0, NotChecked=0, Total=1332 [2021-08-06 14:04:01,643 INFO L87 Difference]: Start difference. First operand 180566 states and 556308 transitions. Second operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:04:14,313 INFO L93 Difference]: Finished difference Result 374150 states and 1153785 transitions. [2021-08-06 14:04:14,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-08-06 14:04:14,314 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-06 14:04:14,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:04:16,115 INFO L225 Difference]: With dead ends: 374150 [2021-08-06 14:04:16,115 INFO L226 Difference]: Without dead ends: 374150 [2021-08-06 14:04:16,116 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 6339.7ms TimeCoverageRelationStatistics Valid=1257, Invalid=5883, Unknown=0, NotChecked=0, Total=7140 [2021-08-06 14:04:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374150 states. [2021-08-06 14:04:21,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374150 to 180866. [2021-08-06 14:04:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180866 states, 180862 states have (on average 3.081067333104798) internal successors, (557248), 180865 states have internal predecessors, (557248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180866 states to 180866 states and 557248 transitions. [2021-08-06 14:04:23,213 INFO L78 Accepts]: Start accepts. Automaton has 180866 states and 557248 transitions. Word has length 106 [2021-08-06 14:04:23,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:04:23,213 INFO L470 AbstractCegarLoop]: Abstraction has 180866 states and 557248 transitions. [2021-08-06 14:04:23,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 180866 states and 557248 transitions. [2021-08-06 14:04:23,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-06 14:04:23,440 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:04:23,440 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:04:23,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-08-06 14:04:23,440 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 14:04:23,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:04:23,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1535526877, now seen corresponding path program 13 times [2021-08-06 14:04:23,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:04:23,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409049491] [2021-08-06 14:04:23,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:04:23,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:04:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:04:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:04:25,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:04:25,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409049491] [2021-08-06 14:04:25,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409049491] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:04:25,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:04:25,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-08-06 14:04:25,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013898204] [2021-08-06 14:04:25,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-08-06 14:04:25,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:04:25,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-06 14:04:25,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1246, Unknown=0, NotChecked=0, Total=1332 [2021-08-06 14:04:25,068 INFO L87 Difference]: Start difference. First operand 180866 states and 557248 transitions. Second operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:37,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:04:37,318 INFO L93 Difference]: Finished difference Result 342245 states and 1056484 transitions. [2021-08-06 14:04:37,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-06 14:04:37,319 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-06 14:04:37,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:04:39,047 INFO L225 Difference]: With dead ends: 342245 [2021-08-06 14:04:39,047 INFO L226 Difference]: Without dead ends: 342245 [2021-08-06 14:04:39,048 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 5447.5ms TimeCoverageRelationStatistics Valid=1179, Invalid=5627, Unknown=0, NotChecked=0, Total=6806 [2021-08-06 14:04:39,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342245 states. [2021-08-06 14:04:46,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342245 to 180836. [2021-08-06 14:04:46,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180836 states, 180832 states have (on average 3.081075252167758) internal successors, (557157), 180835 states have internal predecessors, (557157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:48,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180836 states to 180836 states and 557157 transitions. [2021-08-06 14:04:48,164 INFO L78 Accepts]: Start accepts. Automaton has 180836 states and 557157 transitions. Word has length 106 [2021-08-06 14:04:48,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:04:48,164 INFO L470 AbstractCegarLoop]: Abstraction has 180836 states and 557157 transitions. [2021-08-06 14:04:48,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:04:48,164 INFO L276 IsEmpty]: Start isEmpty. Operand 180836 states and 557157 transitions. [2021-08-06 14:04:48,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-06 14:04:48,898 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:04:48,899 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:04:48,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-08-06 14:04:48,899 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 14:04:48,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:04:48,899 INFO L82 PathProgramCache]: Analyzing trace with hash -490638359, now seen corresponding path program 14 times [2021-08-06 14:04:48,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:04:48,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942840302] [2021-08-06 14:04:48,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:04:48,900 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:04:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:04:50,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:04:50,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:04:50,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942840302] [2021-08-06 14:04:50,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942840302] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:04:50,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:04:50,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2021-08-06 14:04:50,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140221728] [2021-08-06 14:04:50,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2021-08-06 14:04:50,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:04:50,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2021-08-06 14:04:50,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1246, Unknown=0, NotChecked=0, Total=1332 [2021-08-06 14:04:50,068 INFO L87 Difference]: Start difference. First operand 180836 states and 557157 transitions. Second operand has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:05:02,379 INFO L93 Difference]: Finished difference Result 343655 states and 1061511 transitions. [2021-08-06 14:05:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-08-06 14:05:02,379 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-06 14:05:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:05:04,324 INFO L225 Difference]: With dead ends: 343655 [2021-08-06 14:05:04,324 INFO L226 Difference]: Without dead ends: 343655 [2021-08-06 14:05:04,325 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 5236.4ms TimeCoverageRelationStatistics Valid=1224, Invalid=5748, Unknown=0, NotChecked=0, Total=6972 [2021-08-06 14:05:04,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343655 states. [2021-08-06 14:05:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343655 to 180596. [2021-08-06 14:05:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180596 states, 180592 states have (on average 3.0809725790732703) internal successors, (556399), 180595 states have internal predecessors, (556399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180596 states to 180596 states and 556399 transitions. [2021-08-06 14:05:11,964 INFO L78 Accepts]: Start accepts. Automaton has 180596 states and 556399 transitions. Word has length 106 [2021-08-06 14:05:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-06 14:05:11,964 INFO L470 AbstractCegarLoop]: Abstraction has 180596 states and 556399 transitions. [2021-08-06 14:05:11,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.864864864864865) internal successors, (106), 37 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 180596 states and 556399 transitions. [2021-08-06 14:05:12,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-08-06 14:05:12,198 INFO L504 BasicCegarLoop]: Found error trace [2021-08-06 14:05:12,198 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-06 14:05:12,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-08-06 14:05:12,198 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION === [reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION, reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-08-06 14:05:12,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-06 14:05:12,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1036925947, now seen corresponding path program 15 times [2021-08-06 14:05:12,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-06 14:05:12,199 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615159250] [2021-08-06 14:05:12,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-06 14:05:12,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-06 14:05:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-06 14:05:13,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-06 14:05:13,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-06 14:05:13,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615159250] [2021-08-06 14:05:13,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615159250] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-06 14:05:13,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-06 14:05:13,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2021-08-06 14:05:13,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622179107] [2021-08-06 14:05:13,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-08-06 14:05:13,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-06 14:05:13,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-08-06 14:05:13,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1177, Unknown=0, NotChecked=0, Total=1260 [2021-08-06 14:05:13,651 INFO L87 Difference]: Start difference. First operand 180596 states and 556399 transitions. Second operand has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:25,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-06 14:05:25,436 INFO L93 Difference]: Finished difference Result 350405 states and 1082736 transitions. [2021-08-06 14:05:25,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-08-06 14:05:25,436 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.9444444444444446) internal successors, (106), 36 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-08-06 14:05:25,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-06 14:05:27,402 INFO L225 Difference]: With dead ends: 350405 [2021-08-06 14:05:27,402 INFO L226 Difference]: Without dead ends: 350405 [2021-08-06 14:05:27,403 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 5201.8ms TimeCoverageRelationStatistics Valid=1167, Invalid=5475, Unknown=0, NotChecked=0, Total=6642 [2021-08-06 14:05:28,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350405 states. [2021-08-06 14:05:33,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350405 to 180506. Received shutdown request... [2021-08-06 14:05:33,870 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-08-06 14:05:34,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180506 states, 180502 states have (on average 3.08099633245061) internal successors, (556126), 180505 states have internal predecessors, (556126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-06 14:05:34,313 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 14:05:34,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-08-06 14:05:34,314 WARN L594 AbstractCegarLoop]: Verification canceled: while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). [2021-08-06 14:05:34,314 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 14:05:34,314 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 14:05:34,314 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location reader_twoErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-06 14:05:34,315 INFO L308 ceAbstractionStarter]: Result for error location reader_twoThread1of1ForFork0 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (2/2) [2021-08-06 14:05:34,316 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-06 14:05:34,316 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-06 14:05:34,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.08 02:05:34 BasicIcfg [2021-08-06 14:05:34,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-06 14:05:34,333 INFO L168 Benchmark]: Toolchain (without parser) took 635019.84 ms. Allocated memory was 186.6 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 149.1 MB in the beginning and 3.9 GB in the end (delta: -3.8 GB). Peak memory consumption was 4.2 GB. Max. memory is 8.0 GB. [2021-08-06 14:05:34,333 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 186.6 MB. Free memory is still 168.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-06 14:05:34,333 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.87 ms. Allocated memory is still 186.6 MB. Free memory was 148.9 MB in the beginning and 146.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-08-06 14:05:34,333 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.79 ms. Allocated memory is still 186.6 MB. Free memory was 146.0 MB in the beginning and 142.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-06 14:05:34,333 INFO L168 Benchmark]: Boogie Preprocessor took 46.51 ms. Allocated memory is still 186.6 MB. Free memory was 142.9 MB in the beginning and 140.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-06 14:05:34,334 INFO L168 Benchmark]: RCFGBuilder took 651.21 ms. Allocated memory is still 186.6 MB. Free memory was 140.8 MB in the beginning and 96.7 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 8.0 GB. [2021-08-06 14:05:34,334 INFO L168 Benchmark]: TraceAbstraction took 633529.76 ms. Allocated memory was 186.6 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 96.2 MB in the beginning and 3.9 GB in the end (delta: -3.8 GB). Peak memory consumption was 4.2 GB. Max. memory is 8.0 GB. [2021-08-06 14:05:34,334 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 186.6 MB. Free memory is still 168.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 727.87 ms. Allocated memory is still 186.6 MB. Free memory was 148.9 MB in the beginning and 146.0 MB in the end (delta: 2.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 59.79 ms. Allocated memory is still 186.6 MB. Free memory was 146.0 MB in the beginning and 142.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 46.51 ms. Allocated memory is still 186.6 MB. Free memory was 142.9 MB in the beginning and 140.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 651.21 ms. Allocated memory is still 186.6 MB. Free memory was 140.8 MB in the beginning and 96.7 MB in the end (delta: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 633529.76 ms. Allocated memory was 186.6 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 96.2 MB in the beginning and 3.9 GB in the end (delta: -3.8 GB). Peak memory consumption was 4.2 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1060]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1061]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while ReachableStatesComputation was computing reachable states (1 states constructed, input type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 311 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 89.1ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 14.5ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 61.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=508occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: reader_twoThread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 311 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 633142.3ms, OverallIterations: 28, TraceHistogramMax: 1, EmptinessCheckTime: 8597.3ms, AutomataDifference: 408473.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2289.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 36767 SDtfs, 98573 SDslu, 502423 SDs, 0 SdLazy, 211809 SolverSat, 2721 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 91443.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2535 GetRequests, 116 SyntacticMatches, 33 SemanticMatches, 2386 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41652 ImplicationChecksByTransitivity, 224340.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=184730occurred in iteration=16, InterpolantAutomatonStates: 1645, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 173476.5ms AutomataMinimizationTime, 28 MinimizatonAttempts, 2982352 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 82.5ms SsaConstructionTime, 1797.2ms SatisfiabilityAnalysisTime, 38001.5ms InterpolantComputationTime, 2834 NumberOfCodeBlocks, 2834 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2806 ConstructedInterpolants, 0 QuantifiedInterpolants, 42204 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown [2021-08-06 14:05:34,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 !ENTRY org.eclipse.osgi 4 0 2021-08-06 14:05:34.555 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ded639eff/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:191) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438) An error has occurred. See the log file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ded639eff/.metadata/.log.