/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-a47a088281b0b97d17910950432b7c5b5bc3adeb-a47a088 [2021-07-13 18:30:02,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-13 18:30:02,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-13 18:30:02,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-13 18:30:02,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-13 18:30:02,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-13 18:30:02,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-13 18:30:02,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-13 18:30:02,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-13 18:30:02,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-13 18:30:02,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-13 18:30:02,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-13 18:30:02,364 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-13 18:30:02,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-13 18:30:02,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-13 18:30:02,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-13 18:30:02,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-13 18:30:02,369 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-13 18:30:02,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-13 18:30:02,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-13 18:30:02,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-13 18:30:02,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-13 18:30:02,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-13 18:30:02,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-13 18:30:02,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-13 18:30:02,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-13 18:30:02,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-13 18:30:02,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-13 18:30:02,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-13 18:30:02,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-13 18:30:02,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-13 18:30:02,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-13 18:30:02,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-13 18:30:02,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-13 18:30:02,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-13 18:30:02,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-13 18:30:02,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-13 18:30:02,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-13 18:30:02,392 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-13 18:30:02,393 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-13 18:30:02,394 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-13 18:30:02,397 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-13 18:30:02,437 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-13 18:30:02,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-13 18:30:02,438 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-13 18:30:02,438 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-13 18:30:02,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-13 18:30:02,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-13 18:30:02,439 INFO L138 SettingsManager]: * Use SBE=true [2021-07-13 18:30:02,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-13 18:30:02,439 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-13 18:30:02,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-13 18:30:02,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-13 18:30:02,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-13 18:30:02,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-13 18:30:02,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-13 18:30:02,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-13 18:30:02,440 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-13 18:30:02,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-13 18:30:02,440 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-13 18:30:02,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-13 18:30:02,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-13 18:30:02,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-13 18:30:02,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-13 18:30:02,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-13 18:30:02,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-13 18:30:02,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-13 18:30:02,441 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-13 18:30:02,441 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-13 18:30:02,441 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-13 18:30:02,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-13 18:30:02,442 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-13 18:30:02,442 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-13 18:30:02,442 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-13 18:30:02,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-13 18:30:02,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-13 18:30:02,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-13 18:30:02,722 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-13 18:30:02,723 INFO L275 PluginConnector]: CDTParser initialized [2021-07-13 18:30:02,724 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-13 18:30:02,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a354e6c09/45f3339c5f3f4eab92bebb5a23d2ed68/FLAG123f3b875 [2021-07-13 18:30:03,181 INFO L306 CDTParser]: Found 1 translation units. [2021-07-13 18:30:03,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/read_write_lock-1.i [2021-07-13 18:30:03,191 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a354e6c09/45f3339c5f3f4eab92bebb5a23d2ed68/FLAG123f3b875 [2021-07-13 18:30:03,208 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a354e6c09/45f3339c5f3f4eab92bebb5a23d2ed68 [2021-07-13 18:30:03,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-13 18:30:03,212 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-13 18:30:03,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-13 18:30:03,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-13 18:30:03,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-13 18:30:03,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:30:03" (1/1) ... [2021-07-13 18:30:03,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@279cf8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:30:03, skipping insertion in model container [2021-07-13 18:30:03,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 06:30:03" (1/1) ... [2021-07-13 18:30:03,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-13 18:30:03,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-13 18:30:03,458 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-07-13 18:30:03,567 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-13 18:30:03,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 18:30:03,582 INFO L203 MainTranslator]: Completed pre-run [2021-07-13 18:30:03,602 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2021-07-13 18:30:03,621 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-13 18:30:03,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-13 18:30:03,658 INFO L208 MainTranslator]: Completed translation [2021-07-13 18:30:03,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:30:03 WrapperNode [2021-07-13 18:30:03,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-13 18:30:03,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-13 18:30:03,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-13 18:30:03,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-13 18:30:03,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:30:03" (1/1) ... [2021-07-13 18:30:03,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:30:03" (1/1) ... [2021-07-13 18:30:03,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-13 18:30:03,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-13 18:30:03,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-13 18:30:03,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-13 18:30:03,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:30:03" (1/1) ... [2021-07-13 18:30:03,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:30:03" (1/1) ... [2021-07-13 18:30:03,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:30:03" (1/1) ... [2021-07-13 18:30:03,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:30:03" (1/1) ... [2021-07-13 18:30:03,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:30:03" (1/1) ... [2021-07-13 18:30:03,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:30:03" (1/1) ... [2021-07-13 18:30:03,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:30:03" (1/1) ... [2021-07-13 18:30:03,740 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-13 18:30:03,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-13 18:30:03,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-13 18:30:03,741 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-13 18:30:03,741 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:30:03" (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-13 18:30:03,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-07-13 18:30:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-13 18:30:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-13 18:30:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2021-07-13 18:30:03,815 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2021-07-13 18:30:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-13 18:30:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-13 18:30:03,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-13 18:30:03,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-13 18:30:03,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-13 18:30:03,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-13 18:30:03,816 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2021-07-13 18:30:03,816 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2021-07-13 18:30:03,817 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-13 18:30:04,377 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-13 18:30:04,377 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-07-13 18:30:04,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:30:04 BoogieIcfgContainer [2021-07-13 18:30:04,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-13 18:30:04,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-13 18:30:04,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-13 18:30:04,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-13 18:30:04,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 06:30:03" (1/3) ... [2021-07-13 18:30:04,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5269e060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:30:04, skipping insertion in model container [2021-07-13 18:30:04,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 06:30:03" (2/3) ... [2021-07-13 18:30:04,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5269e060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 06:30:04, skipping insertion in model container [2021-07-13 18:30:04,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 06:30:04" (3/3) ... [2021-07-13 18:30:04,384 INFO L111 eAbstractionObserver]: Analyzing ICFG read_write_lock-1.i [2021-07-13 18:30:04,387 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-13 18:30:04,388 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-13 18:30:04,388 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-07-13 18:30:04,388 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-13 18:30:04,413 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,413 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,413 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,413 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,414 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,414 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,414 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,414 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,414 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,414 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,414 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,414 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,414 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,415 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,415 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,415 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,415 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,415 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,415 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,415 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,415 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,416 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,416 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,416 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,416 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,416 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,416 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,416 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,416 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,416 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,417 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,417 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,417 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,417 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,417 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,417 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,417 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,417 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,417 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,418 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,418 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,418 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,418 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,418 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,418 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,418 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,418 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,418 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,419 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,419 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,419 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,419 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,419 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,419 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,419 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,420 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,420 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,420 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,420 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,420 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,420 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,420 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,420 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,420 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,420 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,421 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,421 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,421 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,421 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,421 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,421 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,421 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,421 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,421 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,422 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,422 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,422 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,422 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,422 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,422 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,422 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,423 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,423 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,423 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,423 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,423 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,423 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,423 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,423 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,423 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,423 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,424 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,424 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,424 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,424 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,424 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,424 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,424 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,424 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,424 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,426 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,426 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,426 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,426 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,426 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,427 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,427 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,427 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,427 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,431 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,431 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,431 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,431 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,431 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,431 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,433 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,433 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,433 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,433 WARN L313 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,433 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,433 WARN L313 ript$VariableManager]: TermVariabe writerThread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,443 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,444 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,444 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,444 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,444 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,445 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,445 WARN L313 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,445 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~ly~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,445 WARN L313 ript$VariableManager]: TermVariabe readerThread1of1ForFork3_~lx~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-13 18:30:04,475 INFO L149 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2021-07-13 18:30:04,490 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-13 18:30:04,502 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 18:30:04,502 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 18:30:04,502 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 18:30:04,502 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 18:30:04,502 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 18:30:04,503 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 18:30:04,503 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 18:30:04,503 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == readerThread1of1ForFork0======== [2021-07-13 18:30:04,511 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 119 places, 120 transitions, 308 flow [2021-07-13 18:30:05,922 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-13 18:30:06,004 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-13 18:30:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-07-13 18:30:06,019 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:30:06,020 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-13 18:30:06,020 INFO L430 AbstractCegarLoop]: === Iteration 1 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:30:06,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:30:06,027 INFO L82 PathProgramCache]: Analyzing trace with hash -576272667, now seen corresponding path program 1 times [2021-07-13 18:30:06,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:30:06,033 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601333776] [2021-07-13 18:30:06,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:30:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:30:06,246 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-13 18:30:06,247 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:30:06,247 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601333776] [2021-07-13 18:30:06,247 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601333776] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:30:06,247 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:30:06,247 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:30:06,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92776025] [2021-07-13 18:30:06,251 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:30:06,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:30:06,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:30:06,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:30:06,337 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-13 18:30:07,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:30:07,586 INFO L93 Difference]: Finished difference Result 70899 states and 279570 transitions. [2021-07-13 18:30:07,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:30:07,587 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-13 18:30:07,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:30:08,190 INFO L225 Difference]: With dead ends: 70899 [2021-07-13 18:30:08,190 INFO L226 Difference]: Without dead ends: 53634 [2021-07-13 18:30:08,191 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 53.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:30:08,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53634 states. [2021-07-13 18:30:10,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53634 to 42117. [2021-07-13 18:30:10,264 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-13 18:30:10,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42117 states to 42117 states and 168513 transitions. [2021-07-13 18:30:10,588 INFO L78 Accepts]: Start accepts. Automaton has 42117 states and 168513 transitions. Word has length 36 [2021-07-13 18:30:10,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:30:10,589 INFO L482 AbstractCegarLoop]: Abstraction has 42117 states and 168513 transitions. [2021-07-13 18:30:10,589 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-13 18:30:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 42117 states and 168513 transitions. [2021-07-13 18:30:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-07-13 18:30:10,593 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:30:10,593 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-13 18:30:10,594 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-13 18:30:10,594 INFO L430 AbstractCegarLoop]: === Iteration 2 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:30:10,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:30:10,597 INFO L82 PathProgramCache]: Analyzing trace with hash -961474224, now seen corresponding path program 1 times [2021-07-13 18:30:10,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:30:10,597 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497326030] [2021-07-13 18:30:10,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:30:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:30:10,677 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-13 18:30:10,678 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:30:10,678 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497326030] [2021-07-13 18:30:10,678 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497326030] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:30:10,679 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:30:10,679 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-13 18:30:10,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871299434] [2021-07-13 18:30:10,680 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 18:30:10,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:30:10,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 18:30:10,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 18:30:10,682 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-13 18:30:11,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:30:11,340 INFO L93 Difference]: Finished difference Result 39231 states and 150811 transitions. [2021-07-13 18:30:11,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 18:30:11,340 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-13 18:30:11,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:30:11,783 INFO L225 Difference]: With dead ends: 39231 [2021-07-13 18:30:11,783 INFO L226 Difference]: Without dead ends: 38349 [2021-07-13 18:30:11,784 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 18:30:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38349 states. [2021-07-13 18:30:12,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38349 to 38349. [2021-07-13 18:30:12,948 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-13 18:30:13,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38349 states to 38349 states and 147337 transitions. [2021-07-13 18:30:13,114 INFO L78 Accepts]: Start accepts. Automaton has 38349 states and 147337 transitions. Word has length 39 [2021-07-13 18:30:13,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:30:13,120 INFO L482 AbstractCegarLoop]: Abstraction has 38349 states and 147337 transitions. [2021-07-13 18:30:13,120 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-13 18:30:13,121 INFO L276 IsEmpty]: Start isEmpty. Operand 38349 states and 147337 transitions. [2021-07-13 18:30:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-07-13 18:30:13,126 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:30:13,139 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-13 18:30:13,140 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-13 18:30:13,140 INFO L430 AbstractCegarLoop]: === Iteration 3 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:30:13,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:30:13,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1809459636, now seen corresponding path program 2 times [2021-07-13 18:30:13,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:30:13,146 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348856297] [2021-07-13 18:30:13,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:30:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:30:13,236 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-13 18:30:13,236 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:30:13,236 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348856297] [2021-07-13 18:30:13,236 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348856297] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:30:13,237 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:30:13,237 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-13 18:30:13,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318095466] [2021-07-13 18:30:13,237 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-13 18:30:13,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:30:13,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-13 18:30:13,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-13 18:30:13,238 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-13 18:30:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:30:13,769 INFO L93 Difference]: Finished difference Result 27110 states and 97371 transitions. [2021-07-13 18:30:13,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-13 18:30:13,770 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-13 18:30:13,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:30:13,849 INFO L225 Difference]: With dead ends: 27110 [2021-07-13 18:30:13,849 INFO L226 Difference]: Without dead ends: 24090 [2021-07-13 18:30:13,850 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-13 18:30:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24090 states. [2021-07-13 18:30:14,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24090 to 20943. [2021-07-13 18:30:14,530 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-13 18:30:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20943 states to 20943 states and 75632 transitions. [2021-07-13 18:30:14,593 INFO L78 Accepts]: Start accepts. Automaton has 20943 states and 75632 transitions. Word has length 39 [2021-07-13 18:30:14,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:30:14,594 INFO L482 AbstractCegarLoop]: Abstraction has 20943 states and 75632 transitions. [2021-07-13 18:30:14,594 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-13 18:30:14,594 INFO L276 IsEmpty]: Start isEmpty. Operand 20943 states and 75632 transitions. [2021-07-13 18:30:14,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-07-13 18:30:14,610 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:30:14,610 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-13 18:30:14,611 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-13 18:30:14,611 INFO L430 AbstractCegarLoop]: === Iteration 4 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:30:14,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:30:14,611 INFO L82 PathProgramCache]: Analyzing trace with hash 980522090, now seen corresponding path program 1 times [2021-07-13 18:30:14,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:30:14,612 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205407314] [2021-07-13 18:30:14,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:30:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:30:14,669 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-13 18:30:14,669 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:30:14,670 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205407314] [2021-07-13 18:30:14,670 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205407314] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:30:14,670 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:30:14,670 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:30:14,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697455835] [2021-07-13 18:30:14,670 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:30:14,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:30:14,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:30:14,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:30:14,671 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-13 18:30:14,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:30:14,848 INFO L93 Difference]: Finished difference Result 23659 states and 83402 transitions. [2021-07-13 18:30:14,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-13 18:30:14,848 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-13 18:30:14,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:30:15,099 INFO L225 Difference]: With dead ends: 23659 [2021-07-13 18:30:15,099 INFO L226 Difference]: Without dead ends: 17229 [2021-07-13 18:30:15,112 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.4ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-07-13 18:30:15,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17229 states. [2021-07-13 18:30:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17229 to 13563. [2021-07-13 18:30:15,400 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-13 18:30:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13563 states to 13563 states and 48486 transitions. [2021-07-13 18:30:15,445 INFO L78 Accepts]: Start accepts. Automaton has 13563 states and 48486 transitions. Word has length 53 [2021-07-13 18:30:15,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:30:15,446 INFO L482 AbstractCegarLoop]: Abstraction has 13563 states and 48486 transitions. [2021-07-13 18:30:15,446 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-13 18:30:15,447 INFO L276 IsEmpty]: Start isEmpty. Operand 13563 states and 48486 transitions. [2021-07-13 18:30:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-07-13 18:30:15,467 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:30:15,467 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-13 18:30:15,467 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-13 18:30:15,468 INFO L430 AbstractCegarLoop]: === Iteration 5 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:30:15,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:30:15,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1901331, now seen corresponding path program 1 times [2021-07-13 18:30:15,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:30:15,468 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197324346] [2021-07-13 18:30:15,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:30:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:30:15,554 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-13 18:30:15,555 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:30:15,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197324346] [2021-07-13 18:30:15,555 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197324346] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:30:15,555 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:30:15,555 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-13 18:30:15,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458668018] [2021-07-13 18:30:15,555 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-13 18:30:15,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:30:15,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-13 18:30:15,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-13 18:30:15,556 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-13 18:30:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:30:15,852 INFO L93 Difference]: Finished difference Result 15627 states and 55450 transitions. [2021-07-13 18:30:15,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-13 18:30:15,852 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-13 18:30:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:30:15,897 INFO L225 Difference]: With dead ends: 15627 [2021-07-13 18:30:15,902 INFO L226 Difference]: Without dead ends: 11235 [2021-07-13 18:30:15,902 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.7ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-13 18:30:15,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11235 states. [2021-07-13 18:30:16,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11235 to 10323. [2021-07-13 18:30:16,132 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-13 18:30:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10323 states to 10323 states and 36534 transitions. [2021-07-13 18:30:16,174 INFO L78 Accepts]: Start accepts. Automaton has 10323 states and 36534 transitions. Word has length 60 [2021-07-13 18:30:16,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:30:16,174 INFO L482 AbstractCegarLoop]: Abstraction has 10323 states and 36534 transitions. [2021-07-13 18:30:16,175 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-13 18:30:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 10323 states and 36534 transitions. [2021-07-13 18:30:16,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-07-13 18:30:16,186 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:30:16,186 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-13 18:30:16,186 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-13 18:30:16,186 INFO L430 AbstractCegarLoop]: === Iteration 6 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:30:16,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:30:16,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1359958325, now seen corresponding path program 2 times [2021-07-13 18:30:16,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:30:16,187 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466029616] [2021-07-13 18:30:16,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:30:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:30:16,237 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-13 18:30:16,237 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:30:16,237 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466029616] [2021-07-13 18:30:16,237 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466029616] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:30:16,238 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:30:16,238 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-13 18:30:16,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754277512] [2021-07-13 18:30:16,238 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-13 18:30:16,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:30:16,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-13 18:30:16,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-13 18:30:16,239 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-13 18:30:16,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:30:16,292 INFO L93 Difference]: Finished difference Result 4977 states and 16629 transitions. [2021-07-13 18:30:16,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-13 18:30:16,293 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-13 18:30:16,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:30:16,294 INFO L225 Difference]: With dead ends: 4977 [2021-07-13 18:30:16,294 INFO L226 Difference]: Without dead ends: 0 [2021-07-13 18:30:16,294 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-13 18:30:16,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-13 18:30:16,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-13 18:30:16,295 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-13 18:30:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-13 18:30:16,295 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2021-07-13 18:30:16,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:30:16,295 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-13 18:30:16,295 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-13 18:30:16,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-13 18:30:16,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-13 18:30:16,296 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-13 18:30:16,296 INFO L301 ceAbstractionStarter]: Result for error location readerThread1of1ForFork0 was SAFE (1/3) [2021-07-13 18:30:16,298 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-13 18:30:16,299 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 18:30:16,299 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 18:30:16,299 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 18:30:16,299 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 18:30:16,299 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 18:30:16,299 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 18:30:16,299 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 18:30:16,299 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == readerThread1of1ForFork3======== [2021-07-13 18:30:16,307 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 119 places, 120 transitions, 308 flow [2021-07-13 18:30:17,261 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-13 18:30:17,328 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-13 18:30:17,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-07-13 18:30:17,343 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:30:17,343 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-13 18:30:17,344 INFO L430 AbstractCegarLoop]: === Iteration 1 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:30:17,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:30:17,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1856661830, now seen corresponding path program 1 times [2021-07-13 18:30:17,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:30:17,344 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118137210] [2021-07-13 18:30:17,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:30:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:30:17,376 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-13 18:30:17,376 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:30:17,376 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118137210] [2021-07-13 18:30:17,377 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118137210] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:30:17,377 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:30:17,377 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:30:17,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303003008] [2021-07-13 18:30:17,377 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:30:17,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:30:17,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:30:17,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:30:17,445 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-13 18:30:18,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:30:18,186 INFO L93 Difference]: Finished difference Result 71067 states and 280776 transitions. [2021-07-13 18:30:18,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-13 18:30:18,187 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-13 18:30:18,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:30:18,426 INFO L225 Difference]: With dead ends: 71067 [2021-07-13 18:30:18,426 INFO L226 Difference]: Without dead ends: 53634 [2021-07-13 18:30:18,426 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 38.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-13 18:30:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53634 states. [2021-07-13 18:30:19,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53634 to 42117. [2021-07-13 18:30:20,036 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-13 18:30:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42117 states to 42117 states and 168489 transitions. [2021-07-13 18:30:20,455 INFO L78 Accepts]: Start accepts. Automaton has 42117 states and 168489 transitions. Word has length 48 [2021-07-13 18:30:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:30:20,456 INFO L482 AbstractCegarLoop]: Abstraction has 42117 states and 168489 transitions. [2021-07-13 18:30:20,456 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-13 18:30:20,456 INFO L276 IsEmpty]: Start isEmpty. Operand 42117 states and 168489 transitions. [2021-07-13 18:30:20,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-07-13 18:30:20,522 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:30:20,522 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-13 18:30:20,522 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-13 18:30:20,522 INFO L430 AbstractCegarLoop]: === Iteration 2 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:30:20,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:30:20,523 INFO L82 PathProgramCache]: Analyzing trace with hash 333335531, now seen corresponding path program 1 times [2021-07-13 18:30:20,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:30:20,523 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664783330] [2021-07-13 18:30:20,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:30:20,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:30:20,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:30:20,570 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:30:20,570 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664783330] [2021-07-13 18:30:20,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664783330] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:30:20,570 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:30:20,571 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-13 18:30:20,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170405691] [2021-07-13 18:30:20,572 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-13 18:30:20,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:30:20,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-13 18:30:20,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 18:30:20,573 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-13 18:30:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:30:20,837 INFO L93 Difference]: Finished difference Result 39219 states and 150733 transitions. [2021-07-13 18:30:20,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-13 18:30:20,838 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-13 18:30:20,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:30:20,975 INFO L225 Difference]: With dead ends: 39219 [2021-07-13 18:30:20,976 INFO L226 Difference]: Without dead ends: 38013 [2021-07-13 18:30:20,976 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-13 18:30:21,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38013 states. [2021-07-13 18:30:22,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38013 to 38013. [2021-07-13 18:30:22,216 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-13 18:30:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38013 states to 38013 states and 146071 transitions. [2021-07-13 18:30:22,369 INFO L78 Accepts]: Start accepts. Automaton has 38013 states and 146071 transitions. Word has length 51 [2021-07-13 18:30:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:30:22,370 INFO L482 AbstractCegarLoop]: Abstraction has 38013 states and 146071 transitions. [2021-07-13 18:30:22,370 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-13 18:30:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 38013 states and 146071 transitions. [2021-07-13 18:30:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-07-13 18:30:22,388 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:30:22,388 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-13 18:30:22,389 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-13 18:30:22,389 INFO L430 AbstractCegarLoop]: === Iteration 3 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:30:22,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:30:22,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1396420791, now seen corresponding path program 2 times [2021-07-13 18:30:22,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:30:22,389 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303763047] [2021-07-13 18:30:22,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:30:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:30:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-13 18:30:22,434 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:30:22,434 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303763047] [2021-07-13 18:30:22,434 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303763047] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:30:22,434 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:30:22,434 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-13 18:30:22,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310020107] [2021-07-13 18:30:22,435 INFO L462 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-13 18:30:22,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:30:22,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-13 18:30:22,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-13 18:30:22,435 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-13 18:30:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:30:22,982 INFO L93 Difference]: Finished difference Result 48651 states and 182114 transitions. [2021-07-13 18:30:22,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-13 18:30:22,982 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-13 18:30:22,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:30:23,144 INFO L225 Difference]: With dead ends: 48651 [2021-07-13 18:30:23,144 INFO L226 Difference]: Without dead ends: 46245 [2021-07-13 18:30:23,144 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-13 18:30:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46245 states. [2021-07-13 18:30:24,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46245 to 35241. [2021-07-13 18:30:24,183 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-13 18:30:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35241 states to 35241 states and 134474 transitions. [2021-07-13 18:30:24,499 INFO L78 Accepts]: Start accepts. Automaton has 35241 states and 134474 transitions. Word has length 51 [2021-07-13 18:30:24,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:30:24,499 INFO L482 AbstractCegarLoop]: Abstraction has 35241 states and 134474 transitions. [2021-07-13 18:30:24,500 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-13 18:30:24,500 INFO L276 IsEmpty]: Start isEmpty. Operand 35241 states and 134474 transitions. [2021-07-13 18:30:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-07-13 18:30:24,519 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:30:24,519 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-13 18:30:24,519 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-13 18:30:24,519 INFO L430 AbstractCegarLoop]: === Iteration 4 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:30:24,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:30:24,519 INFO L82 PathProgramCache]: Analyzing trace with hash -219237236, now seen corresponding path program 1 times [2021-07-13 18:30:24,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:30:24,520 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774576286] [2021-07-13 18:30:24,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:30:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:30:24,562 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-13 18:30:24,562 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:30:24,562 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774576286] [2021-07-13 18:30:24,562 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774576286] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:30:24,563 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:30:24,563 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-13 18:30:24,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904784840] [2021-07-13 18:30:24,563 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-13 18:30:24,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:30:24,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-13 18:30:24,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-13 18:30:24,564 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-13 18:30:25,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:30:25,309 INFO L93 Difference]: Finished difference Result 71416 states and 266999 transitions. [2021-07-13 18:30:25,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-13 18:30:25,310 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-13 18:30:25,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:30:25,643 INFO L225 Difference]: With dead ends: 71416 [2021-07-13 18:30:25,643 INFO L226 Difference]: Without dead ends: 61540 [2021-07-13 18:30:25,643 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.0ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-07-13 18:30:25,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61540 states. [2021-07-13 18:30:26,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61540 to 30530. [2021-07-13 18:30:26,713 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-13 18:30:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30530 states to 30530 states and 115729 transitions. [2021-07-13 18:30:27,037 INFO L78 Accepts]: Start accepts. Automaton has 30530 states and 115729 transitions. Word has length 53 [2021-07-13 18:30:27,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:30:27,037 INFO L482 AbstractCegarLoop]: Abstraction has 30530 states and 115729 transitions. [2021-07-13 18:30:27,037 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-13 18:30:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 30530 states and 115729 transitions. [2021-07-13 18:30:27,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-07-13 18:30:27,055 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:30:27,055 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-13 18:30:27,055 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-13 18:30:27,055 INFO L430 AbstractCegarLoop]: === Iteration 5 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:30:27,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:30:27,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1983128374, now seen corresponding path program 1 times [2021-07-13 18:30:27,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:30:27,056 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318301293] [2021-07-13 18:30:27,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:30:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:30:27,090 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-13 18:30:27,090 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:30:27,090 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318301293] [2021-07-13 18:30:27,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318301293] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:30:27,091 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:30:27,091 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-13 18:30:27,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325994776] [2021-07-13 18:30:27,091 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-13 18:30:27,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:30:27,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-13 18:30:27,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-13 18:30:27,092 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-13 18:30:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:30:27,193 INFO L93 Difference]: Finished difference Result 17573 states and 62004 transitions. [2021-07-13 18:30:27,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-13 18:30:27,193 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-13 18:30:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:30:27,230 INFO L225 Difference]: With dead ends: 17573 [2021-07-13 18:30:27,230 INFO L226 Difference]: Without dead ends: 12369 [2021-07-13 18:30:27,230 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-07-13 18:30:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12369 states. [2021-07-13 18:30:27,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12369 to 11457. [2021-07-13 18:30:27,423 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-13 18:30:27,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11457 states to 11457 states and 39936 transitions. [2021-07-13 18:30:27,455 INFO L78 Accepts]: Start accepts. Automaton has 11457 states and 39936 transitions. Word has length 54 [2021-07-13 18:30:27,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:30:27,455 INFO L482 AbstractCegarLoop]: Abstraction has 11457 states and 39936 transitions. [2021-07-13 18:30:27,455 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-13 18:30:27,455 INFO L276 IsEmpty]: Start isEmpty. Operand 11457 states and 39936 transitions. [2021-07-13 18:30:27,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-07-13 18:30:27,468 INFO L500 BasicCegarLoop]: Found error trace [2021-07-13 18:30:27,468 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-13 18:30:27,468 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-13 18:30:27,468 INFO L430 AbstractCegarLoop]: === Iteration 6 === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-13 18:30:27,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-13 18:30:27,469 INFO L82 PathProgramCache]: Analyzing trace with hash -676092975, now seen corresponding path program 1 times [2021-07-13 18:30:27,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-13 18:30:27,469 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614405666] [2021-07-13 18:30:27,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-13 18:30:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-13 18:30:27,513 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-13 18:30:27,514 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-13 18:30:27,514 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614405666] [2021-07-13 18:30:27,514 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614405666] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-13 18:30:27,514 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-13 18:30:27,514 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-13 18:30:27,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706806690] [2021-07-13 18:30:27,514 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-13 18:30:27,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-13 18:30:27,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-13 18:30:27,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-13 18:30:27,515 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-13 18:30:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-13 18:30:27,757 INFO L93 Difference]: Finished difference Result 6111 states and 20031 transitions. [2021-07-13 18:30:27,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-13 18:30:27,758 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-13 18:30:27,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-13 18:30:27,758 INFO L225 Difference]: With dead ends: 6111 [2021-07-13 18:30:27,758 INFO L226 Difference]: Without dead ends: 0 [2021-07-13 18:30:27,758 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-13 18:30:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-13 18:30:27,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-13 18:30:27,759 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-13 18:30:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-13 18:30:27,759 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 60 [2021-07-13 18:30:27,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-13 18:30:27,759 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-13 18:30:27,759 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-13 18:30:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-13 18:30:27,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-13 18:30:27,759 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-13 18:30:27,759 INFO L301 ceAbstractionStarter]: Result for error location readerThread1of1ForFork3 was SAFE (2/3) [2021-07-13 18:30:27,760 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-07-13 18:30:27,761 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-13 18:30:27,761 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-13 18:30:27,761 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-13 18:30:27,761 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-13 18:30:27,761 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-13 18:30:27,761 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-13 18:30:27,761 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-13 18:30:27,761 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-13 18:30:27,765 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 119 places, 120 transitions, 308 flow [2021-07-13 18:30:27,829 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-13 18:30:27,837 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-13 18:30:27,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-13 18:30:27,853 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE (3/3) [2021-07-13 18:30:27,853 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-13 18:30:27,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 06:30:27 BasicIcfg [2021-07-13 18:30:27,856 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-13 18:30:27,857 INFO L168 Benchmark]: Toolchain (without parser) took 24644.57 ms. Allocated memory was 203.4 MB in the beginning and 7.4 GB in the end (delta: 7.2 GB). Free memory was 166.4 MB in the beginning and 5.1 GB in the end (delta: -4.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 8.0 GB. [2021-07-13 18:30:27,857 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 203.4 MB. Free memory is still 184.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-13 18:30:27,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 444.28 ms. Allocated memory is still 203.4 MB. Free memory was 166.1 MB in the beginning and 176.9 MB in the end (delta: -10.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-07-13 18:30:27,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.62 ms. Allocated memory is still 203.4 MB. Free memory was 176.9 MB in the beginning and 174.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-13 18:30:27,857 INFO L168 Benchmark]: Boogie Preprocessor took 28.93 ms. Allocated memory is still 203.4 MB. Free memory was 174.8 MB in the beginning and 173.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-13 18:30:27,858 INFO L168 Benchmark]: RCFGBuilder took 637.71 ms. Allocated memory is still 203.4 MB. Free memory was 173.4 MB in the beginning and 140.9 MB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 8.0 GB. [2021-07-13 18:30:27,858 INFO L168 Benchmark]: TraceAbstraction took 23476.35 ms. Allocated memory was 203.4 MB in the beginning and 7.4 GB in the end (delta: 7.2 GB). Free memory was 140.5 MB in the beginning and 5.1 GB in the end (delta: -4.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 8.0 GB. [2021-07-13 18:30:27,861 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 203.4 MB. Free memory is still 184.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 444.28 ms. Allocated memory is still 203.4 MB. Free memory was 166.1 MB in the beginning and 176.9 MB in the end (delta: -10.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 51.62 ms. Allocated memory is still 203.4 MB. Free memory was 176.9 MB in the beginning and 174.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 28.93 ms. Allocated memory is still 203.4 MB. Free memory was 174.8 MB in the beginning and 173.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 637.71 ms. Allocated memory is still 203.4 MB. Free memory was 173.4 MB in the beginning and 140.9 MB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 23476.35 ms. Allocated memory was 203.4 MB in the beginning and 7.4 GB in the end (delta: 7.2 GB). Free memory was 140.5 MB in the beginning and 5.1 GB in the end (delta: -4.9 GB). Peak memory consumption was 2.3 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: 11795.7ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 153.6ms, AutomataDifference: 4487.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1419.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1084 SDtfs, 851 SDslu, 1992 SDs, 0 SdLazy, 249 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 399.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 120.6ms 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: 5065.8ms AutomataMinimizationTime, 6 MinimizatonAttempts, 19242 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 28.6ms SsaConstructionTime, 113.1ms SatisfiabilityAnalysisTime, 344.5ms 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: 11460.5ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 214.7ms, AutomataDifference: 3625.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 962.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1081 SDtfs, 902 SDslu, 2109 SDs, 0 SdLazy, 280 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 145.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 98.1ms 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: 6393.8ms AutomataMinimizationTime, 6 MinimizatonAttempts, 54443 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 8.8ms SsaConstructionTime, 30.0ms SatisfiabilityAnalysisTime, 178.9ms 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: 91.8ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 23.1ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 68.0ms, 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...