/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-atomic/read_write_lock-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9e34d99ae2c6837f487980c721c4b6acf9d9b15c-9e34d99 [2021-07-09 16:27:52,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-09 16:27:52,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-09 16:27:52,805 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-09 16:27:52,805 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-09 16:27:52,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-09 16:27:52,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-09 16:27:52,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-09 16:27:52,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-09 16:27:52,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-09 16:27:52,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-09 16:27:52,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-09 16:27:52,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-09 16:27:52,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-09 16:27:52,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-09 16:27:52,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-09 16:27:52,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-09 16:27:52,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-09 16:27:52,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-09 16:27:52,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-09 16:27:52,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-09 16:27:52,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-09 16:27:52,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-09 16:27:52,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-09 16:27:52,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-09 16:27:52,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-09 16:27:52,856 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-09 16:27:52,857 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-09 16:27:52,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-09 16:27:52,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-09 16:27:52,858 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-09 16:27:52,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-09 16:27:52,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-09 16:27:52,873 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-09 16:27:52,874 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-09 16:27:52,874 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-09 16:27:52,875 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-09 16:27:52,875 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-09 16:27:52,875 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-09 16:27:52,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-09 16:27:52,876 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-09 16:27:52,877 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-07-09 16:27:52,917 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-09 16:27:52,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-09 16:27:52,918 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-09 16:27:52,918 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-09 16:27:52,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-09 16:27:52,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-09 16:27:52,920 INFO L138 SettingsManager]: * Use SBE=true [2021-07-09 16:27:52,920 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-09 16:27:52,920 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-09 16:27:52,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-09 16:27:52,921 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-09 16:27:52,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-09 16:27:52,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-09 16:27:52,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-09 16:27:52,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-09 16:27:52,921 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-09 16:27:52,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-09 16:27:52,922 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-09 16:27:52,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-09 16:27:52,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-09 16:27:52,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-09 16:27:52,922 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-09 16:27:52,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-09 16:27:52,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 16:27:52,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-09 16:27:52,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-09 16:27:52,923 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-09 16:27:52,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-09 16:27:52,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-09 16:27:52,923 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-09 16:27:52,923 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-09 16:27:52,923 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-07-09 16:27:53,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-09 16:27:53,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-09 16:27:53,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-09 16:27:53,294 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-09 16:27:53,295 INFO L275 PluginConnector]: CDTParser initialized [2021-07-09 16:27:53,295 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2021-07-09 16:27:53,341 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01196ccb7/a4cfe429e9fa4a3aa1a5f1353990bec2/FLAGc106160a9 [2021-07-09 16:27:53,724 INFO L306 CDTParser]: Found 1 translation units. [2021-07-09 16:27:53,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2021-07-09 16:27:53,733 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01196ccb7/a4cfe429e9fa4a3aa1a5f1353990bec2/FLAGc106160a9 [2021-07-09 16:27:53,747 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01196ccb7/a4cfe429e9fa4a3aa1a5f1353990bec2 [2021-07-09 16:27:53,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-09 16:27:53,750 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-09 16:27:53,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-09 16:27:53,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-09 16:27:53,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-09 16:27:53,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:27:53" (1/1) ... [2021-07-09 16:27:53,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64f3a4df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:27:53, skipping insertion in model container [2021-07-09 16:27:53,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:27:53" (1/1) ... [2021-07-09 16:27:53,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-09 16:27:53,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-09 16:27:53,961 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-07-09 16:27:54,089 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-atomic/read_write_lock-1.i[31246,31259] [2021-07-09 16:27:54,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:27:54,109 INFO L203 MainTranslator]: Completed pre-run [2021-07-09 16:27:54,135 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-07-09 16:27:54,164 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-atomic/read_write_lock-1.i[31246,31259] [2021-07-09 16:27:54,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:27:54,201 INFO L208 MainTranslator]: Completed translation [2021-07-09 16:27:54,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:27:54 WrapperNode [2021-07-09 16:27:54,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-09 16:27:54,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-09 16:27:54,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-09 16:27:54,203 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-09 16:27:54,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:27:54" (1/1) ... [2021-07-09 16:27:54,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:27:54" (1/1) ... [2021-07-09 16:27:54,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-09 16:27:54,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-09 16:27:54,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-09 16:27:54,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-09 16:27:54,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:27:54" (1/1) ... [2021-07-09 16:27:54,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:27:54" (1/1) ... [2021-07-09 16:27:54,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:27:54" (1/1) ... [2021-07-09 16:27:54,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:27:54" (1/1) ... [2021-07-09 16:27:54,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:27:54" (1/1) ... [2021-07-09 16:27:54,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:27:54" (1/1) ... [2021-07-09 16:27:54,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:27:54" (1/1) ... [2021-07-09 16:27:54,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-09 16:27:54,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-09 16:27:54,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-09 16:27:54,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-09 16:27:54,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:27:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 16:27:54,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-07-09 16:27:54,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-09 16:27:54,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-09 16:27:54,380 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2021-07-09 16:27:54,380 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2021-07-09 16:27:54,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-09 16:27:54,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-09 16:27:54,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-09 16:27:54,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-09 16:27:54,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-09 16:27:54,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-09 16:27:54,381 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2021-07-09 16:27:54,381 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2021-07-09 16:27:54,382 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-09 16:27:54,828 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-09 16:27:54,828 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-07-09 16:27:54,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:27:54 BoogieIcfgContainer [2021-07-09 16:27:54,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-09 16:27:54,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-09 16:27:54,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-09 16:27:54,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-09 16:27:54,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.07 04:27:53" (1/3) ... [2021-07-09 16:27:54,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788920b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:27:54, skipping insertion in model container [2021-07-09 16:27:54,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:27:54" (2/3) ... [2021-07-09 16:27:54,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@788920b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:27:54, skipping insertion in model container [2021-07-09 16:27:54,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:27:54" (3/3) ... [2021-07-09 16:27:54,835 INFO L111 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2021-07-09 16:27:54,839 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-09 16:27:54,839 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-09 16:27:54,840 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-07-09 16:27:54,840 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-09 16:27:54,871 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,872 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,872 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,872 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,872 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,872 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,872 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,872 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,872 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,872 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,873 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,873 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,873 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,873 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,873 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,873 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,873 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,873 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,874 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,874 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,874 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,874 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,874 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,874 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,875 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,875 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,875 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,875 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,875 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,875 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,876 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,876 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,876 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,876 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,876 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,877 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,877 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,877 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,877 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,877 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,877 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,877 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,877 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,877 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,878 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,878 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,878 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,878 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,878 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,878 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,878 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,878 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,878 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,878 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,879 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,879 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,879 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,879 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,879 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,880 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,880 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,880 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,880 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,880 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,881 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,881 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,881 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,881 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,881 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,881 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,881 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,881 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,882 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,882 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,882 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,882 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,882 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,882 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,882 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,882 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,883 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,883 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,883 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,883 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,883 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,883 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,883 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,883 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,883 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,883 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,884 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,884 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,884 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,885 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,885 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,886 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,887 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,887 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,887 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,888 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,894 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,894 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,895 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,895 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,895 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,895 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,895 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,895 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,896 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,897 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,897 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,898 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,898 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,898 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,898 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,899 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,899 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,899 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,899 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,899 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,899 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,901 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,901 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,901 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,901 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,901 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,901 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,901 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,901 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,901 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:27:54,926 INFO L149 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2021-07-09 16:27:54,943 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-09 16:27:54,959 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 16:27:54,959 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 16:27:54,959 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 16:27:54,959 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 16:27:54,959 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 16:27:54,960 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 16:27:54,960 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 16:27:54,960 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == readerThread1of1ForFork0======== [2021-07-09 16:27:54,973 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 119 places, 120 transitions, 308 flow [2021-07-09 16:27:56,367 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 39083 states, 39081 states have (on average 4.1395307182518355) internal successors, (161777), 39082 states have internal predecessors, (161777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:27:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 39083 states, 39081 states have (on average 4.1395307182518355) internal successors, (161777), 39082 states have internal predecessors, (161777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:27:56,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-07-09 16:27:56,474 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:27:56,474 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:27:56,474 INFO L430 AbstractCegarLoop]: === Iteration 1 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:27:56,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:27:56,478 INFO L82 PathProgramCache]: Analyzing trace with hash -576272667, now seen corresponding path program 1 times [2021-07-09 16:27:56,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:27:56,483 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881628791] [2021-07-09 16:27:56,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:27:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:27:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:27:56,690 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:27:56,690 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881628791] [2021-07-09 16:27:56,691 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881628791] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:27:56,691 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:27:56,691 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:27:56,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413426388] [2021-07-09 16:27:56,694 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:27:56,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:27:56,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:27:56,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:27:56,788 INFO L87 Difference]: Start difference. First operand has 39083 states, 39081 states have (on average 4.1395307182518355) internal successors, (161777), 39082 states have internal predecessors, (161777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:27:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:27:58,100 INFO L93 Difference]: Finished difference Result 70899 states and 279570 transitions. [2021-07-09 16:27:58,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:27:58,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2021-07-09 16:27:58,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:27:58,621 INFO L225 Difference]: With dead ends: 70899 [2021-07-09 16:27:58,621 INFO L226 Difference]: Without dead ends: 53634 [2021-07-09 16:27:58,622 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 72.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:27:58,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53634 states. [2021-07-09 16:28:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53634 to 42117. [2021-07-09 16:28:00,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42117 states, 42115 states have (on average 4.0012584589813605) internal successors, (168513), 42116 states have internal predecessors, (168513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42117 states to 42117 states and 168513 transitions. [2021-07-09 16:28:01,344 INFO L78 Accepts]: Start accepts. Automaton has 42117 states and 168513 transitions. Word has length 36 [2021-07-09 16:28:01,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:28:01,358 INFO L482 AbstractCegarLoop]: Abstraction has 42117 states and 168513 transitions. [2021-07-09 16:28:01,358 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 42117 states and 168513 transitions. [2021-07-09 16:28:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-07-09 16:28:01,361 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:28:01,361 INFO L508 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] [2021-07-09 16:28:01,361 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-09 16:28:01,361 INFO L430 AbstractCegarLoop]: === Iteration 2 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:28:01,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:28:01,362 INFO L82 PathProgramCache]: Analyzing trace with hash -961474224, now seen corresponding path program 1 times [2021-07-09 16:28:01,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:28:01,362 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347991966] [2021-07-09 16:28:01,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:28:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:28:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:28:01,450 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:28:01,450 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347991966] [2021-07-09 16:28:01,451 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347991966] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:28:01,451 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:28:01,451 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-09 16:28:01,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884256251] [2021-07-09 16:28:01,452 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-09 16:28:01,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:28:01,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-09 16:28:01,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 16:28:01,453 INFO L87 Difference]: Start difference. First operand 42117 states and 168513 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:01,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:28:01,893 INFO L93 Difference]: Finished difference Result 39231 states and 150811 transitions. [2021-07-09 16:28:01,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-09 16:28:01,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2021-07-09 16:28:01,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:28:02,536 INFO L225 Difference]: With dead ends: 39231 [2021-07-09 16:28:02,537 INFO L226 Difference]: Without dead ends: 38349 [2021-07-09 16:28:02,537 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 16:28:02,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38349 states. [2021-07-09 16:28:03,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38349 to 38349. [2021-07-09 16:28:03,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38349 states, 38347 states have (on average 3.8422040837614415) internal successors, (147337), 38348 states have internal predecessors, (147337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38349 states to 38349 states and 147337 transitions. [2021-07-09 16:28:04,106 INFO L78 Accepts]: Start accepts. Automaton has 38349 states and 147337 transitions. Word has length 39 [2021-07-09 16:28:04,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:28:04,107 INFO L482 AbstractCegarLoop]: Abstraction has 38349 states and 147337 transitions. [2021-07-09 16:28:04,107 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:04,107 INFO L276 IsEmpty]: Start isEmpty. Operand 38349 states and 147337 transitions. [2021-07-09 16:28:04,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-07-09 16:28:04,113 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:28:04,113 INFO L508 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] [2021-07-09 16:28:04,114 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-09 16:28:04,114 INFO L430 AbstractCegarLoop]: === Iteration 3 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:28:04,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:28:04,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1809459636, now seen corresponding path program 2 times [2021-07-09 16:28:04,121 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:28:04,121 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813066366] [2021-07-09 16:28:04,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:28:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:28:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:28:04,197 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:28:04,197 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813066366] [2021-07-09 16:28:04,197 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813066366] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:28:04,197 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:28:04,197 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-09 16:28:04,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715138043] [2021-07-09 16:28:04,198 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-09 16:28:04,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:28:04,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-09 16:28:04,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-09 16:28:04,199 INFO L87 Difference]: Start difference. First operand 38349 states and 147337 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:04,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:28:04,374 INFO L93 Difference]: Finished difference Result 27110 states and 97371 transitions. [2021-07-09 16:28:04,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-09 16:28:04,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2021-07-09 16:28:04,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:28:04,780 INFO L225 Difference]: With dead ends: 27110 [2021-07-09 16:28:04,780 INFO L226 Difference]: Without dead ends: 24090 [2021-07-09 16:28:04,780 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-09 16:28:04,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24090 states. [2021-07-09 16:28:05,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24090 to 20943. [2021-07-09 16:28:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20943 states, 20938 states have (on average 3.6121883656509697) internal successors, (75632), 20942 states have internal predecessors, (75632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:05,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20943 states to 20943 states and 75632 transitions. [2021-07-09 16:28:05,551 INFO L78 Accepts]: Start accepts. Automaton has 20943 states and 75632 transitions. Word has length 39 [2021-07-09 16:28:05,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:28:05,551 INFO L482 AbstractCegarLoop]: Abstraction has 20943 states and 75632 transitions. [2021-07-09 16:28:05,552 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:05,552 INFO L276 IsEmpty]: Start isEmpty. Operand 20943 states and 75632 transitions. [2021-07-09 16:28:05,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-07-09 16:28:05,568 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:28:05,568 INFO L508 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] [2021-07-09 16:28:05,568 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-09 16:28:05,568 INFO L430 AbstractCegarLoop]: === Iteration 4 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:28:05,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:28:05,569 INFO L82 PathProgramCache]: Analyzing trace with hash 980522090, now seen corresponding path program 1 times [2021-07-09 16:28:05,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:28:05,569 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75759871] [2021-07-09 16:28:05,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:28:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:28:05,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:28:05,612 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:28:05,612 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75759871] [2021-07-09 16:28:05,613 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75759871] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:28:05,613 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:28:05,613 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:28:05,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222388989] [2021-07-09 16:28:05,613 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:28:05,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:28:05,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:28:05,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:28:05,614 INFO L87 Difference]: Start difference. First operand 20943 states and 75632 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:05,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:28:05,816 INFO L93 Difference]: Finished difference Result 23659 states and 83402 transitions. [2021-07-09 16:28:05,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-09 16:28:05,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-07-09 16:28:05,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:28:05,866 INFO L225 Difference]: With dead ends: 23659 [2021-07-09 16:28:05,866 INFO L226 Difference]: Without dead ends: 17229 [2021-07-09 16:28:05,867 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.9ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-07-09 16:28:05,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17229 states. [2021-07-09 16:28:06,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17229 to 13563. [2021-07-09 16:28:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13563 states, 13562 states have (on average 3.5751364105589145) internal successors, (48486), 13562 states have internal predecessors, (48486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:06,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13563 states to 13563 states and 48486 transitions. [2021-07-09 16:28:06,324 INFO L78 Accepts]: Start accepts. Automaton has 13563 states and 48486 transitions. Word has length 53 [2021-07-09 16:28:06,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:28:06,325 INFO L482 AbstractCegarLoop]: Abstraction has 13563 states and 48486 transitions. [2021-07-09 16:28:06,325 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:06,325 INFO L276 IsEmpty]: Start isEmpty. Operand 13563 states and 48486 transitions. [2021-07-09 16:28:06,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-07-09 16:28:06,341 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:28:06,342 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:28:06,342 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-09 16:28:06,342 INFO L430 AbstractCegarLoop]: === Iteration 5 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:28:06,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:28:06,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1901331, now seen corresponding path program 1 times [2021-07-09 16:28:06,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:28:06,342 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112969042] [2021-07-09 16:28:06,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:28:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:28:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:28:06,388 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:28:06,388 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112969042] [2021-07-09 16:28:06,388 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112969042] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:28:06,388 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:28:06,388 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-09 16:28:06,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717474033] [2021-07-09 16:28:06,389 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-09 16:28:06,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:28:06,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-09 16:28:06,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-09 16:28:06,389 INFO L87 Difference]: Start difference. First operand 13563 states and 48486 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:28:06,475 INFO L93 Difference]: Finished difference Result 15627 states and 55450 transitions. [2021-07-09 16:28:06,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-09 16:28:06,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-07-09 16:28:06,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:28:06,502 INFO L225 Difference]: With dead ends: 15627 [2021-07-09 16:28:06,503 INFO L226 Difference]: Without dead ends: 11235 [2021-07-09 16:28:06,503 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-09 16:28:06,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11235 states. [2021-07-09 16:28:06,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11235 to 10323. [2021-07-09 16:28:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10323 states, 10322 states have (on average 3.5394303429567913) internal successors, (36534), 10322 states have internal predecessors, (36534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:06,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10323 states to 10323 states and 36534 transitions. [2021-07-09 16:28:06,919 INFO L78 Accepts]: Start accepts. Automaton has 10323 states and 36534 transitions. Word has length 60 [2021-07-09 16:28:06,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:28:06,919 INFO L482 AbstractCegarLoop]: Abstraction has 10323 states and 36534 transitions. [2021-07-09 16:28:06,920 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 10323 states and 36534 transitions. [2021-07-09 16:28:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-07-09 16:28:06,931 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:28:06,931 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:28:06,931 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-09 16:28:06,931 INFO L430 AbstractCegarLoop]: === Iteration 6 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:28:06,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:28:06,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1359958325, now seen corresponding path program 2 times [2021-07-09 16:28:06,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:28:06,932 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455439312] [2021-07-09 16:28:06,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:28:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:28:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:28:06,981 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:28:06,981 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455439312] [2021-07-09 16:28:06,981 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455439312] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:28:06,981 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:28:06,981 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-09 16:28:06,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145549938] [2021-07-09 16:28:06,982 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-09 16:28:06,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:28:06,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-09 16:28:06,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-09 16:28:06,982 INFO L87 Difference]: Start difference. First operand 10323 states and 36534 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:28:07,028 INFO L93 Difference]: Finished difference Result 4977 states and 16629 transitions. [2021-07-09 16:28:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-09 16:28:07,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-07-09 16:28:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:28:07,030 INFO L225 Difference]: With dead ends: 4977 [2021-07-09 16:28:07,030 INFO L226 Difference]: Without dead ends: 0 [2021-07-09 16:28:07,030 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-09 16:28:07,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-09 16:28:07,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-09 16:28:07,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:07,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-09 16:28:07,031 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2021-07-09 16:28:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:28:07,031 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-09 16:28:07,031 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:07,031 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-09 16:28:07,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-09 16:28:07,031 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-09 16:28:07,032 INFO L301 ceAbstractionStarter]: Result for error location readerThread1of1ForFork0 was SAFE (1/3) [2021-07-09 16:28:07,034 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-09 16:28:07,034 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 16:28:07,034 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 16:28:07,034 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 16:28:07,034 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 16:28:07,034 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 16:28:07,034 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 16:28:07,035 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 16:28:07,035 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == readerThread1of1ForFork3======== [2021-07-09 16:28:07,036 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 119 places, 120 transitions, 308 flow [2021-07-09 16:28:08,042 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 40427 states, 40425 states have (on average 4.130142238713668) internal successors, (166961), 40426 states have internal predecessors, (166961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:08,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 40427 states, 40425 states have (on average 4.130142238713668) internal successors, (166961), 40426 states have internal predecessors, (166961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:08,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-07-09 16:28:08,145 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:28:08,145 INFO L508 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] [2021-07-09 16:28:08,145 INFO L430 AbstractCegarLoop]: === Iteration 1 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:28:08,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:28:08,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1856661830, now seen corresponding path program 1 times [2021-07-09 16:28:08,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:28:08,147 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721130510] [2021-07-09 16:28:08,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:28:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:28:08,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:28:08,259 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:28:08,259 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721130510] [2021-07-09 16:28:08,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721130510] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:28:08,259 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:28:08,259 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:28:08,259 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502707950] [2021-07-09 16:28:08,259 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:28:08,259 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:28:08,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:28:08,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:28:08,334 INFO L87 Difference]: Start difference. First operand has 40427 states, 40425 states have (on average 4.130142238713668) internal successors, (166961), 40426 states have internal predecessors, (166961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:28:09,135 INFO L93 Difference]: Finished difference Result 71067 states and 280776 transitions. [2021-07-09 16:28:09,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:28:09,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2021-07-09 16:28:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:28:09,792 INFO L225 Difference]: With dead ends: 71067 [2021-07-09 16:28:09,792 INFO L226 Difference]: Without dead ends: 53634 [2021-07-09 16:28:09,792 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 57.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:28:09,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53634 states. [2021-07-09 16:28:11,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53634 to 42117. [2021-07-09 16:28:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42117 states, 42115 states have (on average 4.000688590763386) internal successors, (168489), 42116 states have internal predecessors, (168489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:12,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42117 states to 42117 states and 168489 transitions. [2021-07-09 16:28:12,007 INFO L78 Accepts]: Start accepts. Automaton has 42117 states and 168489 transitions. Word has length 48 [2021-07-09 16:28:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:28:12,008 INFO L482 AbstractCegarLoop]: Abstraction has 42117 states and 168489 transitions. [2021-07-09 16:28:12,008 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:12,008 INFO L276 IsEmpty]: Start isEmpty. Operand 42117 states and 168489 transitions. [2021-07-09 16:28:12,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-07-09 16:28:12,028 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:28:12,028 INFO L508 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] [2021-07-09 16:28:12,029 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-09 16:28:12,029 INFO L430 AbstractCegarLoop]: === Iteration 2 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:28:12,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:28:12,029 INFO L82 PathProgramCache]: Analyzing trace with hash 333335531, now seen corresponding path program 1 times [2021-07-09 16:28:12,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:28:12,029 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270368146] [2021-07-09 16:28:12,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:28:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:28:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:28:12,052 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:28:12,052 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270368146] [2021-07-09 16:28:12,053 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270368146] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:28:12,053 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:28:12,053 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-09 16:28:12,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071753468] [2021-07-09 16:28:12,053 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-09 16:28:12,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:28:12,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-09 16:28:12,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 16:28:12,054 INFO L87 Difference]: Start difference. First operand 42117 states and 168489 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:28:12,257 INFO L93 Difference]: Finished difference Result 39219 states and 150733 transitions. [2021-07-09 16:28:12,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-09 16:28:12,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-07-09 16:28:12,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:28:12,848 INFO L225 Difference]: With dead ends: 39219 [2021-07-09 16:28:12,848 INFO L226 Difference]: Without dead ends: 38013 [2021-07-09 16:28:12,849 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 16:28:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38013 states. [2021-07-09 16:28:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38013 to 38013. [2021-07-09 16:28:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38013 states, 38011 states have (on average 3.8428612769987636) internal successors, (146071), 38012 states have internal predecessors, (146071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38013 states to 38013 states and 146071 transitions. [2021-07-09 16:28:13,918 INFO L78 Accepts]: Start accepts. Automaton has 38013 states and 146071 transitions. Word has length 51 [2021-07-09 16:28:13,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:28:13,919 INFO L482 AbstractCegarLoop]: Abstraction has 38013 states and 146071 transitions. [2021-07-09 16:28:13,919 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 38013 states and 146071 transitions. [2021-07-09 16:28:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-07-09 16:28:13,937 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:28:13,938 INFO L508 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] [2021-07-09 16:28:13,938 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-09 16:28:13,938 INFO L430 AbstractCegarLoop]: === Iteration 3 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:28:13,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:28:13,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1396420791, now seen corresponding path program 2 times [2021-07-09 16:28:13,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:28:13,938 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078353485] [2021-07-09 16:28:13,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:28:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:28:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:28:14,046 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:28:14,046 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078353485] [2021-07-09 16:28:14,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078353485] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:28:14,047 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:28:14,047 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-09 16:28:14,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304133374] [2021-07-09 16:28:14,047 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-09 16:28:14,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:28:14,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-09 16:28:14,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-09 16:28:14,048 INFO L87 Difference]: Start difference. First operand 38013 states and 146071 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:28:14,649 INFO L93 Difference]: Finished difference Result 48651 states and 182114 transitions. [2021-07-09 16:28:14,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-09 16:28:14,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2021-07-09 16:28:14,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:28:14,811 INFO L225 Difference]: With dead ends: 48651 [2021-07-09 16:28:14,812 INFO L226 Difference]: Without dead ends: 46245 [2021-07-09 16:28:14,812 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-09 16:28:14,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46245 states. [2021-07-09 16:28:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46245 to 35241. [2021-07-09 16:28:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35241 states, 35237 states have (on average 3.8162726679342738) internal successors, (134474), 35240 states have internal predecessors, (134474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35241 states to 35241 states and 134474 transitions. [2021-07-09 16:28:16,272 INFO L78 Accepts]: Start accepts. Automaton has 35241 states and 134474 transitions. Word has length 51 [2021-07-09 16:28:16,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:28:16,272 INFO L482 AbstractCegarLoop]: Abstraction has 35241 states and 134474 transitions. [2021-07-09 16:28:16,272 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:16,273 INFO L276 IsEmpty]: Start isEmpty. Operand 35241 states and 134474 transitions. [2021-07-09 16:28:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-07-09 16:28:16,301 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:28:16,301 INFO L508 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] [2021-07-09 16:28:16,301 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-09 16:28:16,301 INFO L430 AbstractCegarLoop]: === Iteration 4 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:28:16,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:28:16,302 INFO L82 PathProgramCache]: Analyzing trace with hash -219237236, now seen corresponding path program 1 times [2021-07-09 16:28:16,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:28:16,304 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673042715] [2021-07-09 16:28:16,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:28:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:28:16,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:28:16,393 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:28:16,393 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673042715] [2021-07-09 16:28:16,393 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673042715] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:28:16,393 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:28:16,393 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:28:16,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990930073] [2021-07-09 16:28:16,394 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:28:16,394 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:28:16,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:28:16,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:28:16,394 INFO L87 Difference]: Start difference. First operand 35241 states and 134474 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:17,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:28:17,167 INFO L93 Difference]: Finished difference Result 71416 states and 266999 transitions. [2021-07-09 16:28:17,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-09 16:28:17,168 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2021-07-09 16:28:17,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:28:17,504 INFO L225 Difference]: With dead ends: 71416 [2021-07-09 16:28:17,504 INFO L226 Difference]: Without dead ends: 61540 [2021-07-09 16:28:17,504 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-07-09 16:28:17,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61540 states. [2021-07-09 16:28:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61540 to 30530. [2021-07-09 16:28:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30530 states, 30526 states have (on average 3.791161632706545) internal successors, (115729), 30529 states have internal predecessors, (115729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30530 states to 30530 states and 115729 transitions. [2021-07-09 16:28:19,022 INFO L78 Accepts]: Start accepts. Automaton has 30530 states and 115729 transitions. Word has length 53 [2021-07-09 16:28:19,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:28:19,024 INFO L482 AbstractCegarLoop]: Abstraction has 30530 states and 115729 transitions. [2021-07-09 16:28:19,024 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:19,024 INFO L276 IsEmpty]: Start isEmpty. Operand 30530 states and 115729 transitions. [2021-07-09 16:28:19,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-07-09 16:28:19,040 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:28:19,041 INFO L508 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] [2021-07-09 16:28:19,041 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-09 16:28:19,041 INFO L430 AbstractCegarLoop]: === Iteration 5 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:28:19,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:28:19,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1983128374, now seen corresponding path program 1 times [2021-07-09 16:28:19,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:28:19,043 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709280803] [2021-07-09 16:28:19,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:28:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:28:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:28:19,149 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:28:19,149 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709280803] [2021-07-09 16:28:19,150 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709280803] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:28:19,150 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:28:19,150 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-09 16:28:19,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917228293] [2021-07-09 16:28:19,150 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-09 16:28:19,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:28:19,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-09 16:28:19,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-09 16:28:19,151 INFO L87 Difference]: Start difference. First operand 30530 states and 115729 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:28:19,242 INFO L93 Difference]: Finished difference Result 17573 states and 62004 transitions. [2021-07-09 16:28:19,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-09 16:28:19,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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 54 [2021-07-09 16:28:19,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:28:19,275 INFO L225 Difference]: With dead ends: 17573 [2021-07-09 16:28:19,275 INFO L226 Difference]: Without dead ends: 12369 [2021-07-09 16:28:19,275 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-09 16:28:19,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12369 states. [2021-07-09 16:28:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12369 to 11457. [2021-07-09 16:28:19,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11457 states, 11456 states have (on average 3.4860335195530725) internal successors, (39936), 11456 states have internal predecessors, (39936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11457 states to 11457 states and 39936 transitions. [2021-07-09 16:28:19,488 INFO L78 Accepts]: Start accepts. Automaton has 11457 states and 39936 transitions. Word has length 54 [2021-07-09 16:28:19,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:28:19,488 INFO L482 AbstractCegarLoop]: Abstraction has 11457 states and 39936 transitions. [2021-07-09 16:28:19,488 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 11457 states and 39936 transitions. [2021-07-09 16:28:19,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-07-09 16:28:19,829 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:28:19,829 INFO L508 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 16:28:19,829 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-09 16:28:19,829 INFO L430 AbstractCegarLoop]: === Iteration 6 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:28:19,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:28:19,830 INFO L82 PathProgramCache]: Analyzing trace with hash -676092975, now seen corresponding path program 1 times [2021-07-09 16:28:19,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:28:19,830 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146190180] [2021-07-09 16:28:19,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:28:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:28:19,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:28:19,881 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:28:19,881 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146190180] [2021-07-09 16:28:19,881 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146190180] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:28:19,881 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:28:19,881 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-09 16:28:19,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754659571] [2021-07-09 16:28:19,881 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-09 16:28:19,881 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:28:19,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-09 16:28:19,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-09 16:28:19,882 INFO L87 Difference]: Start difference. First operand 11457 states and 39936 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:28:19,913 INFO L93 Difference]: Finished difference Result 6111 states and 20031 transitions. [2021-07-09 16:28:19,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-09 16:28:19,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-07-09 16:28:19,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:28:19,914 INFO L225 Difference]: With dead ends: 6111 [2021-07-09 16:28:19,914 INFO L226 Difference]: Without dead ends: 0 [2021-07-09 16:28:19,914 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-09 16:28:19,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-09 16:28:19,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-09 16:28:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-09 16:28:19,914 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2021-07-09 16:28:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:28:19,914 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-09 16:28:19,914 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-09 16:28:19,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-09 16:28:19,915 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-09 16:28:19,915 INFO L301 ceAbstractionStarter]: Result for error location readerThread1of1ForFork3 was SAFE (2/3) [2021-07-09 16:28:19,916 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-07-09 16:28:19,916 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 16:28:19,916 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 16:28:19,916 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 16:28:19,917 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 16:28:19,917 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 16:28:19,917 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 16:28:19,917 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 16:28:19,917 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-09 16:28:19,918 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 119 places, 120 transitions, 308 flow [2021-07-09 16:28:19,976 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4767 states, 4765 states have (on average 3.437775445960126) internal successors, (16381), 4766 states have internal predecessors, (16381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 4767 states, 4765 states have (on average 3.437775445960126) internal successors, (16381), 4766 states have internal predecessors, (16381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 16:28:19,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-09 16:28:19,987 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (3/3) [2021-07-09 16:28:19,988 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-09 16:28:19,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.07 04:28:19 BasicIcfg [2021-07-09 16:28:19,990 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-09 16:28:19,991 INFO L168 Benchmark]: Toolchain (without parser) took 26240.64 ms. Allocated memory was 213.9 MB in the beginning and 7.6 GB in the end (delta: 7.4 GB). Free memory was 176.8 MB in the beginning and 5.2 GB in the end (delta: -5.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 8.0 GB. [2021-07-09 16:28:19,992 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 213.9 MB. Free memory was 194.7 MB in the beginning and 194.6 MB in the end (delta: 101.5 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-07-09 16:28:19,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.81 ms. Allocated memory is still 213.9 MB. Free memory was 176.6 MB in the beginning and 187.1 MB in the end (delta: -10.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:28:19,992 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.69 ms. Allocated memory is still 213.9 MB. Free memory was 187.1 MB in the beginning and 185.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:28:19,992 INFO L168 Benchmark]: Boogie Preprocessor took 27.29 ms. Allocated memory is still 213.9 MB. Free memory was 185.0 MB in the beginning and 183.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-07-09 16:28:19,993 INFO L168 Benchmark]: RCFGBuilder took 530.67 ms. Allocated memory is still 213.9 MB. Free memory was 183.8 MB in the beginning and 188.4 MB in the end (delta: -4.6 MB). Peak memory consumption was 29.5 MB. Max. memory is 8.0 GB. [2021-07-09 16:28:19,993 INFO L168 Benchmark]: TraceAbstraction took 25158.60 ms. Allocated memory was 213.9 MB in the beginning and 7.6 GB in the end (delta: 7.4 GB). Free memory was 188.4 MB in the beginning and 5.2 GB in the end (delta: -5.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 8.0 GB. [2021-07-09 16:28:19,994 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.13 ms. Allocated memory is still 213.9 MB. Free memory was 194.7 MB in the beginning and 194.6 MB in the end (delta: 101.5 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 449.81 ms. Allocated memory is still 213.9 MB. Free memory was 176.6 MB in the beginning and 187.1 MB in the end (delta: -10.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 68.69 ms. Allocated memory is still 213.9 MB. Free memory was 187.1 MB in the beginning and 185.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 27.29 ms. Allocated memory is still 213.9 MB. Free memory was 185.0 MB in the beginning and 183.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 530.67 ms. Allocated memory is still 213.9 MB. Free memory was 183.8 MB in the beginning and 188.4 MB in the end (delta: -4.6 MB). Peak memory consumption was 29.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 25158.60 ms. Allocated memory was 213.9 MB in the beginning and 7.6 GB in the end (delta: 7.4 GB). Free memory was 188.4 MB in the beginning and 5.2 GB in the end (delta: -5.1 GB). Peak memory consumption was 2.4 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 739]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: readerThread1of1ForFork0 with 1 thread instances CFG has 7 procedures, 132 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12074.1ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 158.9ms, AutomataDifference: 4009.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1407.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1084 SDtfs, 851 SDslu, 1992 SDs, 0 SdLazy, 249 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 259.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 154.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=42117occurred in iteration=1, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 5926.1ms AutomataMinimizationTime, 6 MinimizatonAttempts, 19242 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 28.8ms SsaConstructionTime, 110.4ms SatisfiabilityAnalysisTime, 302.0ms InterpolantComputationTime, 287 NumberOfCodeBlocks, 287 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 281 ConstructedInterpolants, 0 QuantifiedInterpolants, 541 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: readerThread1of1ForFork3 with 1 thread instances CFG has 7 procedures, 132 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12880.5ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 526.8ms, AutomataDifference: 4361.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1007.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1081 SDtfs, 902 SDslu, 2109 SDs, 0 SdLazy, 280 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 138.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 122.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=42117occurred in iteration=1, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 6474.0ms AutomataMinimizationTime, 6 MinimizatonAttempts, 54443 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 23.4ms SsaConstructionTime, 103.6ms SatisfiabilityAnalysisTime, 274.5ms InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 311 ConstructedInterpolants, 0 QuantifiedInterpolants, 641 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 132 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 71.0ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 10.6ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 59.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4767occurred 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! Received shutdown request...