./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:09:58,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:09:58,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:09:58,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:09:58,924 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:09:58,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:09:58,930 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:09:58,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:09:58,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:09:58,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:09:58,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:09:58,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:09:58,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:09:58,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:09:58,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:09:58,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:09:58,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:09:58,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:09:58,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:09:58,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:09:58,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:09:58,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:09:58,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:09:58,957 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:09:58,962 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:09:58,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:09:58,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:09:58,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:09:58,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:09:58,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:09:58,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:09:58,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:09:58,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:09:58,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:09:58,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:09:58,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:09:58,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:09:58,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:09:58,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:09:58,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:09:58,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:09:58,972 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 20:09:59,005 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:09:59,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:09:59,006 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:09:59,006 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:09:59,007 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:09:59,007 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:09:59,008 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:09:59,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:09:59,008 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:09:59,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:09:59,009 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:09:59,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:09:59,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:09:59,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:09:59,010 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:09:59,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:09:59,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:09:59,010 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:09:59,011 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:09:59,011 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:09:59,011 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:09:59,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:09:59,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:09:59,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:09:59,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:09:59,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:09:59,012 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:09:59,014 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:09:59,014 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:09:59,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:09:59,014 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:09:59,014 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:09:59,015 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:09:59,015 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2022-02-20 20:09:59,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:09:59,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:09:59,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:09:59,251 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:09:59,251 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:09:59,252 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2022-02-20 20:09:59,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5029196/4a09dd3c69a44b60bd16ab88dd91d4ab/FLAG974597bfd [2022-02-20 20:09:59,689 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:09:59,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2022-02-20 20:09:59,713 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5029196/4a09dd3c69a44b60bd16ab88dd91d4ab/FLAG974597bfd [2022-02-20 20:09:59,727 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5029196/4a09dd3c69a44b60bd16ab88dd91d4ab [2022-02-20 20:09:59,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:09:59,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:09:59,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:09:59,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:09:59,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:09:59,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:09:59" (1/1) ... [2022-02-20 20:09:59,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b2557c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:59, skipping insertion in model container [2022-02-20 20:09:59,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:09:59" (1/1) ... [2022-02-20 20:09:59,740 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:09:59,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:09:59,957 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-20 20:10:00,073 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2022-02-20 20:10:00,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:10:00,091 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:10:00,116 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-20 20:10:00,129 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i[31244,31257] [2022-02-20 20:10:00,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:10:00,170 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:10:00,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:00 WrapperNode [2022-02-20 20:10:00,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:10:00,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:10:00,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:10:00,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:10:00,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:00" (1/1) ... [2022-02-20 20:10:00,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:00" (1/1) ... [2022-02-20 20:10:00,225 INFO L137 Inliner]: procedures = 174, calls = 51, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-02-20 20:10:00,226 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:10:00,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:10:00,227 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:10:00,227 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:10:00,232 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:00" (1/1) ... [2022-02-20 20:10:00,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:00" (1/1) ... [2022-02-20 20:10:00,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:00" (1/1) ... [2022-02-20 20:10:00,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:00" (1/1) ... [2022-02-20 20:10:00,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:00" (1/1) ... [2022-02-20 20:10:00,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:00" (1/1) ... [2022-02-20 20:10:00,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:00" (1/1) ... [2022-02-20 20:10:00,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:10:00,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:10:00,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:10:00,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:10:00,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:00" (1/1) ... [2022-02-20 20:10:00,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:10:00,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:10:00,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 20:10:00,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 20:10:00,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:10:00,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:10:00,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-20 20:10:00,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:10:00,342 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2022-02-20 20:10:00,342 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2022-02-20 20:10:00,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:10:00,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:10:00,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:10:00,342 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-20 20:10:00,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:10:00,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:10:00,342 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2022-02-20 20:10:00,342 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2022-02-20 20:10:00,343 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-20 20:10:00,453 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:10:00,454 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:10:00,612 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:10:00,636 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:10:00,636 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:10:00,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:10:00 BoogieIcfgContainer [2022-02-20 20:10:00,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:10:00,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:10:00,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:10:00,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:10:00,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:09:59" (1/3) ... [2022-02-20 20:10:00,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f4bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:10:00, skipping insertion in model container [2022-02-20 20:10:00,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:10:00" (2/3) ... [2022-02-20 20:10:00,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69f4bee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:10:00, skipping insertion in model container [2022-02-20 20:10:00,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:10:00" (3/3) ... [2022-02-20 20:10:00,651 INFO L111 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2022-02-20 20:10:00,655 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:10:00,655 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:10:00,655 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:10:00,655 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:10:00,725 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,728 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,729 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,729 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,729 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,729 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,729 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,730 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,730 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,730 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,730 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,730 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,731 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,731 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,731 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,731 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,732 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,732 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,733 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,733 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,733 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,734 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,734 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,734 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,734 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,735 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,735 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,735 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,735 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,736 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,736 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,736 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,736 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,737 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,737 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,737 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,738 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,738 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,739 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,739 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,739 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,740 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,740 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,740 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,741 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,741 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,741 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,742 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,743 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,743 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,743 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,743 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,744 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,744 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,745 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,745 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,745 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,745 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,747 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,748 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,748 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,749 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,749 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,749 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,749 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,749 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,749 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,750 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,750 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,750 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,751 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,751 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,751 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,751 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,752 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,752 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,752 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,752 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,753 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,753 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,754 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,755 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,756 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,756 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,757 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,757 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,757 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,757 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,758 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,758 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,758 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,758 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,759 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,759 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,759 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,760 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,760 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,763 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,763 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,763 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,763 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,764 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,764 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,764 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,765 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,765 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,765 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,766 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,768 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,769 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,769 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,770 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,770 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,770 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,770 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,770 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,771 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,772 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,772 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,772 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,772 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,773 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,773 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,773 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,774 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,774 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,774 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,774 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,774 WARN L322 ript$VariableManager]: TermVariabe |writerThread1of1ForFork2_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,776 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,776 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~l~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,776 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,776 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~ly~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,776 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,777 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,777 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_~lx~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,777 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,777 WARN L322 ript$VariableManager]: TermVariabe |readerThread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:10:00,798 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-02-20 20:10:00,835 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:10:00,840 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 20:10:00,841 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-02-20 20:10:00,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 125 places, 114 transitions, 260 flow [2022-02-20 20:10:00,903 INFO L129 PetriNetUnfolder]: 2/110 cut-off events. [2022-02-20 20:10:00,904 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-02-20 20:10:00,908 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 110 events. 2/110 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-02-20 20:10:00,908 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 114 transitions, 260 flow [2022-02-20 20:10:00,911 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 96 transitions, 213 flow [2022-02-20 20:10:00,928 INFO L129 PetriNetUnfolder]: 1/59 cut-off events. [2022-02-20 20:10:00,929 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:10:00,929 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:10:00,929 INFO L254 CegarLoopForPetriNet]: 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] [2022-02-20 20:10:00,930 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-02-20 20:10:00,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:10:00,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2006515335, now seen corresponding path program 1 times [2022-02-20 20:10:00,941 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:10:00,941 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698904176] [2022-02-20 20:10:00,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:10:00,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:10:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:10:01,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {128#true} [210] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-02-20 20:10:01,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {128#true} [191] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {128#true} is VALID [2022-02-20 20:10:01,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {128#true} [221] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {128#true} is VALID [2022-02-20 20:10:01,195 INFO L290 TraceCheckUtils]: 3: Hoare triple {128#true} [223] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {128#true} is VALID [2022-02-20 20:10:01,195 INFO L290 TraceCheckUtils]: 4: Hoare triple {128#true} [183] L16-->L16-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {128#true} is VALID [2022-02-20 20:10:01,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {128#true} [147] L16-1-->L16-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {128#true} is VALID [2022-02-20 20:10:01,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {128#true} [229] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {128#true} is VALID [2022-02-20 20:10:01,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {128#true} [201] L16-3-->L16-4: Formula: (and (= 20 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {128#true} is VALID [2022-02-20 20:10:01,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {128#true} [202] L16-4-->L704: Formula: (= v_~w~0_2 0) InVars {} OutVars{~w~0=v_~w~0_2} AuxVars[] AssignedVars[~w~0] {128#true} is VALID [2022-02-20 20:10:01,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {128#true} [213] L704-->L704-1: Formula: (= v_~r~0_5 0) InVars {} OutVars{~r~0=v_~r~0_5} AuxVars[] AssignedVars[~r~0] {128#true} is VALID [2022-02-20 20:10:01,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {128#true} [232] L704-1-->L704-2: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] {128#true} is VALID [2022-02-20 20:10:01,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {128#true} [196] L704-2-->L-1-3: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {128#true} is VALID [2022-02-20 20:10:01,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {128#true} [225] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-02-20 20:10:01,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {128#true} [199] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {128#true} is VALID [2022-02-20 20:10:01,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {128#true} [167] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {128#true} is VALID [2022-02-20 20:10:01,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {128#true} [195] L-1-6-->L748: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_~#t2~0#1.base] {128#true} is VALID [2022-02-20 20:10:01,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {128#true} [186] L748-->L748-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {128#true} is VALID [2022-02-20 20:10:01,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {128#true} [170] L748-1-->L748-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {128#true} is VALID [2022-02-20 20:10:01,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {128#true} [149] L748-2-->L748-3: Formula: (and (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (store |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1) |v_#valid_8|) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4) |v_#length_7|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] {128#true} is VALID [2022-02-20 20:10:01,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {128#true} [146] L748-3-->L748-4: Formula: (and (= (store |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 1) |v_#valid_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_2| 0)) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2|) 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_10|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_2|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_2|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] {128#true} is VALID [2022-02-20 20:10:01,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {128#true} [154] L748-4-->L749: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {128#true} is VALID [2022-02-20 20:10:01,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {128#true} [151] L749-->L749-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {128#true} is VALID [2022-02-20 20:10:01,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {128#true} [208] L749-1-->L749-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {128#true} is VALID [2022-02-20 20:10:01,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {128#true} [282] L749-2-->writerENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_writerThread1of1ForFork2_thidvar0_2) (= v_writerThread1of1ForFork2_thidvar1_2 0) (= |v_writerThread1of1ForFork2_#in~arg#1.offset_4| 0) (= |v_writerThread1of1ForFork2_#in~arg#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{writerThread1of1ForFork2_~arg#1.base=|v_writerThread1of1ForFork2_~arg#1.base_4|, writerThread1of1ForFork2_#in~arg#1.offset=|v_writerThread1of1ForFork2_#in~arg#1.offset_4|, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_4|, writerThread1of1ForFork2_#in~arg#1.base=|v_writerThread1of1ForFork2_#in~arg#1.base_4|, writerThread1of1ForFork2_#res#1.base=|v_writerThread1of1ForFork2_#res#1.base_4|, writerThread1of1ForFork2_#res#1.offset=|v_writerThread1of1ForFork2_#res#1.offset_4|, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2, writerThread1of1ForFork2_thidvar1=v_writerThread1of1ForFork2_thidvar1_2, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, writerThread1of1ForFork2_~arg#1.offset=|v_writerThread1of1ForFork2_~arg#1.offset_4|} AuxVars[] AssignedVars[writerThread1of1ForFork2_~arg#1.base, writerThread1of1ForFork2_#in~arg#1.offset, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_#in~arg#1.base, writerThread1of1ForFork2_#res#1.base, writerThread1of1ForFork2_#res#1.offset, writerThread1of1ForFork2_thidvar0, writerThread1of1ForFork2_thidvar1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork2_~arg#1.offset] {128#true} is VALID [2022-02-20 20:10:01,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {128#true} [187] L749-3-->L749-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {128#true} is VALID [2022-02-20 20:10:01,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {128#true} [204] L749-4-->L750: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {128#true} is VALID [2022-02-20 20:10:01,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {128#true} [184] L750-->L750-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {128#true} is VALID [2022-02-20 20:10:01,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {128#true} [222] L750-1-->L750-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {128#true} is VALID [2022-02-20 20:10:01,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {128#true} [209] L750-2-->L750-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {128#true} is VALID [2022-02-20 20:10:01,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {128#true} [278] L750-3-->readerENTRY: Formula: (and (= v_readerThread1of1ForFork0_thidvar1_2 0) (= |v_readerThread1of1ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_readerThread1of1ForFork0_thidvar0_2) (= |v_readerThread1of1ForFork0_#in~arg#1.base_4| 0) (= v_readerThread1of1ForFork0_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{readerThread1of1ForFork0_thidvar2=v_readerThread1of1ForFork0_thidvar2_2, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_12|, readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_4|, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_#res#1.offset=|v_readerThread1of1ForFork0_#res#1.offset_4|, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_4|, readerThread1of1ForFork0_~arg#1.base=|v_readerThread1of1ForFork0_~arg#1.base_4|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_8|, readerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_4|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_8|, readerThread1of1ForFork0_~arg#1.offset=|v_readerThread1of1ForFork0_~arg#1.offset_4|, readerThread1of1ForFork0_#res#1.base=|v_readerThread1of1ForFork0_#res#1.base_4|, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[readerThread1of1ForFork0_thidvar2, readerThread1of1ForFork0_~l~0#1, readerThread1of1ForFork0_#in~arg#1.base, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_#res#1.offset, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_#in~arg#1.offset, readerThread1of1ForFork0_~arg#1.base, readerThread1of1ForFork0_~ly~0#1, readerThread1of1ForFork0_assume_abort_if_not_~cond#1, readerThread1of1ForFork0_~lx~0#1, readerThread1of1ForFork0_~arg#1.offset, readerThread1of1ForFork0_#res#1.base, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1] {128#true} is VALID [2022-02-20 20:10:01,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {128#true} [235] readerENTRY-->L724: Formula: (and (= |v_readerThread1of1ForFork0_#in~arg#1.offset_1| |v_readerThread1of1ForFork0_~arg#1.offset_1|) (= |v_readerThread1of1ForFork0_#in~arg#1.base_1| |v_readerThread1of1ForFork0_~arg#1.base_1|)) InVars {readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_1|, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{readerThread1of1ForFork0_~arg#1.base=|v_readerThread1of1ForFork0_~arg#1.base_1|, readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_1|, readerThread1of1ForFork0_~arg#1.offset=|v_readerThread1of1ForFork0_~arg#1.offset_1|, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~arg#1.offset, readerThread1of1ForFork0_~arg#1.base] {128#true} is VALID [2022-02-20 20:10:01,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {128#true} [236] L724-->L725: Formula: true InVars {} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1] {128#true} is VALID [2022-02-20 20:10:01,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {128#true} [237] L725-->L725-1: Formula: (and (= |v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (= (ite (= v_~w~0_24 0) 1 0) |v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= v_~r~0_27 (+ v_~r~0_28 1)) (not (= 0 |v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|))) InVars {~w~0=v_~w~0_24, ~r~0=v_~r~0_28} OutVars{~w~0=v_~w~0_24, readerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_27} AuxVars[] AssignedVars[readerThread1of1ForFork0_assume_abort_if_not_~cond#1, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~r~0] {128#true} is VALID [2022-02-20 20:10:01,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {128#true} [238] L725-1-->L728: Formula: (= |v_readerThread1of1ForFork0_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_3|, ~x~0=v_~x~0_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1] {130#(= |readerThread1of1ForFork0_~l~0#1| ~x~0)} is VALID [2022-02-20 20:10:01,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {130#(= |readerThread1of1ForFork0_~l~0#1| ~x~0)} [239] L728-->L731: Formula: (= |v_readerThread1of1ForFork0_~l~0#1_5| v_~y~0_1) InVars {readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_5|} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_5|, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] {131#(= ~y~0 ~x~0)} is VALID [2022-02-20 20:10:01,206 INFO L290 TraceCheckUtils]: 35: Hoare triple {131#(= ~y~0 ~x~0)} [240] L731-->L734: Formula: (= |v_readerThread1of1ForFork0_~ly~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~ly~0#1] {132#(= ~x~0 |readerThread1of1ForFork0_~ly~0#1|)} is VALID [2022-02-20 20:10:01,206 INFO L290 TraceCheckUtils]: 36: Hoare triple {132#(= ~x~0 |readerThread1of1ForFork0_~ly~0#1|)} [241] L734-->L737: Formula: (= |v_readerThread1of1ForFork0_~lx~0#1_1| v_~x~0_2) InVars {~x~0=v_~x~0_2} OutVars{readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_1|, ~x~0=v_~x~0_2} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1] {133#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)} is VALID [2022-02-20 20:10:01,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {133#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)} [242] L737-->L738: Formula: (not (= |v_readerThread1of1ForFork0_~lx~0#1_3| |v_readerThread1of1ForFork0_~ly~0#1_3|)) InVars {readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_3|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_3|} OutVars{readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_3|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_3|} AuxVars[] AssignedVars[] {129#false} is VALID [2022-02-20 20:10:01,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {129#false} [244] L738-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {129#false} is VALID [2022-02-20 20:10:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:10:01,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:10:01,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698904176] [2022-02-20 20:10:01,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698904176] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:10:01,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:10:01,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:10:01,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964450046] [2022-02-20 20:10:01,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:10:01,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 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 [2022-02-20 20:10:01,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:10:01,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 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) [2022-02-20 20:10:01,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:10:01,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:10:01,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:10:01,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:10:01,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:10:01,286 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 114 [2022-02-20 20:10:01,289 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 96 transitions, 213 flow. Second operand has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 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) [2022-02-20 20:10:01,289 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:10:01,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 114 [2022-02-20 20:10:01,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:10:02,756 INFO L129 PetriNetUnfolder]: 3525/7769 cut-off events. [2022-02-20 20:10:02,756 INFO L130 PetriNetUnfolder]: For 1654/1654 co-relation queries the response was YES. [2022-02-20 20:10:02,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13923 conditions, 7769 events. 3525/7769 cut-off events. For 1654/1654 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 71695 event pairs, 961 based on Foata normal form. 422/7837 useless extension candidates. Maximal degree in co-relation 13398. Up to 1729 conditions per place. [2022-02-20 20:10:02,813 INFO L132 encePairwiseOnDemand]: 102/114 looper letters, 116 selfloop transitions, 32 changer transitions 0/214 dead transitions. [2022-02-20 20:10:02,813 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 214 transitions, 823 flow [2022-02-20 20:10:02,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:10:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-02-20 20:10:02,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1160 transitions. [2022-02-20 20:10:02,835 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2022-02-20 20:10:02,835 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1160 transitions. [2022-02-20 20:10:02,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1160 transitions. [2022-02-20 20:10:02,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:10:02,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1160 transitions. [2022-02-20 20:10:02,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 96.66666666666667) internal successors, (1160), 12 states have internal predecessors, (1160), 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) [2022-02-20 20:10:02,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 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) [2022-02-20 20:10:02,848 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 114.0) internal successors, (1482), 13 states have internal predecessors, (1482), 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) [2022-02-20 20:10:02,850 INFO L186 Difference]: Start difference. First operand has 107 places, 96 transitions, 213 flow. Second operand 12 states and 1160 transitions. [2022-02-20 20:10:02,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 214 transitions, 823 flow [2022-02-20 20:10:04,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 214 transitions, 764 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-02-20 20:10:04,224 INFO L242 Difference]: Finished difference. Result has 119 places, 129 transitions, 416 flow [2022-02-20 20:10:04,225 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=416, PETRI_PLACES=119, PETRI_TRANSITIONS=129} [2022-02-20 20:10:04,227 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 12 predicate places. [2022-02-20 20:10:04,228 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 119 places, 129 transitions, 416 flow [2022-02-20 20:10:08,074 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 113107 states, 113097 states have (on average 4.1690937867494275) internal successors, (471512), 113106 states have internal predecessors, (471512), 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) [2022-02-20 20:10:08,469 INFO L78 Accepts]: Start accepts. Automaton has has 113107 states, 113097 states have (on average 4.1690937867494275) internal successors, (471512), 113106 states have internal predecessors, (471512), 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 [2022-02-20 20:10:08,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:10:08,470 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 129 transitions, 416 flow [2022-02-20 20:10:08,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.83333333333333) internal successors, (509), 6 states have internal predecessors, (509), 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) [2022-02-20 20:10:08,470 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:10:08,471 INFO L254 CegarLoopForPetriNet]: 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] [2022-02-20 20:10:08,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:10:08,471 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-02-20 20:10:08,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:10:08,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1738116757, now seen corresponding path program 1 times [2022-02-20 20:10:08,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:10:08,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906983419] [2022-02-20 20:10:08,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:10:08,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:10:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:10:08,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {113267#true} [210] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113267#true} is VALID [2022-02-20 20:10:08,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {113267#true} [191] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {113267#true} is VALID [2022-02-20 20:10:08,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {113267#true} [221] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {113267#true} is VALID [2022-02-20 20:10:08,555 INFO L290 TraceCheckUtils]: 3: Hoare triple {113267#true} [223] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {113267#true} is VALID [2022-02-20 20:10:08,556 INFO L290 TraceCheckUtils]: 4: Hoare triple {113267#true} [183] L16-->L16-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {113267#true} is VALID [2022-02-20 20:10:08,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {113267#true} [147] L16-1-->L16-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {113267#true} is VALID [2022-02-20 20:10:08,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {113267#true} [229] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {113267#true} is VALID [2022-02-20 20:10:08,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {113267#true} [201] L16-3-->L16-4: Formula: (and (= 20 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {113267#true} is VALID [2022-02-20 20:10:08,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {113267#true} [202] L16-4-->L704: Formula: (= v_~w~0_2 0) InVars {} OutVars{~w~0=v_~w~0_2} AuxVars[] AssignedVars[~w~0] {113267#true} is VALID [2022-02-20 20:10:08,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {113267#true} [213] L704-->L704-1: Formula: (= v_~r~0_5 0) InVars {} OutVars{~r~0=v_~r~0_5} AuxVars[] AssignedVars[~r~0] {113267#true} is VALID [2022-02-20 20:10:08,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {113267#true} [232] L704-1-->L704-2: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] {113267#true} is VALID [2022-02-20 20:10:08,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {113267#true} [196] L704-2-->L-1-3: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {113267#true} is VALID [2022-02-20 20:10:08,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {113267#true} [225] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113267#true} is VALID [2022-02-20 20:10:08,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {113267#true} [199] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113267#true} is VALID [2022-02-20 20:10:08,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {113267#true} [167] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {113267#true} is VALID [2022-02-20 20:10:08,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {113267#true} [195] L-1-6-->L748: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_~#t2~0#1.base] {113267#true} is VALID [2022-02-20 20:10:08,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {113267#true} [186] L748-->L748-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {113267#true} is VALID [2022-02-20 20:10:08,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {113267#true} [170] L748-1-->L748-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {113267#true} is VALID [2022-02-20 20:10:08,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {113267#true} [149] L748-2-->L748-3: Formula: (and (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (store |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1) |v_#valid_8|) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4) |v_#length_7|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] {113267#true} is VALID [2022-02-20 20:10:08,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {113267#true} [146] L748-3-->L748-4: Formula: (and (= (store |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 1) |v_#valid_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_2| 0)) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2|) 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_10|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_2|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_2|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] {113267#true} is VALID [2022-02-20 20:10:08,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {113267#true} [154] L748-4-->L749: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {113267#true} is VALID [2022-02-20 20:10:08,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {113267#true} [151] L749-->L749-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {113267#true} is VALID [2022-02-20 20:10:08,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {113267#true} [208] L749-1-->L749-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {113267#true} is VALID [2022-02-20 20:10:08,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {113267#true} [282] L749-2-->writerENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_writerThread1of1ForFork2_thidvar0_2) (= v_writerThread1of1ForFork2_thidvar1_2 0) (= |v_writerThread1of1ForFork2_#in~arg#1.offset_4| 0) (= |v_writerThread1of1ForFork2_#in~arg#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{writerThread1of1ForFork2_~arg#1.base=|v_writerThread1of1ForFork2_~arg#1.base_4|, writerThread1of1ForFork2_#in~arg#1.offset=|v_writerThread1of1ForFork2_#in~arg#1.offset_4|, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_4|, writerThread1of1ForFork2_#in~arg#1.base=|v_writerThread1of1ForFork2_#in~arg#1.base_4|, writerThread1of1ForFork2_#res#1.base=|v_writerThread1of1ForFork2_#res#1.base_4|, writerThread1of1ForFork2_#res#1.offset=|v_writerThread1of1ForFork2_#res#1.offset_4|, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2, writerThread1of1ForFork2_thidvar1=v_writerThread1of1ForFork2_thidvar1_2, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, writerThread1of1ForFork2_~arg#1.offset=|v_writerThread1of1ForFork2_~arg#1.offset_4|} AuxVars[] AssignedVars[writerThread1of1ForFork2_~arg#1.base, writerThread1of1ForFork2_#in~arg#1.offset, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_#in~arg#1.base, writerThread1of1ForFork2_#res#1.base, writerThread1of1ForFork2_#res#1.offset, writerThread1of1ForFork2_thidvar0, writerThread1of1ForFork2_thidvar1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork2_~arg#1.offset] {113267#true} is VALID [2022-02-20 20:10:08,565 INFO L290 TraceCheckUtils]: 24: Hoare triple {113267#true} [187] L749-3-->L749-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {113267#true} is VALID [2022-02-20 20:10:08,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {113267#true} [204] L749-4-->L750: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {113267#true} is VALID [2022-02-20 20:10:08,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {113267#true} [184] L750-->L750-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {113267#true} is VALID [2022-02-20 20:10:08,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {113267#true} [222] L750-1-->L750-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {113267#true} is VALID [2022-02-20 20:10:08,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {113267#true} [209] L750-2-->L750-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {113267#true} is VALID [2022-02-20 20:10:08,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {113267#true} [278] L750-3-->readerENTRY: Formula: (and (= v_readerThread1of1ForFork0_thidvar1_2 0) (= |v_readerThread1of1ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_readerThread1of1ForFork0_thidvar0_2) (= |v_readerThread1of1ForFork0_#in~arg#1.base_4| 0) (= v_readerThread1of1ForFork0_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{readerThread1of1ForFork0_thidvar2=v_readerThread1of1ForFork0_thidvar2_2, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_12|, readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_4|, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_#res#1.offset=|v_readerThread1of1ForFork0_#res#1.offset_4|, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_4|, readerThread1of1ForFork0_~arg#1.base=|v_readerThread1of1ForFork0_~arg#1.base_4|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_8|, readerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_4|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_8|, readerThread1of1ForFork0_~arg#1.offset=|v_readerThread1of1ForFork0_~arg#1.offset_4|, readerThread1of1ForFork0_#res#1.base=|v_readerThread1of1ForFork0_#res#1.base_4|, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[readerThread1of1ForFork0_thidvar2, readerThread1of1ForFork0_~l~0#1, readerThread1of1ForFork0_#in~arg#1.base, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_#res#1.offset, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_#in~arg#1.offset, readerThread1of1ForFork0_~arg#1.base, readerThread1of1ForFork0_~ly~0#1, readerThread1of1ForFork0_assume_abort_if_not_~cond#1, readerThread1of1ForFork0_~lx~0#1, readerThread1of1ForFork0_~arg#1.offset, readerThread1of1ForFork0_#res#1.base, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1] {113267#true} is VALID [2022-02-20 20:10:08,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {113267#true} [235] readerENTRY-->L724: Formula: (and (= |v_readerThread1of1ForFork0_#in~arg#1.offset_1| |v_readerThread1of1ForFork0_~arg#1.offset_1|) (= |v_readerThread1of1ForFork0_#in~arg#1.base_1| |v_readerThread1of1ForFork0_~arg#1.base_1|)) InVars {readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_1|, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{readerThread1of1ForFork0_~arg#1.base=|v_readerThread1of1ForFork0_~arg#1.base_1|, readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_1|, readerThread1of1ForFork0_~arg#1.offset=|v_readerThread1of1ForFork0_~arg#1.offset_1|, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~arg#1.offset, readerThread1of1ForFork0_~arg#1.base] {113267#true} is VALID [2022-02-20 20:10:08,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {113267#true} [236] L724-->L725: Formula: true InVars {} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1] {113267#true} is VALID [2022-02-20 20:10:08,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {113267#true} [265] writerENTRY-->L714: Formula: (and (= |v_writerThread1of1ForFork2_~arg#1.base_1| |v_writerThread1of1ForFork2_#in~arg#1.base_1|) (= |v_writerThread1of1ForFork2_~arg#1.offset_1| |v_writerThread1of1ForFork2_#in~arg#1.offset_1|)) InVars {writerThread1of1ForFork2_#in~arg#1.base=|v_writerThread1of1ForFork2_#in~arg#1.base_1|, writerThread1of1ForFork2_#in~arg#1.offset=|v_writerThread1of1ForFork2_#in~arg#1.offset_1|} OutVars{writerThread1of1ForFork2_~arg#1.base=|v_writerThread1of1ForFork2_~arg#1.base_1|, writerThread1of1ForFork2_#in~arg#1.offset=|v_writerThread1of1ForFork2_#in~arg#1.offset_1|, writerThread1of1ForFork2_#in~arg#1.base=|v_writerThread1of1ForFork2_#in~arg#1.base_1|, writerThread1of1ForFork2_~arg#1.offset=|v_writerThread1of1ForFork2_~arg#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork2_~arg#1.base, writerThread1of1ForFork2_~arg#1.offset] {113267#true} is VALID [2022-02-20 20:10:08,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {113267#true} [266] L714-->L714-1: Formula: (and (= v_~w~0_28 1) (= |v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (and (= v_~w~0_29 0) (= v_~r~0_31 0)) 1 0)) (not (= |v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0))) InVars {~w~0=v_~w~0_29, ~r~0=v_~r~0_31} OutVars{~w~0=v_~w~0_28, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_31} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1] {113269#(= ~w~0 1)} is VALID [2022-02-20 20:10:08,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {113269#(= ~w~0 1)} [237] L725-->L725-1: Formula: (and (= |v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (= (ite (= v_~w~0_24 0) 1 0) |v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= v_~r~0_27 (+ v_~r~0_28 1)) (not (= 0 |v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|))) InVars {~w~0=v_~w~0_24, ~r~0=v_~r~0_28} OutVars{~w~0=v_~w~0_24, readerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_27} AuxVars[] AssignedVars[readerThread1of1ForFork0_assume_abort_if_not_~cond#1, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~r~0] {113268#false} is VALID [2022-02-20 20:10:08,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {113268#false} [238] L725-1-->L728: Formula: (= |v_readerThread1of1ForFork0_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_3|, ~x~0=v_~x~0_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1] {113268#false} is VALID [2022-02-20 20:10:08,569 INFO L290 TraceCheckUtils]: 36: Hoare triple {113268#false} [239] L728-->L731: Formula: (= |v_readerThread1of1ForFork0_~l~0#1_5| v_~y~0_1) InVars {readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_5|} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_5|, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] {113268#false} is VALID [2022-02-20 20:10:08,570 INFO L290 TraceCheckUtils]: 37: Hoare triple {113268#false} [240] L731-->L734: Formula: (= |v_readerThread1of1ForFork0_~ly~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~ly~0#1] {113268#false} is VALID [2022-02-20 20:10:08,570 INFO L290 TraceCheckUtils]: 38: Hoare triple {113268#false} [267] L714-1-->L717: Formula: (= 3 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] {113268#false} is VALID [2022-02-20 20:10:08,570 INFO L290 TraceCheckUtils]: 39: Hoare triple {113268#false} [241] L734-->L737: Formula: (= |v_readerThread1of1ForFork0_~lx~0#1_1| v_~x~0_2) InVars {~x~0=v_~x~0_2} OutVars{readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_1|, ~x~0=v_~x~0_2} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1] {113268#false} is VALID [2022-02-20 20:10:08,570 INFO L290 TraceCheckUtils]: 40: Hoare triple {113268#false} [242] L737-->L738: Formula: (not (= |v_readerThread1of1ForFork0_~lx~0#1_3| |v_readerThread1of1ForFork0_~ly~0#1_3|)) InVars {readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_3|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_3|} OutVars{readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_3|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_3|} AuxVars[] AssignedVars[] {113268#false} is VALID [2022-02-20 20:10:08,571 INFO L290 TraceCheckUtils]: 41: Hoare triple {113268#false} [244] L738-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {113268#false} is VALID [2022-02-20 20:10:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:10:08,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:10:08,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906983419] [2022-02-20 20:10:08,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906983419] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:10:08,572 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:10:08,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:10:08,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324408310] [2022-02-20 20:10:08,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:10:08,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 42 [2022-02-20 20:10:08,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:10:08,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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) [2022-02-20 20:10:08,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:10:08,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:10:08,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:10:08,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:10:08,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:10:08,598 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 114 [2022-02-20 20:10:08,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 129 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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) [2022-02-20 20:10:08,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:10:08,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 114 [2022-02-20 20:10:08,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:10:08,837 INFO L129 PetriNetUnfolder]: 396/2020 cut-off events. [2022-02-20 20:10:08,838 INFO L130 PetriNetUnfolder]: For 388/396 co-relation queries the response was YES. [2022-02-20 20:10:08,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3618 conditions, 2020 events. 396/2020 cut-off events. For 388/396 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 19165 event pairs, 141 based on Foata normal form. 52/1985 useless extension candidates. Maximal degree in co-relation 3349. Up to 256 conditions per place. [2022-02-20 20:10:08,856 INFO L132 encePairwiseOnDemand]: 108/114 looper letters, 15 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2022-02-20 20:10:08,856 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 134 transitions, 470 flow [2022-02-20 20:10:08,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:10:08,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:10:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2022-02-20 20:10:08,860 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9181286549707602 [2022-02-20 20:10:08,860 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2022-02-20 20:10:08,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2022-02-20 20:10:08,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:10:08,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2022-02-20 20:10:08,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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) [2022-02-20 20:10:08,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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) [2022-02-20 20:10:08,950 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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) [2022-02-20 20:10:08,950 INFO L186 Difference]: Start difference. First operand has 119 places, 129 transitions, 416 flow. Second operand 3 states and 314 transitions. [2022-02-20 20:10:08,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 134 transitions, 470 flow [2022-02-20 20:10:16,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 134 transitions, 470 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 20:10:16,456 INFO L242 Difference]: Finished difference. Result has 122 places, 129 transitions, 432 flow [2022-02-20 20:10:16,456 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=122, PETRI_TRANSITIONS=129} [2022-02-20 20:10:16,457 INFO L334 CegarLoopForPetriNet]: 107 programPoint places, 15 predicate places. [2022-02-20 20:10:16,457 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 122 places, 129 transitions, 432 flow [2022-02-20 20:10:19,554 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 105059 states, 105049 states have (on average 4.037258803034774) internal successors, (424110), 105058 states have internal predecessors, (424110), 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) [2022-02-20 20:10:19,833 INFO L78 Accepts]: Start accepts. Automaton has has 105059 states, 105049 states have (on average 4.037258803034774) internal successors, (424110), 105058 states have internal predecessors, (424110), 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 42 [2022-02-20 20:10:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:10:19,835 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 129 transitions, 432 flow [2022-02-20 20:10:19,835 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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) [2022-02-20 20:10:19,835 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:10:19,836 INFO L254 CegarLoopForPetriNet]: 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] [2022-02-20 20:10:19,836 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:10:19,836 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting readerErr0ASSERT_VIOLATIONERROR_FUNCTION === [readerErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 3 more)] === [2022-02-20 20:10:19,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:10:19,837 INFO L85 PathProgramCache]: Analyzing trace with hash -546292075, now seen corresponding path program 2 times [2022-02-20 20:10:19,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:10:19,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929899735] [2022-02-20 20:10:19,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:10:19,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:10:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:10:19,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {218332#true} [210] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218332#true} is VALID [2022-02-20 20:10:19,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {218332#true} [191] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {218332#true} is VALID [2022-02-20 20:10:19,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {218332#true} [221] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {218332#true} is VALID [2022-02-20 20:10:19,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {218332#true} [223] L-1-2-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {218332#true} is VALID [2022-02-20 20:10:19,904 INFO L290 TraceCheckUtils]: 4: Hoare triple {218332#true} [183] L16-->L16-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {218332#true} is VALID [2022-02-20 20:10:19,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {218332#true} [147] L16-1-->L16-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {218332#true} is VALID [2022-02-20 20:10:19,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {218332#true} [229] L16-2-->L16-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {218332#true} is VALID [2022-02-20 20:10:19,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {218332#true} [201] L16-3-->L16-4: Formula: (and (= 20 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {218332#true} is VALID [2022-02-20 20:10:19,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {218332#true} [202] L16-4-->L704: Formula: (= v_~w~0_2 0) InVars {} OutVars{~w~0=v_~w~0_2} AuxVars[] AssignedVars[~w~0] {218332#true} is VALID [2022-02-20 20:10:19,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {218332#true} [213] L704-->L704-1: Formula: (= v_~r~0_5 0) InVars {} OutVars{~r~0=v_~r~0_5} AuxVars[] AssignedVars[~r~0] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {218334#(= ~r~0 0)} [232] L704-1-->L704-2: Formula: (= v_~x~0_3 0) InVars {} OutVars{~x~0=v_~x~0_3} AuxVars[] AssignedVars[~x~0] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {218334#(= ~r~0 0)} [196] L704-2-->L-1-3: Formula: (= v_~y~0_3 0) InVars {} OutVars{~y~0=v_~y~0_3} AuxVars[] AssignedVars[~y~0] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {218334#(= ~r~0 0)} [225] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {218334#(= ~r~0 0)} [199] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {218334#(= ~r~0 0)} [167] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {218334#(= ~r~0 0)} [195] L-1-6-->L748: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~mem15#1=|v_ULTIMATE.start_main_#t~mem15#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem13#1, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem15#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_~#t2~0#1.base] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {218334#(= ~r~0 0)} [186] L748-->L748-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {218334#(= ~r~0 0)} [170] L748-1-->L748-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {218334#(= ~r~0 0)} [149] L748-2-->L748-3: Formula: (and (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (store |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1) |v_#valid_8|) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4) |v_#length_7|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {218334#(= ~r~0 0)} [146] L748-3-->L748-4: Formula: (and (= (store |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 1) |v_#valid_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_2| 0)) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2|) 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_10|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_2|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_2|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {218334#(= ~r~0 0)} [154] L748-4-->L749: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {218334#(= ~r~0 0)} [151] L749-->L749-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {218334#(= ~r~0 0)} [208] L749-1-->L749-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {218334#(= ~r~0 0)} [282] L749-2-->writerENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_writerThread1of1ForFork2_thidvar0_2) (= v_writerThread1of1ForFork2_thidvar1_2 0) (= |v_writerThread1of1ForFork2_#in~arg#1.offset_4| 0) (= |v_writerThread1of1ForFork2_#in~arg#1.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{writerThread1of1ForFork2_~arg#1.base=|v_writerThread1of1ForFork2_~arg#1.base_4|, writerThread1of1ForFork2_#in~arg#1.offset=|v_writerThread1of1ForFork2_#in~arg#1.offset_4|, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_4|, writerThread1of1ForFork2_#in~arg#1.base=|v_writerThread1of1ForFork2_#in~arg#1.base_4|, writerThread1of1ForFork2_#res#1.base=|v_writerThread1of1ForFork2_#res#1.base_4|, writerThread1of1ForFork2_#res#1.offset=|v_writerThread1of1ForFork2_#res#1.offset_4|, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2, writerThread1of1ForFork2_thidvar1=v_writerThread1of1ForFork2_thidvar1_2, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, writerThread1of1ForFork2_~arg#1.offset=|v_writerThread1of1ForFork2_~arg#1.offset_4|} AuxVars[] AssignedVars[writerThread1of1ForFork2_~arg#1.base, writerThread1of1ForFork2_#in~arg#1.offset, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_#in~arg#1.base, writerThread1of1ForFork2_#res#1.base, writerThread1of1ForFork2_#res#1.offset, writerThread1of1ForFork2_thidvar0, writerThread1of1ForFork2_thidvar1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1, writerThread1of1ForFork2_~arg#1.offset] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {218334#(= ~r~0 0)} [187] L749-3-->L749-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,913 INFO L290 TraceCheckUtils]: 25: Hoare triple {218334#(= ~r~0 0)} [204] L749-4-->L750: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {218334#(= ~r~0 0)} [184] L750-->L750-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {218334#(= ~r~0 0)} [222] L750-1-->L750-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {218334#(= ~r~0 0)} [209] L750-2-->L750-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {218334#(= ~r~0 0)} [278] L750-3-->readerENTRY: Formula: (and (= v_readerThread1of1ForFork0_thidvar1_2 0) (= |v_readerThread1of1ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_readerThread1of1ForFork0_thidvar0_2) (= |v_readerThread1of1ForFork0_#in~arg#1.base_4| 0) (= v_readerThread1of1ForFork0_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{readerThread1of1ForFork0_thidvar2=v_readerThread1of1ForFork0_thidvar2_2, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_12|, readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_4|, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_#res#1.offset=|v_readerThread1of1ForFork0_#res#1.offset_4|, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_4|, readerThread1of1ForFork0_~arg#1.base=|v_readerThread1of1ForFork0_~arg#1.base_4|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_8|, readerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_4|, readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_8|, readerThread1of1ForFork0_~arg#1.offset=|v_readerThread1of1ForFork0_~arg#1.offset_4|, readerThread1of1ForFork0_#res#1.base=|v_readerThread1of1ForFork0_#res#1.base_4|, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[readerThread1of1ForFork0_thidvar2, readerThread1of1ForFork0_~l~0#1, readerThread1of1ForFork0_#in~arg#1.base, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_#res#1.offset, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_#in~arg#1.offset, readerThread1of1ForFork0_~arg#1.base, readerThread1of1ForFork0_~ly~0#1, readerThread1of1ForFork0_assume_abort_if_not_~cond#1, readerThread1of1ForFork0_~lx~0#1, readerThread1of1ForFork0_~arg#1.offset, readerThread1of1ForFork0_#res#1.base, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,916 INFO L290 TraceCheckUtils]: 30: Hoare triple {218334#(= ~r~0 0)} [235] readerENTRY-->L724: Formula: (and (= |v_readerThread1of1ForFork0_#in~arg#1.offset_1| |v_readerThread1of1ForFork0_~arg#1.offset_1|) (= |v_readerThread1of1ForFork0_#in~arg#1.base_1| |v_readerThread1of1ForFork0_~arg#1.base_1|)) InVars {readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_1|, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{readerThread1of1ForFork0_~arg#1.base=|v_readerThread1of1ForFork0_~arg#1.base_1|, readerThread1of1ForFork0_#in~arg#1.base=|v_readerThread1of1ForFork0_#in~arg#1.base_1|, readerThread1of1ForFork0_~arg#1.offset=|v_readerThread1of1ForFork0_~arg#1.offset_1|, readerThread1of1ForFork0_#in~arg#1.offset=|v_readerThread1of1ForFork0_#in~arg#1.offset_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~arg#1.offset, readerThread1of1ForFork0_~arg#1.base] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {218334#(= ~r~0 0)} [236] L724-->L725: Formula: true InVars {} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1] {218334#(= ~r~0 0)} is VALID [2022-02-20 20:10:19,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {218334#(= ~r~0 0)} [237] L725-->L725-1: Formula: (and (= |v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|) (= (ite (= v_~w~0_24 0) 1 0) |v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|) (= v_~r~0_27 (+ v_~r~0_28 1)) (not (= 0 |v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|))) InVars {~w~0=v_~w~0_24, ~r~0=v_~r~0_28} OutVars{~w~0=v_~w~0_24, readerThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_27} AuxVars[] AssignedVars[readerThread1of1ForFork0_assume_abort_if_not_~cond#1, readerThread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~r~0] {218335#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} is VALID [2022-02-20 20:10:19,918 INFO L290 TraceCheckUtils]: 33: Hoare triple {218335#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} [238] L725-1-->L728: Formula: (= |v_readerThread1of1ForFork0_~l~0#1_3| v_~x~0_1) InVars {~x~0=v_~x~0_1} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_3|, ~x~0=v_~x~0_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1] {218335#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} is VALID [2022-02-20 20:10:19,919 INFO L290 TraceCheckUtils]: 34: Hoare triple {218335#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} [239] L728-->L731: Formula: (= |v_readerThread1of1ForFork0_~l~0#1_5| v_~y~0_1) InVars {readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_5|} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_5|, ~y~0=v_~y~0_1} AuxVars[] AssignedVars[~y~0] {218335#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} is VALID [2022-02-20 20:10:19,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {218335#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} [240] L731-->L734: Formula: (= |v_readerThread1of1ForFork0_~ly~0#1_1| v_~y~0_2) InVars {~y~0=v_~y~0_2} OutVars{~y~0=v_~y~0_2, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_1|} AuxVars[] AssignedVars[readerThread1of1ForFork0_~ly~0#1] {218335#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} is VALID [2022-02-20 20:10:19,922 INFO L290 TraceCheckUtils]: 36: Hoare triple {218335#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} [265] writerENTRY-->L714: Formula: (and (= |v_writerThread1of1ForFork2_~arg#1.base_1| |v_writerThread1of1ForFork2_#in~arg#1.base_1|) (= |v_writerThread1of1ForFork2_~arg#1.offset_1| |v_writerThread1of1ForFork2_#in~arg#1.offset_1|)) InVars {writerThread1of1ForFork2_#in~arg#1.base=|v_writerThread1of1ForFork2_#in~arg#1.base_1|, writerThread1of1ForFork2_#in~arg#1.offset=|v_writerThread1of1ForFork2_#in~arg#1.offset_1|} OutVars{writerThread1of1ForFork2_~arg#1.base=|v_writerThread1of1ForFork2_~arg#1.base_1|, writerThread1of1ForFork2_#in~arg#1.offset=|v_writerThread1of1ForFork2_#in~arg#1.offset_1|, writerThread1of1ForFork2_#in~arg#1.base=|v_writerThread1of1ForFork2_#in~arg#1.base_1|, writerThread1of1ForFork2_~arg#1.offset=|v_writerThread1of1ForFork2_~arg#1.offset_1|} AuxVars[] AssignedVars[writerThread1of1ForFork2_~arg#1.base, writerThread1of1ForFork2_~arg#1.offset] {218335#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} is VALID [2022-02-20 20:10:19,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {218335#(or (not (= ~w~0 0)) (not (= ~r~0 0)))} [266] L714-->L714-1: Formula: (and (= v_~w~0_28 1) (= |v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= |v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (and (= v_~w~0_29 0) (= v_~r~0_31 0)) 1 0)) (not (= |v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1| 0))) InVars {~w~0=v_~w~0_29, ~r~0=v_~r~0_31} OutVars{~w~0=v_~w~0_28, writerThread1of1ForFork2_assume_abort_if_not_~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_~cond#1_1|, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~r~0=v_~r~0_31} AuxVars[] AssignedVars[~w~0, writerThread1of1ForFork2_assume_abort_if_not_~cond#1, writerThread1of1ForFork2_assume_abort_if_not_#in~cond#1] {218333#false} is VALID [2022-02-20 20:10:19,923 INFO L290 TraceCheckUtils]: 38: Hoare triple {218333#false} [267] L714-1-->L717: Formula: (= 3 v_~x~0_4) InVars {} OutVars{~x~0=v_~x~0_4} AuxVars[] AssignedVars[~x~0] {218333#false} is VALID [2022-02-20 20:10:19,923 INFO L290 TraceCheckUtils]: 39: Hoare triple {218333#false} [241] L734-->L737: Formula: (= |v_readerThread1of1ForFork0_~lx~0#1_1| v_~x~0_2) InVars {~x~0=v_~x~0_2} OutVars{readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_1|, ~x~0=v_~x~0_2} AuxVars[] AssignedVars[readerThread1of1ForFork0_~lx~0#1] {218333#false} is VALID [2022-02-20 20:10:19,923 INFO L290 TraceCheckUtils]: 40: Hoare triple {218333#false} [242] L737-->L738: Formula: (not (= |v_readerThread1of1ForFork0_~lx~0#1_3| |v_readerThread1of1ForFork0_~ly~0#1_3|)) InVars {readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_3|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_3|} OutVars{readerThread1of1ForFork0_~lx~0#1=|v_readerThread1of1ForFork0_~lx~0#1_3|, readerThread1of1ForFork0_~ly~0#1=|v_readerThread1of1ForFork0_~ly~0#1_3|} AuxVars[] AssignedVars[] {218333#false} is VALID [2022-02-20 20:10:19,927 INFO L290 TraceCheckUtils]: 41: Hoare triple {218333#false} [244] L738-->readerErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {218333#false} is VALID [2022-02-20 20:10:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:10:19,927 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:10:19,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929899735] [2022-02-20 20:10:19,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929899735] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:10:19,928 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:10:19,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 20:10:19,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839466802] [2022-02-20 20:10:19,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:10:19,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2022-02-20 20:10:19,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:10:19,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) [2022-02-20 20:10:19,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:10:19,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 20:10:19,953 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:10:19,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 20:10:19,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 20:10:19,954 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 114 [2022-02-20 20:10:19,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 129 transitions, 432 flow. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 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) [2022-02-20 20:10:19,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:10:19,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 114 [2022-02-20 20:10:19,955 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:10:21,529 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([246] L738-2-->L741: Formula: (= (+ (- 1) v_~r~0_3) |v_readerThread1of1ForFork0_~l~0#1_7|) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][137], [75#L753-2true, 73#L717true, 133#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 36#L741true, 34#L725-1true, 113269#(= ~w~0 1), Black: 130#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 139#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 143#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 145#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), readerThread1of1ForFork3InUse, Black: 128#true, Black: 135#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 218337#(and (not (= ~w~0 0)) (= ~r~0 0))]) [2022-02-20 20:10:21,530 INFO L384 tUnfolder$Statistics]: this new event has 67 ancestors and is not cut-off event [2022-02-20 20:10:21,530 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-02-20 20:10:21,530 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-02-20 20:10:21,530 INFO L387 tUnfolder$Statistics]: existing Event has 67 ancestors and is not cut-off event [2022-02-20 20:10:21,666 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([246] L738-2-->L741: Formula: (= (+ (- 1) v_~r~0_3) |v_readerThread1of1ForFork0_~l~0#1_7|) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][137], [75#L753-2true, 73#L717true, 133#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 36#L741true, 113269#(= ~w~0 1), Black: 130#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 139#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 143#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 22#L731true, Black: 145#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), readerThread1of1ForFork3InUse, Black: 128#true, Black: 135#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 218337#(and (not (= ~w~0 0)) (= ~r~0 0))]) [2022-02-20 20:10:21,667 INFO L384 tUnfolder$Statistics]: this new event has 69 ancestors and is not cut-off event [2022-02-20 20:10:21,667 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-02-20 20:10:21,667 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-02-20 20:10:21,667 INFO L387 tUnfolder$Statistics]: existing Event has 69 ancestors and is not cut-off event [2022-02-20 20:10:21,902 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([246] L738-2-->L741: Formula: (= (+ (- 1) v_~r~0_3) |v_readerThread1of1ForFork0_~l~0#1_7|) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][137], [75#L753-2true, 73#L717true, 133#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 36#L741true, 119#L741true, 113269#(= ~w~0 1), Black: 130#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 139#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 143#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 145#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), readerThread1of1ForFork3InUse, Black: 128#true, Black: 135#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 218337#(and (not (= ~w~0 0)) (= ~r~0 0))]) [2022-02-20 20:10:21,902 INFO L384 tUnfolder$Statistics]: this new event has 73 ancestors and is cut-off event [2022-02-20 20:10:21,902 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-02-20 20:10:21,903 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-02-20 20:10:21,903 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-02-20 20:10:21,908 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([246] L738-2-->L741: Formula: (= (+ (- 1) v_~r~0_3) |v_readerThread1of1ForFork0_~l~0#1_7|) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][159], [75#L753-2true, 73#L717true, 133#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 36#L741true, 43#L744true, 113269#(= ~w~0 1), 218335#(or (not (= ~w~0 0)) (not (= ~r~0 0))), Black: 130#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 139#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 143#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 145#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), readerThread1of1ForFork3InUse, Black: 128#true, Black: 135#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0))]) [2022-02-20 20:10:21,909 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event [2022-02-20 20:10:21,909 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-02-20 20:10:21,909 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-02-20 20:10:21,909 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-02-20 20:10:21,926 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([246] L738-2-->L741: Formula: (= (+ (- 1) v_~r~0_3) |v_readerThread1of1ForFork0_~l~0#1_7|) InVars {~r~0=v_~r~0_3} OutVars{readerThread1of1ForFork0_~l~0#1=|v_readerThread1of1ForFork0_~l~0#1_7|, ~r~0=v_~r~0_3} AuxVars[] AssignedVars[readerThread1of1ForFork0_~l~0#1][137], [75#L753-2true, 73#L717true, 133#(= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|), 36#L741true, 43#L744true, 113269#(= ~w~0 1), Black: 130#(= |readerThread1of1ForFork0_~l~0#1| ~x~0), Black: 139#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 143#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), Black: 145#(and (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0) (= |readerThread1of1ForFork0_~lx~0#1| |readerThread1of1ForFork0_~ly~0#1|)), Black: 137#(and (= ~y~0 ~x~0) (= ~x~0 |readerThread1of1ForFork0_~ly~0#1|) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), readerThread1of1ForFork3InUse, Black: 128#true, Black: 135#(and (= ~y~0 ~x~0) (= |readerThread1of1ForFork0_~l~0#1| ~x~0)), 218337#(and (not (= ~w~0 0)) (= ~r~0 0))]) [2022-02-20 20:10:21,927 INFO L384 tUnfolder$Statistics]: this new event has 74 ancestors and is not cut-off event [2022-02-20 20:10:21,927 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2022-02-20 20:10:21,927 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2022-02-20 20:10:21,927 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is not cut-off event [2022-02-20 20:10:21,958 INFO L129 PetriNetUnfolder]: 1570/4809 cut-off events. [2022-02-20 20:10:21,958 INFO L130 PetriNetUnfolder]: For 2333/2460 co-relation queries the response was YES. [2022-02-20 20:10:21,977 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10054 conditions, 4809 events. 1570/4809 cut-off events. For 2333/2460 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 48886 event pairs, 148 based on Foata normal form. 48/4674 useless extension candidates. Maximal degree in co-relation 8787. Up to 779 conditions per place. [2022-02-20 20:10:21,997 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 45 selfloop transitions, 19 changer transitions 4/175 dead transitions. [2022-02-20 20:10:21,997 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 175 transitions, 737 flow [2022-02-20 20:10:21,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:10:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:10:22,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2022-02-20 20:10:22,002 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9087719298245615 [2022-02-20 20:10:22,002 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2022-02-20 20:10:22,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2022-02-20 20:10:22,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:10:22,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2022-02-20 20:10:22,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 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) [2022-02-20 20:10:22,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 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) [2022-02-20 20:10:22,005 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 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) [2022-02-20 20:10:22,005 INFO L186 Difference]: Start difference. First operand has 122 places, 129 transitions, 432 flow. Second operand 5 states and 518 transitions. [2022-02-20 20:10:22,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 175 transitions, 737 flow