./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-deagle/reorder_c11_bad-30.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-deagle/reorder_c11_bad-30.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 8d7df89eaaa05ee1c4077455abbd501c07d86257ca2c037ce71ae27b3838effb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:00:28,264 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:00:28,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:00:28,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:00:28,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:00:28,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:00:28,291 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:00:28,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:00:28,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:00:28,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:00:28,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:00:28,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:00:28,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:00:28,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:00:28,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:00:28,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:00:28,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:00:28,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:00:28,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:00:28,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:00:28,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:00:28,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:00:28,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:00:28,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:00:28,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:00:28,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:00:28,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:00:28,324 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:00:28,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:00:28,325 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:00:28,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:00:28,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:00:28,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:00:28,328 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:00:28,329 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:00:28,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:00:28,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:00:28,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:00:28,330 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:00:28,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:00:28,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:00:28,332 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 21:00:28,356 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:00:28,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:00:28,357 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:00:28,357 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:00:28,358 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:00:28,358 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:00:28,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:00:28,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:00:28,359 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:00:28,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:00:28,360 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 21:00:28,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:00:28,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 21:00:28,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:00:28,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:00:28,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:00:28,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:00:28,361 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 21:00:28,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:00:28,361 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:00:28,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:00:28,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:00:28,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:00:28,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:00:28,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:00:28,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:00:28,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:00:28,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:00:28,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:00:28,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:00:28,364 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:00:28,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:00:28,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:00:28,364 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 -> 8d7df89eaaa05ee1c4077455abbd501c07d86257ca2c037ce71ae27b3838effb [2022-02-20 21:00:28,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:00:28,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:00:28,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:00:28,567 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:00:28,567 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:00:28,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/reorder_c11_bad-30.i [2022-02-20 21:00:28,613 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0292d19/703662d1f9a34235b9a09dc0ad2e24df/FLAGa0190a09c [2022-02-20 21:00:29,032 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:00:29,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/reorder_c11_bad-30.i [2022-02-20 21:00:29,048 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0292d19/703662d1f9a34235b9a09dc0ad2e24df/FLAGa0190a09c [2022-02-20 21:00:29,056 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc0292d19/703662d1f9a34235b9a09dc0ad2e24df [2022-02-20 21:00:29,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:00:29,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:00:29,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:00:29,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:00:29,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:00:29,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:00:29" (1/1) ... [2022-02-20 21:00:29,073 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46da0a59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:00:29, skipping insertion in model container [2022-02-20 21:00:29,073 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:00:29" (1/1) ... [2022-02-20 21:00:29,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:00:29,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:00:29,323 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-deagle/reorder_c11_bad-30.i[30190,30203] [2022-02-20 21:00:29,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:00:29,337 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:00:29,378 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-deagle/reorder_c11_bad-30.i[30190,30203] [2022-02-20 21:00:29,387 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:00:29,408 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:00:29,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:00:29 WrapperNode [2022-02-20 21:00:29,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:00:29,409 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:00:29,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:00:29,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:00:29,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:00:29" (1/1) ... [2022-02-20 21:00:29,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:00:29" (1/1) ... [2022-02-20 21:00:29,436 INFO L137 Inliner]: procedures = 163, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 71 [2022-02-20 21:00:29,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:00:29,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:00:29,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:00:29,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:00:29,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:00:29" (1/1) ... [2022-02-20 21:00:29,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:00:29" (1/1) ... [2022-02-20 21:00:29,443 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:00:29" (1/1) ... [2022-02-20 21:00:29,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:00:29" (1/1) ... [2022-02-20 21:00:29,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:00:29" (1/1) ... [2022-02-20 21:00:29,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:00:29" (1/1) ... [2022-02-20 21:00:29,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:00:29" (1/1) ... [2022-02-20 21:00:29,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:00:29,454 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:00:29,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:00:29,454 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:00:29,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:00:29" (1/1) ... [2022-02-20 21:00:29,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:00:29,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:00:29,488 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 21:00:29,508 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 21:00:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:00:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2022-02-20 21:00:29,519 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2022-02-20 21:00:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:00:29,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-20 21:00:29,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:00:29,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:00:29,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:00:29,521 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2022-02-20 21:00:29,522 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2022-02-20 21:00:29,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:00:29,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-20 21:00:29,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:00:29,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:00:29,523 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 21:00:29,628 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:00:29,629 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:00:29,750 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:00:29,755 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:00:29,755 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 21:00:29,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:00:29 BoogieIcfgContainer [2022-02-20 21:00:29,757 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:00:29,758 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:00:29,758 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:00:29,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:00:29,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:00:29" (1/3) ... [2022-02-20 21:00:29,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53da16f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:00:29, skipping insertion in model container [2022-02-20 21:00:29,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:00:29" (2/3) ... [2022-02-20 21:00:29,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53da16f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:00:29, skipping insertion in model container [2022-02-20 21:00:29,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:00:29" (3/3) ... [2022-02-20 21:00:29,762 INFO L111 eAbstractionObserver]: Analyzing ICFG reorder_c11_bad-30.i [2022-02-20 21:00:29,765 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 21:00:29,765 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:00:29,765 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:00:29,765 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 21:00:29,807 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of1ForFork0_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,807 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of1ForFork0_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,808 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of1ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,808 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of1ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,808 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of1ForFork0_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,808 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of1ForFork0_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,808 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of1ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,808 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of1ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,810 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,810 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,811 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,811 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,811 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of1ForFork1_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,811 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of1ForFork1_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,811 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of1ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,812 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of1ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,812 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of1ForFork1_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,812 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of1ForFork1_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,812 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of1ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,812 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of1ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,813 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,813 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,813 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,813 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,816 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,816 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,816 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of1ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,816 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of1ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,818 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,818 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,818 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of1ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,818 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of1ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:29,829 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-02-20 21:00:29,859 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:00:29,863 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 21:00:29,864 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 21:00:29,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 87 places, 91 transitions, 204 flow [2022-02-20 21:00:29,910 INFO L129 PetriNetUnfolder]: 24/202 cut-off events. [2022-02-20 21:00:29,910 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-02-20 21:00:29,914 INFO L84 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 202 events. 24/202 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 622 event pairs, 0 based on Foata normal form. 0/170 useless extension candidates. Maximal degree in co-relation 105. Up to 8 conditions per place. [2022-02-20 21:00:29,914 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 91 transitions, 204 flow [2022-02-20 21:00:29,917 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 89 transitions, 194 flow [2022-02-20 21:00:29,926 INFO L129 PetriNetUnfolder]: 5/66 cut-off events. [2022-02-20 21:00:29,926 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 21:00:29,926 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 21:00:29,927 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] [2022-02-20 21:00:29,927 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:00:29,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:00:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash -211201094, now seen corresponding path program 1 times [2022-02-20 21:00:29,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:00:29,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674566485] [2022-02-20 21:00:29,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:00:29,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:00:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:00:30,062 INFO L290 TraceCheckUtils]: 0: Hoare triple {90#true} [199] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-02-20 21:00:30,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} [181] 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] {90#true} is VALID [2022-02-20 21:00:30,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} [208] 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[] {90#true} is VALID [2022-02-20 21:00:30,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {90#true} [209] L-1-2-->L680: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {90#true} is VALID [2022-02-20 21:00:30,063 INFO L290 TraceCheckUtils]: 4: Hoare triple {90#true} [204] L680-->L680-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[] {90#true} is VALID [2022-02-20 21:00:30,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} [163] L680-1-->L680-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[] {90#true} is VALID [2022-02-20 21:00:30,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#true} [207] L680-2-->L680-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[] {90#true} is VALID [2022-02-20 21:00:30,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {90#true} [178] L680-3-->L680-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {90#true} is VALID [2022-02-20 21:00:30,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {90#true} [197] L680-4-->L680-5: Formula: (= (select (select |v_#memory_int_3| 2) 0) 0) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] {90#true} is VALID [2022-02-20 21:00:30,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {90#true} [161] L680-5-->L683: Formula: (= v_~a~0_4 0) InVars {} OutVars{~a~0=v_~a~0_4} AuxVars[] AssignedVars[~a~0] {90#true} is VALID [2022-02-20 21:00:30,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {90#true} [145] L683-->L684: Formula: (= v_~b~0_4 0) InVars {} OutVars{~b~0=v_~b~0_4} AuxVars[] AssignedVars[~b~0] {90#true} is VALID [2022-02-20 21:00:30,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {90#true} [131] L684-->L-1-3: Formula: (= v_~i~0_1 0) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {90#true} is VALID [2022-02-20 21:00:30,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {90#true} [211] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-02-20 21:00:30,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {90#true} [187] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-02-20 21:00:30,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {90#true} [150] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {90#true} is VALID [2022-02-20 21:00:30,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {90#true} [185] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {90#true} is VALID [2022-02-20 21:00:30,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {90#true} [148] L-1-7-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_1|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#setPool~0#1.base, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre2#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~#checkPool~0#1.offset, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1, ULTIMATE.start_main_~#setPool~0#1.offset, ULTIMATE.start_main_~#checkPool~0#1.base] {90#true} is VALID [2022-02-20 21:00:30,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {90#true} [184] L699-->L699-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {90#true} is VALID [2022-02-20 21:00:30,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {90#true} [153] L699-1-->L700: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {90#true} is VALID [2022-02-20 21:00:30,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {90#true} [210] L700-->L700-1: Formula: (and (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 120)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#setPool~0#1.offset_2| 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 0))) 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_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_2|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#setPool~0#1.base, #valid, #length, ULTIMATE.start_main_~#setPool~0#1.offset] {90#true} is VALID [2022-02-20 21:00:30,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {90#true} [213] L700-1-->L701: Formula: (and (= |v_ULTIMATE.start_main_~#checkPool~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 1)) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, #valid=|v_#valid_6|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#checkPool~0#1.offset, #valid, #length, ULTIMATE.start_main_~#checkPool~0#1.base] {90#true} is VALID [2022-02-20 21:00:30,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {90#true} [202] L701-->L702-5: Formula: (= v_~i~0_2 0) InVars {} OutVars{~i~0=v_~i~0_2} AuxVars[] AssignedVars[~i~0] {90#true} is VALID [2022-02-20 21:00:30,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {90#true} [139] L702-5-->L702-6: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {91#false} is VALID [2022-02-20 21:00:30,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {91#false} [215] L702-6-->L704-5: Formula: (= v_~i~0_8 0) InVars {} OutVars{~i~0=v_~i~0_8} AuxVars[] AssignedVars[~i~0] {91#false} is VALID [2022-02-20 21:00:30,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {91#false} [172] L704-5-->L705: Formula: (< v_~i~0_10 1) InVars {~i~0=v_~i~0_10} OutVars{~i~0=v_~i~0_10} AuxVars[] AssignedVars[] {91#false} is VALID [2022-02-20 21:00:30,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {91#false} [179] L705-->L705-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {91#false} is VALID [2022-02-20 21:00:30,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {91#false} [206] L705-1-->L705-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {91#false} is VALID [2022-02-20 21:00:30,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {91#false} [201] L705-2-->L705-3: Formula: (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#checkPool~0#1.offset_3| (* v_~i~0_11 4)) |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_6|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_3|, ~i~0=v_~i~0_11, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_3|, ~i~0=v_~i~0_11, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {91#false} is VALID [2022-02-20 21:00:30,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {91#false} [233] L705-3-->checkThreadENTRY: Formula: (and (= |v_checkThreadThread1of1ForFork1_#in~param.offset_4| 0) (= |v_checkThreadThread1of1ForFork1_#in~param.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_checkThreadThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, checkThreadThread1of1ForFork1_#in~param.base=|v_checkThreadThread1of1ForFork1_#in~param.base_4|, checkThreadThread1of1ForFork1_thidvar0=v_checkThreadThread1of1ForFork1_thidvar0_2, checkThreadThread1of1ForFork1_#res.base=|v_checkThreadThread1of1ForFork1_#res.base_4|, checkThreadThread1of1ForFork1_#res.offset=|v_checkThreadThread1of1ForFork1_#res.offset_4|, checkThreadThread1of1ForFork1_~param.base=v_checkThreadThread1of1ForFork1_~param.base_4, checkThreadThread1of1ForFork1_#in~param.offset=|v_checkThreadThread1of1ForFork1_#in~param.offset_4|, checkThreadThread1of1ForFork1_~param.offset=v_checkThreadThread1of1ForFork1_~param.offset_4} AuxVars[] AssignedVars[checkThreadThread1of1ForFork1_#in~param.base, checkThreadThread1of1ForFork1_thidvar0, checkThreadThread1of1ForFork1_#res.base, checkThreadThread1of1ForFork1_#res.offset, checkThreadThread1of1ForFork1_~param.base, checkThreadThread1of1ForFork1_#in~param.offset, checkThreadThread1of1ForFork1_~param.offset] {91#false} is VALID [2022-02-20 21:00:30,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {91#false} [222] checkThreadENTRY-->L695: Formula: (and (= v_checkThreadThread1of1ForFork1_~param.offset_1 |v_checkThreadThread1of1ForFork1_#in~param.offset_1|) (= v_checkThreadThread1of1ForFork1_~param.base_1 |v_checkThreadThread1of1ForFork1_#in~param.base_1|)) InVars {checkThreadThread1of1ForFork1_#in~param.base=|v_checkThreadThread1of1ForFork1_#in~param.base_1|, checkThreadThread1of1ForFork1_#in~param.offset=|v_checkThreadThread1of1ForFork1_#in~param.offset_1|} OutVars{checkThreadThread1of1ForFork1_#in~param.base=|v_checkThreadThread1of1ForFork1_#in~param.base_1|, checkThreadThread1of1ForFork1_~param.base=v_checkThreadThread1of1ForFork1_~param.base_1, checkThreadThread1of1ForFork1_#in~param.offset=|v_checkThreadThread1of1ForFork1_#in~param.offset_1|, checkThreadThread1of1ForFork1_~param.offset=v_checkThreadThread1of1ForFork1_~param.offset_1} AuxVars[] AssignedVars[checkThreadThread1of1ForFork1_~param.base, checkThreadThread1of1ForFork1_~param.offset] {91#false} is VALID [2022-02-20 21:00:30,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {91#false} [224] L695-->L696: Formula: (and (or (not (= v_~a~0_3 1)) (not (= (- 1) v_~b~0_3))) (or (not (= v_~b~0_3 0)) (not (= v_~a~0_3 0)))) InVars {~a~0=v_~a~0_3, ~b~0=v_~b~0_3} OutVars{~a~0=v_~a~0_3, ~b~0=v_~b~0_3} AuxVars[] AssignedVars[] {91#false} is VALID [2022-02-20 21:00:30,070 INFO L290 TraceCheckUtils]: 31: Hoare triple {91#false} [226] L696-->checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {91#false} is VALID [2022-02-20 21:00:30,071 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 21:00:30,071 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:00:30,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674566485] [2022-02-20 21:00:30,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674566485] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:00:30,072 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:00:30,072 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 21:00:30,073 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004853976] [2022-02-20 21:00:30,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:00:30,082 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 32 [2022-02-20 21:00:30,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:00:30,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 21:00:30,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:00:30,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 21:00:30,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:00:30,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 21:00:30,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 21:00:30,142 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 91 [2022-02-20 21:00:30,145 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 89 transitions, 194 flow. Second operand has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 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 21:00:30,146 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 21:00:30,146 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 91 [2022-02-20 21:00:30,146 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 21:00:30,207 INFO L129 PetriNetUnfolder]: 4/172 cut-off events. [2022-02-20 21:00:30,207 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-02-20 21:00:30,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 172 events. 4/172 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 542 event pairs, 0 based on Foata normal form. 18/174 useless extension candidates. Maximal degree in co-relation 104. Up to 8 conditions per place. [2022-02-20 21:00:30,208 INFO L132 encePairwiseOnDemand]: 86/91 looper letters, 4 selfloop transitions, 0 changer transitions 0/83 dead transitions. [2022-02-20 21:00:30,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 83 transitions, 190 flow [2022-02-20 21:00:30,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 21:00:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-02-20 21:00:30,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 167 transitions. [2022-02-20 21:00:30,225 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9175824175824175 [2022-02-20 21:00:30,225 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 167 transitions. [2022-02-20 21:00:30,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 167 transitions. [2022-02-20 21:00:30,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 21:00:30,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 167 transitions. [2022-02-20 21:00:30,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 83.5) internal successors, (167), 2 states have internal predecessors, (167), 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 21:00:30,236 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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 21:00:30,236 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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 21:00:30,238 INFO L186 Difference]: Start difference. First operand has 87 places, 89 transitions, 194 flow. Second operand 2 states and 167 transitions. [2022-02-20 21:00:30,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 83 transitions, 190 flow [2022-02-20 21:00:30,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 83 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 21:00:30,249 INFO L242 Difference]: Finished difference. Result has 87 places, 83 transitions, 182 flow [2022-02-20 21:00:30,250 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=182, PETRI_PLACES=87, PETRI_TRANSITIONS=83} [2022-02-20 21:00:30,254 INFO L334 CegarLoopForPetriNet]: 87 programPoint places, 0 predicate places. [2022-02-20 21:00:30,255 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 87 places, 83 transitions, 182 flow [2022-02-20 21:00:30,301 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1634 states, 1617 states have (on average 2.4081632653061225) internal successors, (3894), 1633 states have internal predecessors, (3894), 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 21:00:30,305 INFO L78 Accepts]: Start accepts. Automaton has has 1634 states, 1617 states have (on average 2.4081632653061225) internal successors, (3894), 1633 states have internal predecessors, (3894), 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 32 [2022-02-20 21:00:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:00:30,305 INFO L470 AbstractCegarLoop]: Abstraction has has 87 places, 83 transitions, 182 flow [2022-02-20 21:00:30,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 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 21:00:30,306 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 21:00:30,306 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] [2022-02-20 21:00:30,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:00:30,307 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:00:30,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:00:30,307 INFO L85 PathProgramCache]: Analyzing trace with hash -407714599, now seen corresponding path program 1 times [2022-02-20 21:00:30,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:00:30,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787727813] [2022-02-20 21:00:30,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:00:30,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:00:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:00:30,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {1728#true} [199] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1728#true} is VALID [2022-02-20 21:00:30,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {1728#true} [181] 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] {1728#true} is VALID [2022-02-20 21:00:30,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {1728#true} [208] 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[] {1728#true} is VALID [2022-02-20 21:00:30,380 INFO L290 TraceCheckUtils]: 3: Hoare triple {1728#true} [209] L-1-2-->L680: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {1728#true} is VALID [2022-02-20 21:00:30,380 INFO L290 TraceCheckUtils]: 4: Hoare triple {1728#true} [204] L680-->L680-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[] {1728#true} is VALID [2022-02-20 21:00:30,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {1728#true} [163] L680-1-->L680-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[] {1728#true} is VALID [2022-02-20 21:00:30,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {1728#true} [207] L680-2-->L680-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[] {1728#true} is VALID [2022-02-20 21:00:30,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {1728#true} [178] L680-3-->L680-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {1728#true} is VALID [2022-02-20 21:00:30,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {1728#true} [197] L680-4-->L680-5: Formula: (= (select (select |v_#memory_int_3| 2) 0) 0) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] {1728#true} is VALID [2022-02-20 21:00:30,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {1728#true} [161] L680-5-->L683: Formula: (= v_~a~0_4 0) InVars {} OutVars{~a~0=v_~a~0_4} AuxVars[] AssignedVars[~a~0] {1728#true} is VALID [2022-02-20 21:00:30,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {1728#true} [145] L683-->L684: Formula: (= v_~b~0_4 0) InVars {} OutVars{~b~0=v_~b~0_4} AuxVars[] AssignedVars[~b~0] {1728#true} is VALID [2022-02-20 21:00:30,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {1728#true} [131] L684-->L-1-3: Formula: (= v_~i~0_1 0) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {1728#true} is VALID [2022-02-20 21:00:30,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {1728#true} [211] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1728#true} is VALID [2022-02-20 21:00:30,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {1728#true} [187] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1728#true} is VALID [2022-02-20 21:00:30,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {1728#true} [150] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {1728#true} is VALID [2022-02-20 21:00:30,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {1728#true} [185] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {1728#true} is VALID [2022-02-20 21:00:30,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {1728#true} [148] L-1-7-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_1|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#setPool~0#1.base, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre2#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~#checkPool~0#1.offset, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1, ULTIMATE.start_main_~#setPool~0#1.offset, ULTIMATE.start_main_~#checkPool~0#1.base] {1728#true} is VALID [2022-02-20 21:00:30,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {1728#true} [184] L699-->L699-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {1728#true} is VALID [2022-02-20 21:00:30,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {1728#true} [153] L699-1-->L700: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {1728#true} is VALID [2022-02-20 21:00:30,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {1728#true} [210] L700-->L700-1: Formula: (and (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 120)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#setPool~0#1.offset_2| 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 0))) 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_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_2|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#setPool~0#1.base, #valid, #length, ULTIMATE.start_main_~#setPool~0#1.offset] {1728#true} is VALID [2022-02-20 21:00:30,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {1728#true} [213] L700-1-->L701: Formula: (and (= |v_ULTIMATE.start_main_~#checkPool~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 1)) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, #valid=|v_#valid_6|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#checkPool~0#1.offset, #valid, #length, ULTIMATE.start_main_~#checkPool~0#1.base] {1728#true} is VALID [2022-02-20 21:00:30,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {1728#true} [202] L701-->L702-5: Formula: (= v_~i~0_2 0) InVars {} OutVars{~i~0=v_~i~0_2} AuxVars[] AssignedVars[~i~0] {1730#(= ~i~0 0)} is VALID [2022-02-20 21:00:30,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {1730#(= ~i~0 0)} [140] L702-5-->L702-6: Formula: (not (< v_~i~0_3 30)) InVars {~i~0=v_~i~0_3} OutVars{~i~0=v_~i~0_3} AuxVars[] AssignedVars[] {1729#false} is VALID [2022-02-20 21:00:30,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {1729#false} [215] L702-6-->L704-5: Formula: (= v_~i~0_8 0) InVars {} OutVars{~i~0=v_~i~0_8} AuxVars[] AssignedVars[~i~0] {1729#false} is VALID [2022-02-20 21:00:30,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {1729#false} [172] L704-5-->L705: Formula: (< v_~i~0_10 1) InVars {~i~0=v_~i~0_10} OutVars{~i~0=v_~i~0_10} AuxVars[] AssignedVars[] {1729#false} is VALID [2022-02-20 21:00:30,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {1729#false} [179] L705-->L705-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {1729#false} is VALID [2022-02-20 21:00:30,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {1729#false} [206] L705-1-->L705-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {1729#false} is VALID [2022-02-20 21:00:30,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {1729#false} [201] L705-2-->L705-3: Formula: (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#checkPool~0#1.offset_3| (* v_~i~0_11 4)) |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_6|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_3|, ~i~0=v_~i~0_11, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_3|, ~i~0=v_~i~0_11, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {1729#false} is VALID [2022-02-20 21:00:30,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {1729#false} [233] L705-3-->checkThreadENTRY: Formula: (and (= |v_checkThreadThread1of1ForFork1_#in~param.offset_4| 0) (= |v_checkThreadThread1of1ForFork1_#in~param.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_checkThreadThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, checkThreadThread1of1ForFork1_#in~param.base=|v_checkThreadThread1of1ForFork1_#in~param.base_4|, checkThreadThread1of1ForFork1_thidvar0=v_checkThreadThread1of1ForFork1_thidvar0_2, checkThreadThread1of1ForFork1_#res.base=|v_checkThreadThread1of1ForFork1_#res.base_4|, checkThreadThread1of1ForFork1_#res.offset=|v_checkThreadThread1of1ForFork1_#res.offset_4|, checkThreadThread1of1ForFork1_~param.base=v_checkThreadThread1of1ForFork1_~param.base_4, checkThreadThread1of1ForFork1_#in~param.offset=|v_checkThreadThread1of1ForFork1_#in~param.offset_4|, checkThreadThread1of1ForFork1_~param.offset=v_checkThreadThread1of1ForFork1_~param.offset_4} AuxVars[] AssignedVars[checkThreadThread1of1ForFork1_#in~param.base, checkThreadThread1of1ForFork1_thidvar0, checkThreadThread1of1ForFork1_#res.base, checkThreadThread1of1ForFork1_#res.offset, checkThreadThread1of1ForFork1_~param.base, checkThreadThread1of1ForFork1_#in~param.offset, checkThreadThread1of1ForFork1_~param.offset] {1729#false} is VALID [2022-02-20 21:00:30,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {1729#false} [222] checkThreadENTRY-->L695: Formula: (and (= v_checkThreadThread1of1ForFork1_~param.offset_1 |v_checkThreadThread1of1ForFork1_#in~param.offset_1|) (= v_checkThreadThread1of1ForFork1_~param.base_1 |v_checkThreadThread1of1ForFork1_#in~param.base_1|)) InVars {checkThreadThread1of1ForFork1_#in~param.base=|v_checkThreadThread1of1ForFork1_#in~param.base_1|, checkThreadThread1of1ForFork1_#in~param.offset=|v_checkThreadThread1of1ForFork1_#in~param.offset_1|} OutVars{checkThreadThread1of1ForFork1_#in~param.base=|v_checkThreadThread1of1ForFork1_#in~param.base_1|, checkThreadThread1of1ForFork1_~param.base=v_checkThreadThread1of1ForFork1_~param.base_1, checkThreadThread1of1ForFork1_#in~param.offset=|v_checkThreadThread1of1ForFork1_#in~param.offset_1|, checkThreadThread1of1ForFork1_~param.offset=v_checkThreadThread1of1ForFork1_~param.offset_1} AuxVars[] AssignedVars[checkThreadThread1of1ForFork1_~param.base, checkThreadThread1of1ForFork1_~param.offset] {1729#false} is VALID [2022-02-20 21:00:30,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {1729#false} [224] L695-->L696: Formula: (and (or (not (= v_~a~0_3 1)) (not (= (- 1) v_~b~0_3))) (or (not (= v_~b~0_3 0)) (not (= v_~a~0_3 0)))) InVars {~a~0=v_~a~0_3, ~b~0=v_~b~0_3} OutVars{~a~0=v_~a~0_3, ~b~0=v_~b~0_3} AuxVars[] AssignedVars[] {1729#false} is VALID [2022-02-20 21:00:30,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {1729#false} [226] L696-->checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1729#false} is VALID [2022-02-20 21:00:30,387 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 21:00:30,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:00:30,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787727813] [2022-02-20 21:00:30,387 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787727813] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:00:30,388 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:00:30,388 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:00:30,388 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102632085] [2022-02-20 21:00:30,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:00:30,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 32 [2022-02-20 21:00:30,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:00:30,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 21:00:30,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:00:30,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:00:30,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:00:30,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:00:30,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:00:30,413 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 91 [2022-02-20 21:00:30,413 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 83 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 21:00:30,413 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 21:00:30,413 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 91 [2022-02-20 21:00:30,413 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 21:00:30,493 INFO L129 PetriNetUnfolder]: 0/80 cut-off events. [2022-02-20 21:00:30,493 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 21:00:30,493 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 80 events. 0/80 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 0. Up to 19 conditions per place. [2022-02-20 21:00:30,493 INFO L132 encePairwiseOnDemand]: 80/91 looper letters, 24 selfloop transitions, 7 changer transitions 0/76 dead transitions. [2022-02-20 21:00:30,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 76 transitions, 227 flow [2022-02-20 21:00:30,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:00:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 21:00:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2022-02-20 21:00:30,506 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7216117216117216 [2022-02-20 21:00:30,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 197 transitions. [2022-02-20 21:00:30,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 197 transitions. [2022-02-20 21:00:30,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 21:00:30,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 197 transitions. [2022-02-20 21:00:30,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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 21:00:30,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 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 21:00:30,518 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 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 21:00:30,519 INFO L186 Difference]: Start difference. First operand has 87 places, 83 transitions, 182 flow. Second operand 3 states and 197 transitions. [2022-02-20 21:00:30,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 76 transitions, 227 flow [2022-02-20 21:00:30,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 76 transitions, 227 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 21:00:30,524 INFO L242 Difference]: Finished difference. Result has 78 places, 70 transitions, 180 flow [2022-02-20 21:00:30,526 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=78, PETRI_TRANSITIONS=70} [2022-02-20 21:00:30,528 INFO L334 CegarLoopForPetriNet]: 87 programPoint places, -9 predicate places. [2022-02-20 21:00:30,528 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 70 transitions, 180 flow [2022-02-20 21:00:30,543 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 836 states, 829 states have (on average 2.424607961399276) internal successors, (2010), 835 states have internal predecessors, (2010), 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 21:00:30,545 INFO L78 Accepts]: Start accepts. Automaton has has 836 states, 829 states have (on average 2.424607961399276) internal successors, (2010), 835 states have internal predecessors, (2010), 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 32 [2022-02-20 21:00:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:00:30,546 INFO L470 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 180 flow [2022-02-20 21:00:30,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 21:00:30,546 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 21:00:30,547 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 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 21:00:30,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:00:30,547 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATION === [checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:00:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:00:30,548 INFO L85 PathProgramCache]: Analyzing trace with hash -121871665, now seen corresponding path program 1 times [2022-02-20 21:00:30,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:00:30,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599688658] [2022-02-20 21:00:30,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:00:30,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:00:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 21:00:30,609 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 21:00:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 21:00:30,650 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 21:00:30,651 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 21:00:30,651 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 4 remaining) [2022-02-20 21:00:30,653 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-02-20 21:00:30,653 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 4 remaining) [2022-02-20 21:00:30,654 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-02-20 21:00:30,654 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:00:30,657 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 21:00:30,658 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 21:00:30,658 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-02-20 21:00:30,693 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of2ForFork0_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,693 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of2ForFork0_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,693 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of2ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,693 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of2ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,693 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of2ForFork0_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,694 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of2ForFork0_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,695 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of2ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,695 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of2ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,695 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,695 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,695 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,696 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,696 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of2ForFork0_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,696 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of2ForFork0_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,696 WARN L322 ript$VariableManager]: TermVariabe setThreadThread2of2ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,696 WARN L322 ript$VariableManager]: TermVariabe setThreadThread2of2ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,696 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of2ForFork0_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,697 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of2ForFork0_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,697 WARN L322 ript$VariableManager]: TermVariabe setThreadThread2of2ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,697 WARN L322 ript$VariableManager]: TermVariabe setThreadThread2of2ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,697 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,697 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,697 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,698 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,698 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of2ForFork1_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,698 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of2ForFork1_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,698 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of2ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,698 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of2ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,699 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of2ForFork1_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,699 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of2ForFork1_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,699 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of2ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,699 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of2ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,699 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,700 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,700 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,700 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,700 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of2ForFork1_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,700 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of2ForFork1_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,700 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread2of2ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,701 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread2of2ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,701 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of2ForFork1_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,701 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of2ForFork1_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,701 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread2of2ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,701 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread2of2ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,702 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,702 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,702 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,702 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,703 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of2ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,703 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,703 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of2ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,704 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,704 WARN L322 ript$VariableManager]: TermVariabe setThreadThread2of2ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,704 WARN L322 ript$VariableManager]: TermVariabe setThreadThread2of2ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,704 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,704 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,705 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,705 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of2ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,705 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of2ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,706 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,707 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of2ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,707 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread2of2ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,707 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of2ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,707 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread2of2ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:00:30,731 INFO L148 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2022-02-20 21:00:30,737 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:00:30,741 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 21:00:30,741 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-02-20 21:00:30,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 110 transitions, 268 flow [2022-02-20 21:00:30,809 INFO L129 PetriNetUnfolder]: 107/656 cut-off events. [2022-02-20 21:00:30,809 INFO L130 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-02-20 21:00:30,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 656 events. 107/656 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3171 event pairs, 2 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 395. Up to 32 conditions per place. [2022-02-20 21:00:30,813 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 110 transitions, 268 flow [2022-02-20 21:00:30,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 110 transitions, 268 flow [2022-02-20 21:00:30,819 INFO L129 PetriNetUnfolder]: 5/65 cut-off events. [2022-02-20 21:00:30,819 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 21:00:30,819 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 21:00:30,820 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] [2022-02-20 21:00:30,820 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 21:00:30,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:00:30,820 INFO L85 PathProgramCache]: Analyzing trace with hash -341074863, now seen corresponding path program 1 times [2022-02-20 21:00:30,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:00:30,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978053059] [2022-02-20 21:00:30,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:00:30,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:00:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:00:30,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#true} [307] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 21:00:30,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {108#true} [289] 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] {108#true} is VALID [2022-02-20 21:00:30,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {108#true} [316] 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[] {108#true} is VALID [2022-02-20 21:00:30,881 INFO L290 TraceCheckUtils]: 3: Hoare triple {108#true} [317] L-1-2-->L680: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 21:00:30,882 INFO L290 TraceCheckUtils]: 4: Hoare triple {108#true} [312] L680-->L680-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[] {108#true} is VALID [2022-02-20 21:00:30,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {108#true} [271] L680-1-->L680-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[] {108#true} is VALID [2022-02-20 21:00:30,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {108#true} [315] L680-2-->L680-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[] {108#true} is VALID [2022-02-20 21:00:30,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {108#true} [286] L680-3-->L680-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 21:00:30,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {108#true} [305] L680-4-->L680-5: Formula: (= (select (select |v_#memory_int_3| 2) 0) 0) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 21:00:30,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {108#true} [269] L680-5-->L683: Formula: (= v_~a~0_4 0) InVars {} OutVars{~a~0=v_~a~0_4} AuxVars[] AssignedVars[~a~0] {108#true} is VALID [2022-02-20 21:00:30,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {108#true} [253] L683-->L684: Formula: (= v_~b~0_4 0) InVars {} OutVars{~b~0=v_~b~0_4} AuxVars[] AssignedVars[~b~0] {108#true} is VALID [2022-02-20 21:00:30,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {108#true} [239] L684-->L-1-3: Formula: (= v_~i~0_1 0) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {108#true} is VALID [2022-02-20 21:00:30,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {108#true} [319] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 21:00:30,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {108#true} [295] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {108#true} is VALID [2022-02-20 21:00:30,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {108#true} [258] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {108#true} is VALID [2022-02-20 21:00:30,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {108#true} [293] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {108#true} is VALID [2022-02-20 21:00:30,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {108#true} [256] L-1-7-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_1|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#setPool~0#1.base, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre2#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~#checkPool~0#1.offset, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1, ULTIMATE.start_main_~#setPool~0#1.offset, ULTIMATE.start_main_~#checkPool~0#1.base] {108#true} is VALID [2022-02-20 21:00:30,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {108#true} [292] L699-->L699-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {108#true} is VALID [2022-02-20 21:00:30,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {108#true} [261] L699-1-->L700: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {108#true} is VALID [2022-02-20 21:00:30,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {108#true} [318] L700-->L700-1: Formula: (and (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 120)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#setPool~0#1.offset_2| 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 0))) 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_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_2|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#setPool~0#1.base, #valid, #length, ULTIMATE.start_main_~#setPool~0#1.offset] {108#true} is VALID [2022-02-20 21:00:30,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {108#true} [321] L700-1-->L701: Formula: (and (= |v_ULTIMATE.start_main_~#checkPool~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 1)) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, #valid=|v_#valid_6|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#checkPool~0#1.offset, #valid, #length, ULTIMATE.start_main_~#checkPool~0#1.base] {108#true} is VALID [2022-02-20 21:00:30,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {108#true} [310] L701-->L702-5: Formula: (= v_~i~0_2 0) InVars {} OutVars{~i~0=v_~i~0_2} AuxVars[] AssignedVars[~i~0] {108#true} is VALID [2022-02-20 21:00:30,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {108#true} [247] L702-5-->L702-6: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {109#false} is VALID [2022-02-20 21:00:30,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {109#false} [323] L702-6-->L704-5: Formula: (= v_~i~0_8 0) InVars {} OutVars{~i~0=v_~i~0_8} AuxVars[] AssignedVars[~i~0] {109#false} is VALID [2022-02-20 21:00:30,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {109#false} [280] L704-5-->L705: Formula: (< v_~i~0_10 1) InVars {~i~0=v_~i~0_10} OutVars{~i~0=v_~i~0_10} AuxVars[] AssignedVars[] {109#false} is VALID [2022-02-20 21:00:30,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {109#false} [287] L705-->L705-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {109#false} is VALID [2022-02-20 21:00:30,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {109#false} [314] L705-1-->L705-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {109#false} is VALID [2022-02-20 21:00:30,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {109#false} [309] L705-2-->L705-3: Formula: (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#checkPool~0#1.offset_3| (* v_~i~0_11 4)) |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_6|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_3|, ~i~0=v_~i~0_11, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_3|, ~i~0=v_~i~0_11, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {109#false} is VALID [2022-02-20 21:00:30,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {109#false} [355] L705-3-->checkThreadENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre5#1_8| v_checkThreadThread1of2ForFork1_thidvar0_2) (= |v_checkThreadThread1of2ForFork1_#in~param.offset_4| 0) (= |v_checkThreadThread1of2ForFork1_#in~param.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_8|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_8|, checkThreadThread1of2ForFork1_#res.offset=|v_checkThreadThread1of2ForFork1_#res.offset_4|, checkThreadThread1of2ForFork1_~param.base=v_checkThreadThread1of2ForFork1_~param.base_4, checkThreadThread1of2ForFork1_~param.offset=v_checkThreadThread1of2ForFork1_~param.offset_4, checkThreadThread1of2ForFork1_thidvar0=v_checkThreadThread1of2ForFork1_thidvar0_2, checkThreadThread1of2ForFork1_#in~param.offset=|v_checkThreadThread1of2ForFork1_#in~param.offset_4|, checkThreadThread1of2ForFork1_#res.base=|v_checkThreadThread1of2ForFork1_#res.base_4|, checkThreadThread1of2ForFork1_#in~param.base=|v_checkThreadThread1of2ForFork1_#in~param.base_4|} AuxVars[] AssignedVars[checkThreadThread1of2ForFork1_#res.offset, checkThreadThread1of2ForFork1_~param.base, checkThreadThread1of2ForFork1_~param.offset, checkThreadThread1of2ForFork1_thidvar0, checkThreadThread1of2ForFork1_#in~param.offset, checkThreadThread1of2ForFork1_#res.base, checkThreadThread1of2ForFork1_#in~param.base] {109#false} is VALID [2022-02-20 21:00:30,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {109#false} [335] checkThreadENTRY-->L695: Formula: (and (= v_checkThreadThread1of2ForFork1_~param.offset_1 |v_checkThreadThread1of2ForFork1_#in~param.offset_1|) (= v_checkThreadThread1of2ForFork1_~param.base_1 |v_checkThreadThread1of2ForFork1_#in~param.base_1|)) InVars {checkThreadThread1of2ForFork1_#in~param.offset=|v_checkThreadThread1of2ForFork1_#in~param.offset_1|, checkThreadThread1of2ForFork1_#in~param.base=|v_checkThreadThread1of2ForFork1_#in~param.base_1|} OutVars{checkThreadThread1of2ForFork1_#in~param.offset=|v_checkThreadThread1of2ForFork1_#in~param.offset_1|, checkThreadThread1of2ForFork1_~param.base=v_checkThreadThread1of2ForFork1_~param.base_1, checkThreadThread1of2ForFork1_~param.offset=v_checkThreadThread1of2ForFork1_~param.offset_1, checkThreadThread1of2ForFork1_#in~param.base=|v_checkThreadThread1of2ForFork1_#in~param.base_1|} AuxVars[] AssignedVars[checkThreadThread1of2ForFork1_~param.base, checkThreadThread1of2ForFork1_~param.offset] {109#false} is VALID [2022-02-20 21:00:30,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {109#false} [337] L695-->L696: Formula: (and (or (not (= v_~a~0_3 1)) (not (= (- 1) v_~b~0_3))) (or (not (= v_~b~0_3 0)) (not (= v_~a~0_3 0)))) InVars {~a~0=v_~a~0_3, ~b~0=v_~b~0_3} OutVars{~a~0=v_~a~0_3, ~b~0=v_~b~0_3} AuxVars[] AssignedVars[] {109#false} is VALID [2022-02-20 21:00:30,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {109#false} [339] L696-->checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {109#false} is VALID [2022-02-20 21:00:30,890 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 21:00:30,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:00:30,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978053059] [2022-02-20 21:00:30,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978053059] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:00:30,891 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:00:30,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 21:00:30,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839483617] [2022-02-20 21:00:30,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:00:30,892 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 32 [2022-02-20 21:00:30,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:00:30,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 21:00:30,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:00:30,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 21:00:30,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:00:30,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 21:00:30,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 21:00:30,915 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 110 [2022-02-20 21:00:30,915 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 110 transitions, 268 flow. Second operand has 2 states, 2 states have (on average 91.0) internal successors, (182), 2 states have internal predecessors, (182), 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 21:00:30,915 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 21:00:30,915 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 110 [2022-02-20 21:00:30,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 21:00:30,982 INFO L129 PetriNetUnfolder]: 57/600 cut-off events. [2022-02-20 21:00:30,982 INFO L130 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2022-02-20 21:00:30,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 600 events. 57/600 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3072 event pairs, 1 based on Foata normal form. 81/631 useless extension candidates. Maximal degree in co-relation 392. Up to 73 conditions per place. [2022-02-20 21:00:30,985 INFO L132 encePairwiseOnDemand]: 104/110 looper letters, 12 selfloop transitions, 0 changer transitions 0/102 dead transitions. [2022-02-20 21:00:30,985 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 102 transitions, 276 flow [2022-02-20 21:00:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 21:00:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-02-20 21:00:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 198 transitions. [2022-02-20 21:00:30,990 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9 [2022-02-20 21:00:30,990 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 198 transitions. [2022-02-20 21:00:30,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 198 transitions. [2022-02-20 21:00:30,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 21:00:30,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 198 transitions. [2022-02-20 21:00:30,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 99.0) internal successors, (198), 2 states have internal predecessors, (198), 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 21:00:30,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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 21:00:30,992 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 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 21:00:30,992 INFO L186 Difference]: Start difference. First operand has 105 places, 110 transitions, 268 flow. Second operand 2 states and 198 transitions. [2022-02-20 21:00:30,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 102 transitions, 276 flow [2022-02-20 21:00:30,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 102 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 21:00:31,000 INFO L242 Difference]: Finished difference. Result has 104 places, 102 transitions, 252 flow [2022-02-20 21:00:31,000 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=252, PETRI_PLACES=104, PETRI_TRANSITIONS=102} [2022-02-20 21:00:31,001 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, -1 predicate places. [2022-02-20 21:00:31,002 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 102 transitions, 252 flow [2022-02-20 21:00:32,925 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 87395 states, 87338 states have (on average 3.9165311777233276) internal successors, (342062), 87394 states have internal predecessors, (342062), 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 21:00:33,111 INFO L78 Accepts]: Start accepts. Automaton has has 87395 states, 87338 states have (on average 3.9165311777233276) internal successors, (342062), 87394 states have internal predecessors, (342062), 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 32 [2022-02-20 21:00:33,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:00:33,111 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 102 transitions, 252 flow [2022-02-20 21:00:33,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 91.0) internal successors, (182), 2 states have internal predecessors, (182), 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 21:00:33,112 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 21:00:33,112 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] [2022-02-20 21:00:33,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:00:33,112 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 21:00:33,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:00:33,113 INFO L85 PathProgramCache]: Analyzing trace with hash -537588368, now seen corresponding path program 1 times [2022-02-20 21:00:33,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:00:33,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552796240] [2022-02-20 21:00:33,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:00:33,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:00:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:00:33,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {87507#true} [307] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87507#true} is VALID [2022-02-20 21:00:33,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {87507#true} [289] 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] {87507#true} is VALID [2022-02-20 21:00:33,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {87507#true} [316] 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[] {87507#true} is VALID [2022-02-20 21:00:33,142 INFO L290 TraceCheckUtils]: 3: Hoare triple {87507#true} [317] L-1-2-->L680: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {87507#true} is VALID [2022-02-20 21:00:33,143 INFO L290 TraceCheckUtils]: 4: Hoare triple {87507#true} [312] L680-->L680-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[] {87507#true} is VALID [2022-02-20 21:00:33,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {87507#true} [271] L680-1-->L680-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[] {87507#true} is VALID [2022-02-20 21:00:33,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {87507#true} [315] L680-2-->L680-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[] {87507#true} is VALID [2022-02-20 21:00:33,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {87507#true} [286] L680-3-->L680-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {87507#true} is VALID [2022-02-20 21:00:33,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {87507#true} [305] L680-4-->L680-5: Formula: (= (select (select |v_#memory_int_3| 2) 0) 0) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] {87507#true} is VALID [2022-02-20 21:00:33,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {87507#true} [269] L680-5-->L683: Formula: (= v_~a~0_4 0) InVars {} OutVars{~a~0=v_~a~0_4} AuxVars[] AssignedVars[~a~0] {87507#true} is VALID [2022-02-20 21:00:33,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {87507#true} [253] L683-->L684: Formula: (= v_~b~0_4 0) InVars {} OutVars{~b~0=v_~b~0_4} AuxVars[] AssignedVars[~b~0] {87507#true} is VALID [2022-02-20 21:00:33,144 INFO L290 TraceCheckUtils]: 11: Hoare triple {87507#true} [239] L684-->L-1-3: Formula: (= v_~i~0_1 0) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {87507#true} is VALID [2022-02-20 21:00:33,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {87507#true} [319] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87507#true} is VALID [2022-02-20 21:00:33,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {87507#true} [295] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87507#true} is VALID [2022-02-20 21:00:33,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {87507#true} [258] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {87507#true} is VALID [2022-02-20 21:00:33,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {87507#true} [293] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {87507#true} is VALID [2022-02-20 21:00:33,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {87507#true} [256] L-1-7-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_1|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#setPool~0#1.base, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre2#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~#checkPool~0#1.offset, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1, ULTIMATE.start_main_~#setPool~0#1.offset, ULTIMATE.start_main_~#checkPool~0#1.base] {87507#true} is VALID [2022-02-20 21:00:33,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {87507#true} [292] L699-->L699-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {87507#true} is VALID [2022-02-20 21:00:33,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {87507#true} [261] L699-1-->L700: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {87507#true} is VALID [2022-02-20 21:00:33,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {87507#true} [318] L700-->L700-1: Formula: (and (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 120)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#setPool~0#1.offset_2| 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 0))) 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_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_2|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#setPool~0#1.base, #valid, #length, ULTIMATE.start_main_~#setPool~0#1.offset] {87507#true} is VALID [2022-02-20 21:00:33,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {87507#true} [321] L700-1-->L701: Formula: (and (= |v_ULTIMATE.start_main_~#checkPool~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 1)) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, #valid=|v_#valid_6|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#checkPool~0#1.offset, #valid, #length, ULTIMATE.start_main_~#checkPool~0#1.base] {87507#true} is VALID [2022-02-20 21:00:33,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {87507#true} [310] L701-->L702-5: Formula: (= v_~i~0_2 0) InVars {} OutVars{~i~0=v_~i~0_2} AuxVars[] AssignedVars[~i~0] {87509#(= ~i~0 0)} is VALID [2022-02-20 21:00:33,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {87509#(= ~i~0 0)} [248] L702-5-->L702-6: Formula: (not (< v_~i~0_3 30)) InVars {~i~0=v_~i~0_3} OutVars{~i~0=v_~i~0_3} AuxVars[] AssignedVars[] {87508#false} is VALID [2022-02-20 21:00:33,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {87508#false} [323] L702-6-->L704-5: Formula: (= v_~i~0_8 0) InVars {} OutVars{~i~0=v_~i~0_8} AuxVars[] AssignedVars[~i~0] {87508#false} is VALID [2022-02-20 21:00:33,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {87508#false} [280] L704-5-->L705: Formula: (< v_~i~0_10 1) InVars {~i~0=v_~i~0_10} OutVars{~i~0=v_~i~0_10} AuxVars[] AssignedVars[] {87508#false} is VALID [2022-02-20 21:00:33,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {87508#false} [287] L705-->L705-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {87508#false} is VALID [2022-02-20 21:00:33,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {87508#false} [314] L705-1-->L705-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {87508#false} is VALID [2022-02-20 21:00:33,148 INFO L290 TraceCheckUtils]: 27: Hoare triple {87508#false} [309] L705-2-->L705-3: Formula: (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#checkPool~0#1.offset_3| (* v_~i~0_11 4)) |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_6|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_3|, ~i~0=v_~i~0_11, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_3|, ~i~0=v_~i~0_11, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {87508#false} is VALID [2022-02-20 21:00:33,148 INFO L290 TraceCheckUtils]: 28: Hoare triple {87508#false} [355] L705-3-->checkThreadENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre5#1_8| v_checkThreadThread1of2ForFork1_thidvar0_2) (= |v_checkThreadThread1of2ForFork1_#in~param.offset_4| 0) (= |v_checkThreadThread1of2ForFork1_#in~param.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_8|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_8|, checkThreadThread1of2ForFork1_#res.offset=|v_checkThreadThread1of2ForFork1_#res.offset_4|, checkThreadThread1of2ForFork1_~param.base=v_checkThreadThread1of2ForFork1_~param.base_4, checkThreadThread1of2ForFork1_~param.offset=v_checkThreadThread1of2ForFork1_~param.offset_4, checkThreadThread1of2ForFork1_thidvar0=v_checkThreadThread1of2ForFork1_thidvar0_2, checkThreadThread1of2ForFork1_#in~param.offset=|v_checkThreadThread1of2ForFork1_#in~param.offset_4|, checkThreadThread1of2ForFork1_#res.base=|v_checkThreadThread1of2ForFork1_#res.base_4|, checkThreadThread1of2ForFork1_#in~param.base=|v_checkThreadThread1of2ForFork1_#in~param.base_4|} AuxVars[] AssignedVars[checkThreadThread1of2ForFork1_#res.offset, checkThreadThread1of2ForFork1_~param.base, checkThreadThread1of2ForFork1_~param.offset, checkThreadThread1of2ForFork1_thidvar0, checkThreadThread1of2ForFork1_#in~param.offset, checkThreadThread1of2ForFork1_#res.base, checkThreadThread1of2ForFork1_#in~param.base] {87508#false} is VALID [2022-02-20 21:00:33,148 INFO L290 TraceCheckUtils]: 29: Hoare triple {87508#false} [335] checkThreadENTRY-->L695: Formula: (and (= v_checkThreadThread1of2ForFork1_~param.offset_1 |v_checkThreadThread1of2ForFork1_#in~param.offset_1|) (= v_checkThreadThread1of2ForFork1_~param.base_1 |v_checkThreadThread1of2ForFork1_#in~param.base_1|)) InVars {checkThreadThread1of2ForFork1_#in~param.offset=|v_checkThreadThread1of2ForFork1_#in~param.offset_1|, checkThreadThread1of2ForFork1_#in~param.base=|v_checkThreadThread1of2ForFork1_#in~param.base_1|} OutVars{checkThreadThread1of2ForFork1_#in~param.offset=|v_checkThreadThread1of2ForFork1_#in~param.offset_1|, checkThreadThread1of2ForFork1_~param.base=v_checkThreadThread1of2ForFork1_~param.base_1, checkThreadThread1of2ForFork1_~param.offset=v_checkThreadThread1of2ForFork1_~param.offset_1, checkThreadThread1of2ForFork1_#in~param.base=|v_checkThreadThread1of2ForFork1_#in~param.base_1|} AuxVars[] AssignedVars[checkThreadThread1of2ForFork1_~param.base, checkThreadThread1of2ForFork1_~param.offset] {87508#false} is VALID [2022-02-20 21:00:33,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {87508#false} [337] L695-->L696: Formula: (and (or (not (= v_~a~0_3 1)) (not (= (- 1) v_~b~0_3))) (or (not (= v_~b~0_3 0)) (not (= v_~a~0_3 0)))) InVars {~a~0=v_~a~0_3, ~b~0=v_~b~0_3} OutVars{~a~0=v_~a~0_3, ~b~0=v_~b~0_3} AuxVars[] AssignedVars[] {87508#false} is VALID [2022-02-20 21:00:33,149 INFO L290 TraceCheckUtils]: 31: Hoare triple {87508#false} [339] L696-->checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {87508#false} is VALID [2022-02-20 21:00:33,149 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 21:00:33,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:00:33,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552796240] [2022-02-20 21:00:33,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552796240] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:00:33,150 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:00:33,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:00:33,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597389702] [2022-02-20 21:00:33,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:00:33,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 32 [2022-02-20 21:00:33,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:00:33,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 21:00:33,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:00:33,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:00:33,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:00:33,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:00:33,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:00:33,170 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 110 [2022-02-20 21:00:33,170 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 102 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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 21:00:33,171 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 21:00:33,171 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 110 [2022-02-20 21:00:33,171 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 21:00:33,554 INFO L129 PetriNetUnfolder]: 58/575 cut-off events. [2022-02-20 21:00:33,554 INFO L130 PetriNetUnfolder]: For 90/90 co-relation queries the response was YES. [2022-02-20 21:00:33,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 575 events. 58/575 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2900 event pairs, 0 based on Foata normal form. 0/539 useless extension candidates. Maximal degree in co-relation 1021. Up to 207 conditions per place. [2022-02-20 21:00:33,557 INFO L132 encePairwiseOnDemand]: 98/110 looper letters, 53 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2022-02-20 21:00:33,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 126 transitions, 446 flow [2022-02-20 21:00:33,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:00:33,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 21:00:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2022-02-20 21:00:33,561 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2022-02-20 21:00:33,562 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 260 transitions. [2022-02-20 21:00:33,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 260 transitions. [2022-02-20 21:00:33,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 21:00:33,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 260 transitions. [2022-02-20 21:00:33,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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 21:00:33,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 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 21:00:33,575 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 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 21:00:33,576 INFO L186 Difference]: Start difference. First operand has 104 places, 102 transitions, 252 flow. Second operand 3 states and 260 transitions. [2022-02-20 21:00:33,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 126 transitions, 446 flow [2022-02-20 21:01:17,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 126 transitions, 446 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 21:01:17,738 INFO L242 Difference]: Finished difference. Result has 107 places, 106 transitions, 300 flow [2022-02-20 21:01:17,738 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=107, PETRI_TRANSITIONS=106} [2022-02-20 21:01:17,738 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, 2 predicate places. [2022-02-20 21:01:17,738 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 106 transitions, 300 flow [2022-02-20 21:01:18,825 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 55766 states, 55725 states have (on average 3.7633198743831313) internal successors, (209711), 55765 states have internal predecessors, (209711), 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 21:01:18,953 INFO L78 Accepts]: Start accepts. Automaton has has 55766 states, 55725 states have (on average 3.7633198743831313) internal successors, (209711), 55765 states have internal predecessors, (209711), 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 32 [2022-02-20 21:01:18,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:01:18,953 INFO L470 AbstractCegarLoop]: Abstraction has has 107 places, 106 transitions, 300 flow [2022-02-20 21:01:18,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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 21:01:18,953 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 21:01:18,954 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 21:01:18,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 21:01:18,954 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 21:01:18,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:01:18,954 INFO L85 PathProgramCache]: Analyzing trace with hash 853052668, now seen corresponding path program 1 times [2022-02-20 21:01:18,955 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:01:18,955 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841544761] [2022-02-20 21:01:18,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:01:18,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:01:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:01:19,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {143279#true} [307] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {143279#true} [289] 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] {143279#true} is VALID [2022-02-20 21:01:19,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {143279#true} [316] 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[] {143279#true} is VALID [2022-02-20 21:01:19,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {143279#true} [317] L-1-2-->L680: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {143279#true} [312] L680-->L680-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[] {143279#true} is VALID [2022-02-20 21:01:19,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {143279#true} [271] L680-1-->L680-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[] {143279#true} is VALID [2022-02-20 21:01:19,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {143279#true} [315] L680-2-->L680-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[] {143279#true} is VALID [2022-02-20 21:01:19,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {143279#true} [286] L680-3-->L680-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {143279#true} [305] L680-4-->L680-5: Formula: (= (select (select |v_#memory_int_3| 2) 0) 0) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {143279#true} [269] L680-5-->L683: Formula: (= v_~a~0_4 0) InVars {} OutVars{~a~0=v_~a~0_4} AuxVars[] AssignedVars[~a~0] {143279#true} is VALID [2022-02-20 21:01:19,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {143279#true} [253] L683-->L684: Formula: (= v_~b~0_4 0) InVars {} OutVars{~b~0=v_~b~0_4} AuxVars[] AssignedVars[~b~0] {143279#true} is VALID [2022-02-20 21:01:19,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {143279#true} [239] L684-->L-1-3: Formula: (= v_~i~0_1 0) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {143279#true} is VALID [2022-02-20 21:01:19,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {143279#true} [319] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {143279#true} [295] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {143279#true} [258] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {143279#true} is VALID [2022-02-20 21:01:19,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {143279#true} [293] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {143279#true} is VALID [2022-02-20 21:01:19,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {143279#true} [256] L-1-7-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_1|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#setPool~0#1.base, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre2#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~#checkPool~0#1.offset, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1, ULTIMATE.start_main_~#setPool~0#1.offset, ULTIMATE.start_main_~#checkPool~0#1.base] {143279#true} is VALID [2022-02-20 21:01:19,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {143279#true} [292] L699-->L699-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {143279#true} is VALID [2022-02-20 21:01:19,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {143279#true} [261] L699-1-->L700: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {143279#true} is VALID [2022-02-20 21:01:19,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {143279#true} [318] L700-->L700-1: Formula: (and (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 120)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#setPool~0#1.offset_2| 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 0))) 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_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_2|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#setPool~0#1.base, #valid, #length, ULTIMATE.start_main_~#setPool~0#1.offset] {143279#true} is VALID [2022-02-20 21:01:19,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {143279#true} [321] L700-1-->L701: Formula: (and (= |v_ULTIMATE.start_main_~#checkPool~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 1)) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, #valid=|v_#valid_6|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#checkPool~0#1.offset, #valid, #length, ULTIMATE.start_main_~#checkPool~0#1.base] {143279#true} is VALID [2022-02-20 21:01:19,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {143279#true} [310] L701-->L702-5: Formula: (= v_~i~0_2 0) InVars {} OutVars{~i~0=v_~i~0_2} AuxVars[] AssignedVars[~i~0] {143281#(= ~i~0 0)} is VALID [2022-02-20 21:01:19,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {143281#(= ~i~0 0)} [249] L702-5-->L703: Formula: (< v_~i~0_4 30) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4} AuxVars[] AssignedVars[] {143281#(= ~i~0 0)} is VALID [2022-02-20 21:01:19,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {143281#(= ~i~0 0)} [252] L703-->L703-1: Formula: (= |v_ULTIMATE.start_main_#t~pre2#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {143281#(= ~i~0 0)} is VALID [2022-02-20 21:01:19,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {143281#(= ~i~0 0)} [302] L703-1-->L703-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {143281#(= ~i~0 0)} is VALID [2022-02-20 21:01:19,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {143281#(= ~i~0 0)} [276] L703-2-->L703-3: Formula: (= (store |v_#memory_int_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#setPool~0#1.offset_3| (* 4 v_~i~0_5)) |v_ULTIMATE.start_main_#t~pre2#1_3|)) |v_#memory_int_4|) InVars {#memory_int=|v_#memory_int_5|, ~i~0=v_~i~0_5, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_3|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} OutVars{#memory_int=|v_#memory_int_4|, ~i~0=v_~i~0_5, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_3|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} AuxVars[] AssignedVars[#memory_int] {143281#(= ~i~0 0)} is VALID [2022-02-20 21:01:19,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {143281#(= ~i~0 0)} [352] L703-3-->setThreadENTRY: Formula: (and (= 0 |v_setThreadThread1of2ForFork0_#in~param.base_4|) (= |v_ULTIMATE.start_main_#t~pre2#1_8| v_setThreadThread1of2ForFork0_thidvar0_2) (= 0 |v_setThreadThread1of2ForFork0_#in~param.offset_4|)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_8|} OutVars{setThreadThread1of2ForFork0_~param.offset=v_setThreadThread1of2ForFork0_~param.offset_4, setThreadThread1of2ForFork0_#in~param.base=|v_setThreadThread1of2ForFork0_#in~param.base_4|, setThreadThread1of2ForFork0_#res.base=|v_setThreadThread1of2ForFork0_#res.base_4|, setThreadThread1of2ForFork0_#in~param.offset=|v_setThreadThread1of2ForFork0_#in~param.offset_4|, setThreadThread1of2ForFork0_~param.base=v_setThreadThread1of2ForFork0_~param.base_4, setThreadThread1of2ForFork0_thidvar0=v_setThreadThread1of2ForFork0_thidvar0_2, setThreadThread1of2ForFork0_#res.offset=|v_setThreadThread1of2ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_8|} AuxVars[] AssignedVars[setThreadThread1of2ForFork0_~param.offset, setThreadThread1of2ForFork0_#in~param.base, setThreadThread1of2ForFork0_#res.base, setThreadThread1of2ForFork0_#in~param.offset, setThreadThread1of2ForFork0_~param.base, setThreadThread1of2ForFork0_thidvar0, setThreadThread1of2ForFork0_#res.offset] {143281#(= ~i~0 0)} is VALID [2022-02-20 21:01:19,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {143281#(= ~i~0 0)} [296] L703-4-->L703-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {143281#(= ~i~0 0)} is VALID [2022-02-20 21:01:19,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {143281#(= ~i~0 0)} [275] L703-5-->L702-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {143281#(= ~i~0 0)} is VALID [2022-02-20 21:01:19,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {143281#(= ~i~0 0)} [291] L702-2-->L702-3: Formula: (= |v_ULTIMATE.start_main_#t~post1#1_2| v_~i~0_6) InVars {~i~0=v_~i~0_6} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_2|, ~i~0=v_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1#1] {143282#(= |ULTIMATE.start_main_#t~post1#1| 0)} is VALID [2022-02-20 21:01:19,041 INFO L290 TraceCheckUtils]: 30: Hoare triple {143282#(= |ULTIMATE.start_main_#t~post1#1| 0)} [265] L702-3-->L702-4: Formula: (= (+ |v_ULTIMATE.start_main_#t~post1#1_3| 1) v_~i~0_7) InVars {ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_3|} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_3|, ~i~0=v_~i~0_7} AuxVars[] AssignedVars[~i~0] {143283#(<= ~i~0 1)} is VALID [2022-02-20 21:01:19,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {143283#(<= ~i~0 1)} [308] L702-4-->L702-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1#1] {143283#(<= ~i~0 1)} is VALID [2022-02-20 21:01:19,042 INFO L290 TraceCheckUtils]: 32: Hoare triple {143283#(<= ~i~0 1)} [248] L702-5-->L702-6: Formula: (not (< v_~i~0_3 30)) InVars {~i~0=v_~i~0_3} OutVars{~i~0=v_~i~0_3} AuxVars[] AssignedVars[] {143280#false} is VALID [2022-02-20 21:01:19,042 INFO L290 TraceCheckUtils]: 33: Hoare triple {143280#false} [323] L702-6-->L704-5: Formula: (= v_~i~0_8 0) InVars {} OutVars{~i~0=v_~i~0_8} AuxVars[] AssignedVars[~i~0] {143280#false} is VALID [2022-02-20 21:01:19,042 INFO L290 TraceCheckUtils]: 34: Hoare triple {143280#false} [280] L704-5-->L705: Formula: (< v_~i~0_10 1) InVars {~i~0=v_~i~0_10} OutVars{~i~0=v_~i~0_10} AuxVars[] AssignedVars[] {143280#false} is VALID [2022-02-20 21:01:19,043 INFO L290 TraceCheckUtils]: 35: Hoare triple {143280#false} [287] L705-->L705-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {143280#false} is VALID [2022-02-20 21:01:19,043 INFO L290 TraceCheckUtils]: 36: Hoare triple {143280#false} [314] L705-1-->L705-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {143280#false} is VALID [2022-02-20 21:01:19,043 INFO L290 TraceCheckUtils]: 37: Hoare triple {143280#false} [309] L705-2-->L705-3: Formula: (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#checkPool~0#1.offset_3| (* v_~i~0_11 4)) |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_6|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_3|, ~i~0=v_~i~0_11, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_3|, ~i~0=v_~i~0_11, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {143280#false} is VALID [2022-02-20 21:01:19,043 INFO L290 TraceCheckUtils]: 38: Hoare triple {143280#false} [355] L705-3-->checkThreadENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre5#1_8| v_checkThreadThread1of2ForFork1_thidvar0_2) (= |v_checkThreadThread1of2ForFork1_#in~param.offset_4| 0) (= |v_checkThreadThread1of2ForFork1_#in~param.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_8|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_8|, checkThreadThread1of2ForFork1_#res.offset=|v_checkThreadThread1of2ForFork1_#res.offset_4|, checkThreadThread1of2ForFork1_~param.base=v_checkThreadThread1of2ForFork1_~param.base_4, checkThreadThread1of2ForFork1_~param.offset=v_checkThreadThread1of2ForFork1_~param.offset_4, checkThreadThread1of2ForFork1_thidvar0=v_checkThreadThread1of2ForFork1_thidvar0_2, checkThreadThread1of2ForFork1_#in~param.offset=|v_checkThreadThread1of2ForFork1_#in~param.offset_4|, checkThreadThread1of2ForFork1_#res.base=|v_checkThreadThread1of2ForFork1_#res.base_4|, checkThreadThread1of2ForFork1_#in~param.base=|v_checkThreadThread1of2ForFork1_#in~param.base_4|} AuxVars[] AssignedVars[checkThreadThread1of2ForFork1_#res.offset, checkThreadThread1of2ForFork1_~param.base, checkThreadThread1of2ForFork1_~param.offset, checkThreadThread1of2ForFork1_thidvar0, checkThreadThread1of2ForFork1_#in~param.offset, checkThreadThread1of2ForFork1_#res.base, checkThreadThread1of2ForFork1_#in~param.base] {143280#false} is VALID [2022-02-20 21:01:19,043 INFO L290 TraceCheckUtils]: 39: Hoare triple {143280#false} [335] checkThreadENTRY-->L695: Formula: (and (= v_checkThreadThread1of2ForFork1_~param.offset_1 |v_checkThreadThread1of2ForFork1_#in~param.offset_1|) (= v_checkThreadThread1of2ForFork1_~param.base_1 |v_checkThreadThread1of2ForFork1_#in~param.base_1|)) InVars {checkThreadThread1of2ForFork1_#in~param.offset=|v_checkThreadThread1of2ForFork1_#in~param.offset_1|, checkThreadThread1of2ForFork1_#in~param.base=|v_checkThreadThread1of2ForFork1_#in~param.base_1|} OutVars{checkThreadThread1of2ForFork1_#in~param.offset=|v_checkThreadThread1of2ForFork1_#in~param.offset_1|, checkThreadThread1of2ForFork1_~param.base=v_checkThreadThread1of2ForFork1_~param.base_1, checkThreadThread1of2ForFork1_~param.offset=v_checkThreadThread1of2ForFork1_~param.offset_1, checkThreadThread1of2ForFork1_#in~param.base=|v_checkThreadThread1of2ForFork1_#in~param.base_1|} AuxVars[] AssignedVars[checkThreadThread1of2ForFork1_~param.base, checkThreadThread1of2ForFork1_~param.offset] {143280#false} is VALID [2022-02-20 21:01:19,043 INFO L290 TraceCheckUtils]: 40: Hoare triple {143280#false} [337] L695-->L696: Formula: (and (or (not (= v_~a~0_3 1)) (not (= (- 1) v_~b~0_3))) (or (not (= v_~b~0_3 0)) (not (= v_~a~0_3 0)))) InVars {~a~0=v_~a~0_3, ~b~0=v_~b~0_3} OutVars{~a~0=v_~a~0_3, ~b~0=v_~b~0_3} AuxVars[] AssignedVars[] {143280#false} is VALID [2022-02-20 21:01:19,044 INFO L290 TraceCheckUtils]: 41: Hoare triple {143280#false} [339] L696-->checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143280#false} is VALID [2022-02-20 21:01:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:01:19,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:01:19,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841544761] [2022-02-20 21:01:19,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841544761] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:01:19,046 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72020540] [2022-02-20 21:01:19,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:01:19,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:01:19,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:01:19,048 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 21:01:19,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 21:01:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:01:19,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 21:01:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:01:19,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:01:19,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {143279#true} [307] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {143279#true} [289] 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] {143279#true} is VALID [2022-02-20 21:01:19,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {143279#true} [316] 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[] {143279#true} is VALID [2022-02-20 21:01:19,344 INFO L290 TraceCheckUtils]: 3: Hoare triple {143279#true} [317] L-1-2-->L680: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,344 INFO L290 TraceCheckUtils]: 4: Hoare triple {143279#true} [312] L680-->L680-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[] {143279#true} is VALID [2022-02-20 21:01:19,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {143279#true} [271] L680-1-->L680-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[] {143279#true} is VALID [2022-02-20 21:01:19,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {143279#true} [315] L680-2-->L680-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[] {143279#true} is VALID [2022-02-20 21:01:19,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {143279#true} [286] L680-3-->L680-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {143279#true} [305] L680-4-->L680-5: Formula: (= (select (select |v_#memory_int_3| 2) 0) 0) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {143279#true} [269] L680-5-->L683: Formula: (= v_~a~0_4 0) InVars {} OutVars{~a~0=v_~a~0_4} AuxVars[] AssignedVars[~a~0] {143279#true} is VALID [2022-02-20 21:01:19,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {143279#true} [253] L683-->L684: Formula: (= v_~b~0_4 0) InVars {} OutVars{~b~0=v_~b~0_4} AuxVars[] AssignedVars[~b~0] {143279#true} is VALID [2022-02-20 21:01:19,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {143279#true} [239] L684-->L-1-3: Formula: (= v_~i~0_1 0) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {143279#true} is VALID [2022-02-20 21:01:19,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {143279#true} [319] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {143279#true} [295] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {143279#true} [258] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {143279#true} is VALID [2022-02-20 21:01:19,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {143279#true} [293] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {143279#true} is VALID [2022-02-20 21:01:19,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {143279#true} [256] L-1-7-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_1|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#setPool~0#1.base, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre2#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~#checkPool~0#1.offset, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1, ULTIMATE.start_main_~#setPool~0#1.offset, ULTIMATE.start_main_~#checkPool~0#1.base] {143279#true} is VALID [2022-02-20 21:01:19,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {143279#true} [292] L699-->L699-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {143279#true} is VALID [2022-02-20 21:01:19,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {143279#true} [261] L699-1-->L700: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {143279#true} is VALID [2022-02-20 21:01:19,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {143279#true} [318] L700-->L700-1: Formula: (and (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 120)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#setPool~0#1.offset_2| 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 0))) 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_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_2|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#setPool~0#1.base, #valid, #length, ULTIMATE.start_main_~#setPool~0#1.offset] {143279#true} is VALID [2022-02-20 21:01:19,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {143279#true} [321] L700-1-->L701: Formula: (and (= |v_ULTIMATE.start_main_~#checkPool~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 1)) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, #valid=|v_#valid_6|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#checkPool~0#1.offset, #valid, #length, ULTIMATE.start_main_~#checkPool~0#1.base] {143279#true} is VALID [2022-02-20 21:01:19,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {143279#true} [310] L701-->L702-5: Formula: (= v_~i~0_2 0) InVars {} OutVars{~i~0=v_~i~0_2} AuxVars[] AssignedVars[~i~0] {143350#(<= ~i~0 0)} is VALID [2022-02-20 21:01:19,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {143350#(<= ~i~0 0)} [249] L702-5-->L703: Formula: (< v_~i~0_4 30) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4} AuxVars[] AssignedVars[] {143350#(<= ~i~0 0)} is VALID [2022-02-20 21:01:19,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {143350#(<= ~i~0 0)} [252] L703-->L703-1: Formula: (= |v_ULTIMATE.start_main_#t~pre2#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {143350#(<= ~i~0 0)} is VALID [2022-02-20 21:01:19,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {143350#(<= ~i~0 0)} [302] L703-1-->L703-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {143350#(<= ~i~0 0)} is VALID [2022-02-20 21:01:19,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {143350#(<= ~i~0 0)} [276] L703-2-->L703-3: Formula: (= (store |v_#memory_int_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#setPool~0#1.offset_3| (* 4 v_~i~0_5)) |v_ULTIMATE.start_main_#t~pre2#1_3|)) |v_#memory_int_4|) InVars {#memory_int=|v_#memory_int_5|, ~i~0=v_~i~0_5, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_3|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} OutVars{#memory_int=|v_#memory_int_4|, ~i~0=v_~i~0_5, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_3|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} AuxVars[] AssignedVars[#memory_int] {143350#(<= ~i~0 0)} is VALID [2022-02-20 21:01:19,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {143350#(<= ~i~0 0)} [352] L703-3-->setThreadENTRY: Formula: (and (= 0 |v_setThreadThread1of2ForFork0_#in~param.base_4|) (= |v_ULTIMATE.start_main_#t~pre2#1_8| v_setThreadThread1of2ForFork0_thidvar0_2) (= 0 |v_setThreadThread1of2ForFork0_#in~param.offset_4|)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_8|} OutVars{setThreadThread1of2ForFork0_~param.offset=v_setThreadThread1of2ForFork0_~param.offset_4, setThreadThread1of2ForFork0_#in~param.base=|v_setThreadThread1of2ForFork0_#in~param.base_4|, setThreadThread1of2ForFork0_#res.base=|v_setThreadThread1of2ForFork0_#res.base_4|, setThreadThread1of2ForFork0_#in~param.offset=|v_setThreadThread1of2ForFork0_#in~param.offset_4|, setThreadThread1of2ForFork0_~param.base=v_setThreadThread1of2ForFork0_~param.base_4, setThreadThread1of2ForFork0_thidvar0=v_setThreadThread1of2ForFork0_thidvar0_2, setThreadThread1of2ForFork0_#res.offset=|v_setThreadThread1of2ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_8|} AuxVars[] AssignedVars[setThreadThread1of2ForFork0_~param.offset, setThreadThread1of2ForFork0_#in~param.base, setThreadThread1of2ForFork0_#res.base, setThreadThread1of2ForFork0_#in~param.offset, setThreadThread1of2ForFork0_~param.base, setThreadThread1of2ForFork0_thidvar0, setThreadThread1of2ForFork0_#res.offset] {143350#(<= ~i~0 0)} is VALID [2022-02-20 21:01:19,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {143350#(<= ~i~0 0)} [296] L703-4-->L703-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {143350#(<= ~i~0 0)} is VALID [2022-02-20 21:01:19,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {143350#(<= ~i~0 0)} [275] L703-5-->L702-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {143350#(<= ~i~0 0)} is VALID [2022-02-20 21:01:19,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {143350#(<= ~i~0 0)} [291] L702-2-->L702-3: Formula: (= |v_ULTIMATE.start_main_#t~post1#1_2| v_~i~0_6) InVars {~i~0=v_~i~0_6} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_2|, ~i~0=v_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1#1] {143375#(<= |ULTIMATE.start_main_#t~post1#1| 0)} is VALID [2022-02-20 21:01:19,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {143375#(<= |ULTIMATE.start_main_#t~post1#1| 0)} [265] L702-3-->L702-4: Formula: (= (+ |v_ULTIMATE.start_main_#t~post1#1_3| 1) v_~i~0_7) InVars {ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_3|} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_3|, ~i~0=v_~i~0_7} AuxVars[] AssignedVars[~i~0] {143283#(<= ~i~0 1)} is VALID [2022-02-20 21:01:19,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {143283#(<= ~i~0 1)} [308] L702-4-->L702-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1#1] {143283#(<= ~i~0 1)} is VALID [2022-02-20 21:01:19,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {143283#(<= ~i~0 1)} [248] L702-5-->L702-6: Formula: (not (< v_~i~0_3 30)) InVars {~i~0=v_~i~0_3} OutVars{~i~0=v_~i~0_3} AuxVars[] AssignedVars[] {143280#false} is VALID [2022-02-20 21:01:19,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {143280#false} [323] L702-6-->L704-5: Formula: (= v_~i~0_8 0) InVars {} OutVars{~i~0=v_~i~0_8} AuxVars[] AssignedVars[~i~0] {143280#false} is VALID [2022-02-20 21:01:19,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {143280#false} [280] L704-5-->L705: Formula: (< v_~i~0_10 1) InVars {~i~0=v_~i~0_10} OutVars{~i~0=v_~i~0_10} AuxVars[] AssignedVars[] {143280#false} is VALID [2022-02-20 21:01:19,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {143280#false} [287] L705-->L705-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {143280#false} is VALID [2022-02-20 21:01:19,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {143280#false} [314] L705-1-->L705-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {143280#false} is VALID [2022-02-20 21:01:19,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {143280#false} [309] L705-2-->L705-3: Formula: (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#checkPool~0#1.offset_3| (* v_~i~0_11 4)) |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_6|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_3|, ~i~0=v_~i~0_11, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_3|, ~i~0=v_~i~0_11, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {143280#false} is VALID [2022-02-20 21:01:19,357 INFO L290 TraceCheckUtils]: 38: Hoare triple {143280#false} [355] L705-3-->checkThreadENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre5#1_8| v_checkThreadThread1of2ForFork1_thidvar0_2) (= |v_checkThreadThread1of2ForFork1_#in~param.offset_4| 0) (= |v_checkThreadThread1of2ForFork1_#in~param.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_8|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_8|, checkThreadThread1of2ForFork1_#res.offset=|v_checkThreadThread1of2ForFork1_#res.offset_4|, checkThreadThread1of2ForFork1_~param.base=v_checkThreadThread1of2ForFork1_~param.base_4, checkThreadThread1of2ForFork1_~param.offset=v_checkThreadThread1of2ForFork1_~param.offset_4, checkThreadThread1of2ForFork1_thidvar0=v_checkThreadThread1of2ForFork1_thidvar0_2, checkThreadThread1of2ForFork1_#in~param.offset=|v_checkThreadThread1of2ForFork1_#in~param.offset_4|, checkThreadThread1of2ForFork1_#res.base=|v_checkThreadThread1of2ForFork1_#res.base_4|, checkThreadThread1of2ForFork1_#in~param.base=|v_checkThreadThread1of2ForFork1_#in~param.base_4|} AuxVars[] AssignedVars[checkThreadThread1of2ForFork1_#res.offset, checkThreadThread1of2ForFork1_~param.base, checkThreadThread1of2ForFork1_~param.offset, checkThreadThread1of2ForFork1_thidvar0, checkThreadThread1of2ForFork1_#in~param.offset, checkThreadThread1of2ForFork1_#res.base, checkThreadThread1of2ForFork1_#in~param.base] {143280#false} is VALID [2022-02-20 21:01:19,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {143280#false} [335] checkThreadENTRY-->L695: Formula: (and (= v_checkThreadThread1of2ForFork1_~param.offset_1 |v_checkThreadThread1of2ForFork1_#in~param.offset_1|) (= v_checkThreadThread1of2ForFork1_~param.base_1 |v_checkThreadThread1of2ForFork1_#in~param.base_1|)) InVars {checkThreadThread1of2ForFork1_#in~param.offset=|v_checkThreadThread1of2ForFork1_#in~param.offset_1|, checkThreadThread1of2ForFork1_#in~param.base=|v_checkThreadThread1of2ForFork1_#in~param.base_1|} OutVars{checkThreadThread1of2ForFork1_#in~param.offset=|v_checkThreadThread1of2ForFork1_#in~param.offset_1|, checkThreadThread1of2ForFork1_~param.base=v_checkThreadThread1of2ForFork1_~param.base_1, checkThreadThread1of2ForFork1_~param.offset=v_checkThreadThread1of2ForFork1_~param.offset_1, checkThreadThread1of2ForFork1_#in~param.base=|v_checkThreadThread1of2ForFork1_#in~param.base_1|} AuxVars[] AssignedVars[checkThreadThread1of2ForFork1_~param.base, checkThreadThread1of2ForFork1_~param.offset] {143280#false} is VALID [2022-02-20 21:01:19,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {143280#false} [337] L695-->L696: Formula: (and (or (not (= v_~a~0_3 1)) (not (= (- 1) v_~b~0_3))) (or (not (= v_~b~0_3 0)) (not (= v_~a~0_3 0)))) InVars {~a~0=v_~a~0_3, ~b~0=v_~b~0_3} OutVars{~a~0=v_~a~0_3, ~b~0=v_~b~0_3} AuxVars[] AssignedVars[] {143280#false} is VALID [2022-02-20 21:01:19,361 INFO L290 TraceCheckUtils]: 41: Hoare triple {143280#false} [339] L696-->checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143280#false} is VALID [2022-02-20 21:01:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:01:19,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 21:01:19,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {143280#false} [339] L696-->checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143280#false} is VALID [2022-02-20 21:01:19,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {143280#false} [337] L695-->L696: Formula: (and (or (not (= v_~a~0_3 1)) (not (= (- 1) v_~b~0_3))) (or (not (= v_~b~0_3 0)) (not (= v_~a~0_3 0)))) InVars {~a~0=v_~a~0_3, ~b~0=v_~b~0_3} OutVars{~a~0=v_~a~0_3, ~b~0=v_~b~0_3} AuxVars[] AssignedVars[] {143280#false} is VALID [2022-02-20 21:01:19,471 INFO L290 TraceCheckUtils]: 39: Hoare triple {143280#false} [335] checkThreadENTRY-->L695: Formula: (and (= v_checkThreadThread1of2ForFork1_~param.offset_1 |v_checkThreadThread1of2ForFork1_#in~param.offset_1|) (= v_checkThreadThread1of2ForFork1_~param.base_1 |v_checkThreadThread1of2ForFork1_#in~param.base_1|)) InVars {checkThreadThread1of2ForFork1_#in~param.offset=|v_checkThreadThread1of2ForFork1_#in~param.offset_1|, checkThreadThread1of2ForFork1_#in~param.base=|v_checkThreadThread1of2ForFork1_#in~param.base_1|} OutVars{checkThreadThread1of2ForFork1_#in~param.offset=|v_checkThreadThread1of2ForFork1_#in~param.offset_1|, checkThreadThread1of2ForFork1_~param.base=v_checkThreadThread1of2ForFork1_~param.base_1, checkThreadThread1of2ForFork1_~param.offset=v_checkThreadThread1of2ForFork1_~param.offset_1, checkThreadThread1of2ForFork1_#in~param.base=|v_checkThreadThread1of2ForFork1_#in~param.base_1|} AuxVars[] AssignedVars[checkThreadThread1of2ForFork1_~param.base, checkThreadThread1of2ForFork1_~param.offset] {143280#false} is VALID [2022-02-20 21:01:19,472 INFO L290 TraceCheckUtils]: 38: Hoare triple {143280#false} [355] L705-3-->checkThreadENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre5#1_8| v_checkThreadThread1of2ForFork1_thidvar0_2) (= |v_checkThreadThread1of2ForFork1_#in~param.offset_4| 0) (= |v_checkThreadThread1of2ForFork1_#in~param.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_8|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_8|, checkThreadThread1of2ForFork1_#res.offset=|v_checkThreadThread1of2ForFork1_#res.offset_4|, checkThreadThread1of2ForFork1_~param.base=v_checkThreadThread1of2ForFork1_~param.base_4, checkThreadThread1of2ForFork1_~param.offset=v_checkThreadThread1of2ForFork1_~param.offset_4, checkThreadThread1of2ForFork1_thidvar0=v_checkThreadThread1of2ForFork1_thidvar0_2, checkThreadThread1of2ForFork1_#in~param.offset=|v_checkThreadThread1of2ForFork1_#in~param.offset_4|, checkThreadThread1of2ForFork1_#res.base=|v_checkThreadThread1of2ForFork1_#res.base_4|, checkThreadThread1of2ForFork1_#in~param.base=|v_checkThreadThread1of2ForFork1_#in~param.base_4|} AuxVars[] AssignedVars[checkThreadThread1of2ForFork1_#res.offset, checkThreadThread1of2ForFork1_~param.base, checkThreadThread1of2ForFork1_~param.offset, checkThreadThread1of2ForFork1_thidvar0, checkThreadThread1of2ForFork1_#in~param.offset, checkThreadThread1of2ForFork1_#res.base, checkThreadThread1of2ForFork1_#in~param.base] {143280#false} is VALID [2022-02-20 21:01:19,472 INFO L290 TraceCheckUtils]: 37: Hoare triple {143280#false} [309] L705-2-->L705-3: Formula: (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#checkPool~0#1.offset_3| (* v_~i~0_11 4)) |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_6|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_3|, ~i~0=v_~i~0_11, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_3|, ~i~0=v_~i~0_11, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {143280#false} is VALID [2022-02-20 21:01:19,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {143280#false} [314] L705-1-->L705-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {143280#false} is VALID [2022-02-20 21:01:19,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {143280#false} [287] L705-->L705-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {143280#false} is VALID [2022-02-20 21:01:19,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {143280#false} [280] L704-5-->L705: Formula: (< v_~i~0_10 1) InVars {~i~0=v_~i~0_10} OutVars{~i~0=v_~i~0_10} AuxVars[] AssignedVars[] {143280#false} is VALID [2022-02-20 21:01:19,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {143280#false} [323] L702-6-->L704-5: Formula: (= v_~i~0_8 0) InVars {} OutVars{~i~0=v_~i~0_8} AuxVars[] AssignedVars[~i~0] {143280#false} is VALID [2022-02-20 21:01:19,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {143439#(< ~i~0 30)} [248] L702-5-->L702-6: Formula: (not (< v_~i~0_3 30)) InVars {~i~0=v_~i~0_3} OutVars{~i~0=v_~i~0_3} AuxVars[] AssignedVars[] {143280#false} is VALID [2022-02-20 21:01:19,473 INFO L290 TraceCheckUtils]: 31: Hoare triple {143439#(< ~i~0 30)} [308] L702-4-->L702-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1#1] {143439#(< ~i~0 30)} is VALID [2022-02-20 21:01:19,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {143446#(< |ULTIMATE.start_main_#t~post1#1| 29)} [265] L702-3-->L702-4: Formula: (= (+ |v_ULTIMATE.start_main_#t~post1#1_3| 1) v_~i~0_7) InVars {ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_3|} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_3|, ~i~0=v_~i~0_7} AuxVars[] AssignedVars[~i~0] {143439#(< ~i~0 30)} is VALID [2022-02-20 21:01:19,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {143450#(< ~i~0 29)} [291] L702-2-->L702-3: Formula: (= |v_ULTIMATE.start_main_#t~post1#1_2| v_~i~0_6) InVars {~i~0=v_~i~0_6} OutVars{ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_2|, ~i~0=v_~i~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post1#1] {143446#(< |ULTIMATE.start_main_#t~post1#1| 29)} is VALID [2022-02-20 21:01:19,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {143450#(< ~i~0 29)} [275] L703-5-->L702-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {143450#(< ~i~0 29)} is VALID [2022-02-20 21:01:19,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {143450#(< ~i~0 29)} [296] L703-4-->L703-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {143450#(< ~i~0 29)} is VALID [2022-02-20 21:01:19,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {143450#(< ~i~0 29)} [352] L703-3-->setThreadENTRY: Formula: (and (= 0 |v_setThreadThread1of2ForFork0_#in~param.base_4|) (= |v_ULTIMATE.start_main_#t~pre2#1_8| v_setThreadThread1of2ForFork0_thidvar0_2) (= 0 |v_setThreadThread1of2ForFork0_#in~param.offset_4|)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_8|} OutVars{setThreadThread1of2ForFork0_~param.offset=v_setThreadThread1of2ForFork0_~param.offset_4, setThreadThread1of2ForFork0_#in~param.base=|v_setThreadThread1of2ForFork0_#in~param.base_4|, setThreadThread1of2ForFork0_#res.base=|v_setThreadThread1of2ForFork0_#res.base_4|, setThreadThread1of2ForFork0_#in~param.offset=|v_setThreadThread1of2ForFork0_#in~param.offset_4|, setThreadThread1of2ForFork0_~param.base=v_setThreadThread1of2ForFork0_~param.base_4, setThreadThread1of2ForFork0_thidvar0=v_setThreadThread1of2ForFork0_thidvar0_2, setThreadThread1of2ForFork0_#res.offset=|v_setThreadThread1of2ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_8|} AuxVars[] AssignedVars[setThreadThread1of2ForFork0_~param.offset, setThreadThread1of2ForFork0_#in~param.base, setThreadThread1of2ForFork0_#res.base, setThreadThread1of2ForFork0_#in~param.offset, setThreadThread1of2ForFork0_~param.base, setThreadThread1of2ForFork0_thidvar0, setThreadThread1of2ForFork0_#res.offset] {143450#(< ~i~0 29)} is VALID [2022-02-20 21:01:19,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {143450#(< ~i~0 29)} [276] L703-2-->L703-3: Formula: (= (store |v_#memory_int_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_3| (store (select |v_#memory_int_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#setPool~0#1.offset_3| (* 4 v_~i~0_5)) |v_ULTIMATE.start_main_#t~pre2#1_3|)) |v_#memory_int_4|) InVars {#memory_int=|v_#memory_int_5|, ~i~0=v_~i~0_5, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_3|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} OutVars{#memory_int=|v_#memory_int_4|, ~i~0=v_~i~0_5, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_3|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} AuxVars[] AssignedVars[#memory_int] {143450#(< ~i~0 29)} is VALID [2022-02-20 21:01:19,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {143450#(< ~i~0 29)} [302] L703-1-->L703-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {143450#(< ~i~0 29)} is VALID [2022-02-20 21:01:19,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {143450#(< ~i~0 29)} [252] L703-->L703-1: Formula: (= |v_ULTIMATE.start_main_#t~pre2#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {143450#(< ~i~0 29)} is VALID [2022-02-20 21:01:19,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {143450#(< ~i~0 29)} [249] L702-5-->L703: Formula: (< v_~i~0_4 30) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4} AuxVars[] AssignedVars[] {143450#(< ~i~0 29)} is VALID [2022-02-20 21:01:19,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {143279#true} [310] L701-->L702-5: Formula: (= v_~i~0_2 0) InVars {} OutVars{~i~0=v_~i~0_2} AuxVars[] AssignedVars[~i~0] {143450#(< ~i~0 29)} is VALID [2022-02-20 21:01:19,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {143279#true} [321] L700-1-->L701: Formula: (and (= |v_ULTIMATE.start_main_~#checkPool~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 1)) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, #valid=|v_#valid_6|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#checkPool~0#1.offset, #valid, #length, ULTIMATE.start_main_~#checkPool~0#1.base] {143279#true} is VALID [2022-02-20 21:01:19,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {143279#true} [318] L700-->L700-1: Formula: (and (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 120)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#setPool~0#1.offset_2| 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 0))) 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_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_2|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#setPool~0#1.base, #valid, #length, ULTIMATE.start_main_~#setPool~0#1.offset] {143279#true} is VALID [2022-02-20 21:01:19,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {143279#true} [261] L699-1-->L700: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {143279#true} is VALID [2022-02-20 21:01:19,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {143279#true} [292] L699-->L699-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {143279#true} is VALID [2022-02-20 21:01:19,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {143279#true} [256] L-1-7-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_1|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#setPool~0#1.base, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre2#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~#checkPool~0#1.offset, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1, ULTIMATE.start_main_~#setPool~0#1.offset, ULTIMATE.start_main_~#checkPool~0#1.base] {143279#true} is VALID [2022-02-20 21:01:19,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {143279#true} [293] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {143279#true} is VALID [2022-02-20 21:01:19,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {143279#true} [258] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {143279#true} is VALID [2022-02-20 21:01:19,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {143279#true} [295] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {143279#true} [319] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {143279#true} [239] L684-->L-1-3: Formula: (= v_~i~0_1 0) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {143279#true} is VALID [2022-02-20 21:01:19,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {143279#true} [253] L683-->L684: Formula: (= v_~b~0_4 0) InVars {} OutVars{~b~0=v_~b~0_4} AuxVars[] AssignedVars[~b~0] {143279#true} is VALID [2022-02-20 21:01:19,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {143279#true} [269] L680-5-->L683: Formula: (= v_~a~0_4 0) InVars {} OutVars{~a~0=v_~a~0_4} AuxVars[] AssignedVars[~a~0] {143279#true} is VALID [2022-02-20 21:01:19,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {143279#true} [305] L680-4-->L680-5: Formula: (= (select (select |v_#memory_int_3| 2) 0) 0) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {143279#true} [286] L680-3-->L680-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {143279#true} [315] L680-2-->L680-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[] {143279#true} is VALID [2022-02-20 21:01:19,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {143279#true} [271] L680-1-->L680-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[] {143279#true} is VALID [2022-02-20 21:01:19,493 INFO L290 TraceCheckUtils]: 4: Hoare triple {143279#true} [312] L680-->L680-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[] {143279#true} is VALID [2022-02-20 21:01:19,493 INFO L290 TraceCheckUtils]: 3: Hoare triple {143279#true} [317] L-1-2-->L680: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {143279#true} [316] 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[] {143279#true} is VALID [2022-02-20 21:01:19,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {143279#true} [289] 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] {143279#true} is VALID [2022-02-20 21:01:19,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {143279#true} [307] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {143279#true} is VALID [2022-02-20 21:01:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:01:19,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72020540] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 21:01:19,496 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 21:01:19,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-20 21:01:19,496 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337073280] [2022-02-20 21:01:19,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 21:01:19,497 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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 21:01:19,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:01:19,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 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 21:01:19,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:01:19,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 21:01:19,536 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:01:19,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 21:01:19,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 21:01:19,537 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 110 [2022-02-20 21:01:19,538 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 106 transitions, 300 flow. Second operand has 10 states, 10 states have (on average 65.8) internal successors, (658), 10 states have internal predecessors, (658), 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 21:01:19,538 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 21:01:19,538 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 110 [2022-02-20 21:01:19,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 21:01:19,622 INFO L129 PetriNetUnfolder]: 0/57 cut-off events. [2022-02-20 21:01:19,622 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-02-20 21:01:19,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 57 events. 0/57 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 20 event pairs, 0 based on Foata normal form. 2/59 useless extension candidates. Maximal degree in co-relation 0. Up to 6 conditions per place. [2022-02-20 21:01:19,622 INFO L132 encePairwiseOnDemand]: 105/110 looper letters, 10 selfloop transitions, 7 changer transitions 0/51 dead transitions. [2022-02-20 21:01:19,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 51 transitions, 156 flow [2022-02-20 21:01:19,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 21:01:19,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 21:01:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 586 transitions. [2022-02-20 21:01:19,628 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.591919191919192 [2022-02-20 21:01:19,628 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 586 transitions. [2022-02-20 21:01:19,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 586 transitions. [2022-02-20 21:01:19,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 21:01:19,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 586 transitions. [2022-02-20 21:01:19,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 65.11111111111111) internal successors, (586), 9 states have internal predecessors, (586), 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 21:01:19,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 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 21:01:19,631 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 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 21:01:19,631 INFO L186 Difference]: Start difference. First operand has 107 places, 106 transitions, 300 flow. Second operand 9 states and 586 transitions. [2022-02-20 21:01:19,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 51 transitions, 156 flow [2022-02-20 21:01:19,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 51 transitions, 152 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-02-20 21:01:19,635 INFO L242 Difference]: Finished difference. Result has 62 places, 47 transitions, 124 flow [2022-02-20 21:01:19,635 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=124, PETRI_PLACES=62, PETRI_TRANSITIONS=47} [2022-02-20 21:01:19,637 INFO L334 CegarLoopForPetriNet]: 105 programPoint places, -43 predicate places. [2022-02-20 21:01:19,637 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 47 transitions, 124 flow [2022-02-20 21:01:19,642 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 483 states, 482 states have (on average 2.400414937759336) internal successors, (1157), 482 states have internal predecessors, (1157), 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 21:01:19,643 INFO L78 Accepts]: Start accepts. Automaton has has 483 states, 482 states have (on average 2.400414937759336) internal successors, (1157), 482 states have internal predecessors, (1157), 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 21:01:19,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:01:19,644 INFO L470 AbstractCegarLoop]: Abstraction has has 62 places, 47 transitions, 124 flow [2022-02-20 21:01:19,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 65.8) internal successors, (658), 10 states have internal predecessors, (658), 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 21:01:19,644 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 21:01:19,644 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 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 21:01:19,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 21:01:19,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-20 21:01:19,861 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATION === [checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 21:01:19,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:01:19,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1479036618, now seen corresponding path program 1 times [2022-02-20 21:01:19,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:01:19,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29014482] [2022-02-20 21:01:19,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:01:19,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:01:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 21:01:19,882 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 21:01:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 21:01:19,912 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 21:01:19,912 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 21:01:19,913 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATION (4 of 5 remaining) [2022-02-20 21:01:19,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-02-20 21:01:19,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-02-20 21:01:19,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-02-20 21:01:19,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-02-20 21:01:19,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 21:01:19,914 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 21:01:19,914 WARN L235 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 21:01:19,914 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-02-20 21:01:19,933 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of3ForFork0_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,933 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of3ForFork0_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,933 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of3ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,933 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of3ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,933 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of3ForFork0_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,934 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of3ForFork0_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,934 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of3ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,934 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of3ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,934 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,934 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,934 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,934 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,934 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of3ForFork0_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,935 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of3ForFork0_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,935 WARN L322 ript$VariableManager]: TermVariabe setThreadThread2of3ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,935 WARN L322 ript$VariableManager]: TermVariabe setThreadThread2of3ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,935 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of3ForFork0_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,935 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of3ForFork0_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,935 WARN L322 ript$VariableManager]: TermVariabe setThreadThread2of3ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,935 WARN L322 ript$VariableManager]: TermVariabe setThreadThread2of3ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,935 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,936 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,936 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,936 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,936 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread3of3ForFork0_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,936 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread3of3ForFork0_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,936 WARN L322 ript$VariableManager]: TermVariabe setThreadThread3of3ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,936 WARN L322 ript$VariableManager]: TermVariabe setThreadThread3of3ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,936 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread3of3ForFork0_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,937 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread3of3ForFork0_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,937 WARN L322 ript$VariableManager]: TermVariabe setThreadThread3of3ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,937 WARN L322 ript$VariableManager]: TermVariabe setThreadThread3of3ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,937 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,937 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,937 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,937 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,938 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of3ForFork1_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,938 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of3ForFork1_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,938 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of3ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,938 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of3ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,938 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of3ForFork1_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,938 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of3ForFork1_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,938 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of3ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,938 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of3ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,939 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,939 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,939 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,939 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,939 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of3ForFork1_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,939 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of3ForFork1_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,939 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread2of3ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,939 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread2of3ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,940 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of3ForFork1_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,940 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of3ForFork1_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,940 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread2of3ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,940 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread2of3ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,941 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,941 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,941 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,941 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,941 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread3of3ForFork1_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,941 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread3of3ForFork1_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,942 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread3of3ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,942 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread3of3ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,942 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread3of3ForFork1_#in~param.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,942 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread3of3ForFork1_#in~param.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,942 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread3of3ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,942 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread3of3ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,942 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,942 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,943 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,943 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,943 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,943 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of3ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,943 WARN L322 ript$VariableManager]: TermVariabe setThreadThread1of3ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,943 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,944 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,944 WARN L322 ript$VariableManager]: TermVariabe setThreadThread2of3ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,944 WARN L322 ript$VariableManager]: TermVariabe setThreadThread2of3ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,944 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,944 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,945 WARN L322 ript$VariableManager]: TermVariabe setThreadThread3of3ForFork0_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,945 WARN L322 ript$VariableManager]: TermVariabe setThreadThread3of3ForFork0_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,945 WARN L322 ript$VariableManager]: TermVariabe |setThreadThread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,945 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,945 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,945 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of3ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,946 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread1of3ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,946 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,946 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread2of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,946 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread2of3ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,946 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread2of3ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,947 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread3of3ForFork1_~param.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,947 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread3of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,947 WARN L322 ript$VariableManager]: TermVariabe |checkThreadThread3of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,947 WARN L322 ript$VariableManager]: TermVariabe checkThreadThread3of3ForFork1_~param.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 21:01:19,968 INFO L148 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2022-02-20 21:01:19,969 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:01:19,969 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 21:01:19,969 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-20 21:01:19,970 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 129 transitions, 336 flow [2022-02-20 21:01:20,128 INFO L129 PetriNetUnfolder]: 496/2280 cut-off events. [2022-02-20 21:01:20,128 INFO L130 PetriNetUnfolder]: For 419/419 co-relation queries the response was YES. [2022-02-20 21:01:20,141 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2731 conditions, 2280 events. 496/2280 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 14991 event pairs, 64 based on Foata normal form. 0/1960 useless extension candidates. Maximal degree in co-relation 1399. Up to 192 conditions per place. [2022-02-20 21:01:20,142 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 129 transitions, 336 flow [2022-02-20 21:01:20,150 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 129 transitions, 336 flow [2022-02-20 21:01:20,153 INFO L129 PetriNetUnfolder]: 6/68 cut-off events. [2022-02-20 21:01:20,153 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 21:01:20,154 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 21:01:20,154 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] [2022-02-20 21:01:20,154 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION === [checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-20 21:01:20,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:01:20,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1099185159, now seen corresponding path program 1 times [2022-02-20 21:01:20,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:01:20,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573321877] [2022-02-20 21:01:20,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:01:20,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:01:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:01:20,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#true} [434] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-02-20 21:01:20,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#true} [416] 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] {126#true} is VALID [2022-02-20 21:01:20,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {126#true} [443] 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[] {126#true} is VALID [2022-02-20 21:01:20,175 INFO L290 TraceCheckUtils]: 3: Hoare triple {126#true} [444] L-1-2-->L680: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {126#true} is VALID [2022-02-20 21:01:20,175 INFO L290 TraceCheckUtils]: 4: Hoare triple {126#true} [439] L680-->L680-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[] {126#true} is VALID [2022-02-20 21:01:20,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {126#true} [398] L680-1-->L680-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[] {126#true} is VALID [2022-02-20 21:01:20,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {126#true} [442] L680-2-->L680-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[] {126#true} is VALID [2022-02-20 21:01:20,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {126#true} [413] L680-3-->L680-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {126#true} is VALID [2022-02-20 21:01:20,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {126#true} [432] L680-4-->L680-5: Formula: (= (select (select |v_#memory_int_3| 2) 0) 0) InVars {#memory_int=|v_#memory_int_3|} OutVars{#memory_int=|v_#memory_int_3|} AuxVars[] AssignedVars[] {126#true} is VALID [2022-02-20 21:01:20,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {126#true} [396] L680-5-->L683: Formula: (= v_~a~0_4 0) InVars {} OutVars{~a~0=v_~a~0_4} AuxVars[] AssignedVars[~a~0] {126#true} is VALID [2022-02-20 21:01:20,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#true} [380] L683-->L684: Formula: (= v_~b~0_4 0) InVars {} OutVars{~b~0=v_~b~0_4} AuxVars[] AssignedVars[~b~0] {126#true} is VALID [2022-02-20 21:01:20,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {126#true} [366] L684-->L-1-3: Formula: (= v_~i~0_1 0) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {126#true} is VALID [2022-02-20 21:01:20,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {126#true} [446] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-02-20 21:01:20,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {126#true} [422] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {126#true} is VALID [2022-02-20 21:01:20,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {126#true} [385] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {126#true} is VALID [2022-02-20 21:01:20,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {126#true} [420] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {126#true} is VALID [2022-02-20 21:01:20,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {126#true} [383] L-1-7-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_#t~post1#1=|v_ULTIMATE.start_main_#t~post1#1_1|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_#t~post9#1=|v_ULTIMATE.start_main_#t~post9#1_1|, ULTIMATE.start_main_#t~post4#1=|v_ULTIMATE.start_main_#t~post4#1_1|, ULTIMATE.start_main_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_1|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_#t~post1#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#setPool~0#1.base, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_#t~mem10#1, ULTIMATE.start_main_#t~pre2#1, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~#checkPool~0#1.offset, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_#t~post9#1, ULTIMATE.start_main_#t~post4#1, ULTIMATE.start_main_~#setPool~0#1.offset, ULTIMATE.start_main_~#checkPool~0#1.base] {126#true} is VALID [2022-02-20 21:01:20,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {126#true} [419] L699-->L699-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {126#true} is VALID [2022-02-20 21:01:20,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {126#true} [388] L699-1-->L700: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {126#true} is VALID [2022-02-20 21:01:20,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {126#true} [445] L700-->L700-1: Formula: (and (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 120)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#setPool~0#1.offset_2| 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#setPool~0#1.base_2|) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#setPool~0#1.base_2| 0))) 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_~#setPool~0#1.offset=|v_ULTIMATE.start_main_~#setPool~0#1.offset_2|, ULTIMATE.start_main_~#setPool~0#1.base=|v_ULTIMATE.start_main_~#setPool~0#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#setPool~0#1.base, #valid, #length, ULTIMATE.start_main_~#setPool~0#1.offset] {126#true} is VALID [2022-02-20 21:01:20,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {126#true} [448] L700-1-->L701: Formula: (and (= |v_ULTIMATE.start_main_~#checkPool~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 0)) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 1)) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, #valid=|v_#valid_6|, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#checkPool~0#1.offset, #valid, #length, ULTIMATE.start_main_~#checkPool~0#1.base] {126#true} is VALID [2022-02-20 21:01:20,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {126#true} [437] L701-->L702-5: Formula: (= v_~i~0_2 0) InVars {} OutVars{~i~0=v_~i~0_2} AuxVars[] AssignedVars[~i~0] {128#(= ~i~0 0)} is VALID [2022-02-20 21:01:20,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {128#(= ~i~0 0)} [375] L702-5-->L702-6: Formula: (not (< v_~i~0_3 30)) InVars {~i~0=v_~i~0_3} OutVars{~i~0=v_~i~0_3} AuxVars[] AssignedVars[] {127#false} is VALID [2022-02-20 21:01:20,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {127#false} [450] L702-6-->L704-5: Formula: (= v_~i~0_8 0) InVars {} OutVars{~i~0=v_~i~0_8} AuxVars[] AssignedVars[~i~0] {127#false} is VALID [2022-02-20 21:01:20,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {127#false} [407] L704-5-->L705: Formula: (< v_~i~0_10 1) InVars {~i~0=v_~i~0_10} OutVars{~i~0=v_~i~0_10} AuxVars[] AssignedVars[] {127#false} is VALID [2022-02-20 21:01:20,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {127#false} [414] L705-->L705-1: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {127#false} is VALID [2022-02-20 21:01:20,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {127#false} [441] L705-1-->L705-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {127#false} is VALID [2022-02-20 21:01:20,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {127#false} [436] L705-2-->L705-3: Formula: (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#checkPool~0#1.base_3|) (+ |v_ULTIMATE.start_main_~#checkPool~0#1.offset_3| (* v_~i~0_11 4)) |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_6|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_3|, ~i~0=v_~i~0_11, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#checkPool~0#1.offset=|v_ULTIMATE.start_main_~#checkPool~0#1.offset_3|, ~i~0=v_~i~0_11, ULTIMATE.start_main_~#checkPool~0#1.base=|v_ULTIMATE.start_main_~#checkPool~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {127#false} is VALID [2022-02-20 21:01:20,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {127#false} [496] L705-3-->checkThreadENTRY: Formula: (and (= 0 |v_checkThreadThread1of3ForFork1_#in~param.base_4|) (= v_checkThreadThread1of3ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre5#1_13|) (= |v_checkThreadThread1of3ForFork1_#in~param.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_13|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_13|, checkThreadThread1of3ForFork1_#res.base=|v_checkThreadThread1of3ForFork1_#res.base_4|, checkThreadThread1of3ForFork1_thidvar0=v_checkThreadThread1of3ForFork1_thidvar0_2, checkThreadThread1of3ForFork1_#res.offset=|v_checkThreadThread1of3ForFork1_#res.offset_4|, checkThreadThread1of3ForFork1_~param.offset=v_checkThreadThread1of3ForFork1_~param.offset_4, checkThreadThread1of3ForFork1_#in~param.base=|v_checkThreadThread1of3ForFork1_#in~param.base_4|, checkThreadThread1of3ForFork1_~param.base=v_checkThreadThread1of3ForFork1_~param.base_4, checkThreadThread1of3ForFork1_#in~param.offset=|v_checkThreadThread1of3ForFork1_#in~param.offset_4|} AuxVars[] AssignedVars[checkThreadThread1of3ForFork1_#res.base, checkThreadThread1of3ForFork1_thidvar0, checkThreadThread1of3ForFork1_#res.offset, checkThreadThread1of3ForFork1_~param.offset, checkThreadThread1of3ForFork1_#in~param.base, checkThreadThread1of3ForFork1_~param.base, checkThreadThread1of3ForFork1_#in~param.offset] {127#false} is VALID [2022-02-20 21:01:20,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {127#false} [467] checkThreadENTRY-->L695: Formula: (and (= v_checkThreadThread1of3ForFork1_~param.base_1 |v_checkThreadThread1of3ForFork1_#in~param.base_1|) (= v_checkThreadThread1of3ForFork1_~param.offset_1 |v_checkThreadThread1of3ForFork1_#in~param.offset_1|)) InVars {checkThreadThread1of3ForFork1_#in~param.base=|v_checkThreadThread1of3ForFork1_#in~param.base_1|, checkThreadThread1of3ForFork1_#in~param.offset=|v_checkThreadThread1of3ForFork1_#in~param.offset_1|} OutVars{checkThreadThread1of3ForFork1_~param.offset=v_checkThreadThread1of3ForFork1_~param.offset_1, checkThreadThread1of3ForFork1_#in~param.base=|v_checkThreadThread1of3ForFork1_#in~param.base_1|, checkThreadThread1of3ForFork1_~param.base=v_checkThreadThread1of3ForFork1_~param.base_1, checkThreadThread1of3ForFork1_#in~param.offset=|v_checkThreadThread1of3ForFork1_#in~param.offset_1|} AuxVars[] AssignedVars[checkThreadThread1of3ForFork1_~param.offset, checkThreadThread1of3ForFork1_~param.base] {127#false} is VALID [2022-02-20 21:01:20,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {127#false} [469] L695-->L696: Formula: (and (or (not (= v_~a~0_3 1)) (not (= (- 1) v_~b~0_3))) (or (not (= v_~b~0_3 0)) (not (= v_~a~0_3 0)))) InVars {~a~0=v_~a~0_3, ~b~0=v_~b~0_3} OutVars{~a~0=v_~a~0_3, ~b~0=v_~b~0_3} AuxVars[] AssignedVars[] {127#false} is VALID [2022-02-20 21:01:20,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {127#false} [471] L696-->checkThreadErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {127#false} is VALID [2022-02-20 21:01:20,180 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 21:01:20,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:01:20,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573321877] [2022-02-20 21:01:20,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573321877] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:01:20,180 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:01:20,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 21:01:20,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41330717] [2022-02-20 21:01:20,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:01:20,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 32 [2022-02-20 21:01:20,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:01:20,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 21:01:20,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:01:20,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:01:20,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:01:20,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:01:20,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:01:20,197 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 129 [2022-02-20 21:01:20,197 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 129 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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 21:01:20,197 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 21:01:20,197 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 129 [2022-02-20 21:01:20,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand