./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_20-publish-regression_true.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/goblint-regression/13-privatized_20-publish-regression_true.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 bdbcb1f6d336419408bc21eb9ac3a89d4566c9a0348f626a712e605b31e52535 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:40:18,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:40:18,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:40:18,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:40:18,491 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:40:18,492 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:40:18,493 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:40:18,494 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:40:18,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:40:18,495 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:40:18,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:40:18,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:40:18,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:40:18,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:40:18,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:40:18,499 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:40:18,500 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:40:18,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:40:18,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:40:18,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:40:18,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:40:18,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:40:18,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:40:18,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:40:18,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:40:18,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:40:18,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:40:18,510 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:40:18,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:40:18,511 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:40:18,512 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:40:18,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:40:18,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:40:18,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:40:18,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:40:18,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:40:18,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:40:18,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:40:18,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:40:18,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:40:18,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:40:18,520 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 20:40:18,539 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:40:18,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:40:18,539 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:40:18,539 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:40:18,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:40:18,540 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:40:18,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:40:18,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:40:18,541 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:40:18,541 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:40:18,541 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:40:18,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:40:18,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:40:18,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:40:18,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:40:18,542 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:40:18,542 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:40:18,542 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:40:18,542 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:40:18,542 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:40:18,543 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:40:18,543 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:40:18,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:40:18,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:40:18,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:18,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:40:18,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:40:18,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:40:18,544 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:40:18,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:40:18,544 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:40:18,544 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:40:18,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:40:18,545 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 -> bdbcb1f6d336419408bc21eb9ac3a89d4566c9a0348f626a712e605b31e52535 [2022-02-20 20:40:18,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:40:18,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:40:18,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:40:18,741 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:40:18,744 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:40:18,745 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_20-publish-regression_true.i [2022-02-20 20:40:18,804 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0acb4bfff/53b9c1d631764e10b2685ed30aac5aa2/FLAG148f959e7 [2022-02-20 20:40:19,196 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:40:19,197 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_20-publish-regression_true.i [2022-02-20 20:40:19,204 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0acb4bfff/53b9c1d631764e10b2685ed30aac5aa2/FLAG148f959e7 [2022-02-20 20:40:19,212 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0acb4bfff/53b9c1d631764e10b2685ed30aac5aa2 [2022-02-20 20:40:19,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:40:19,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:40:19,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:19,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:40:19,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:40:19,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:19" (1/1) ... [2022-02-20 20:40:19,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52875a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:19, skipping insertion in model container [2022-02-20 20:40:19,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:19" (1/1) ... [2022-02-20 20:40:19,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:40:19,254 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:40:19,404 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/goblint-regression/13-privatized_20-publish-regression_true.i[1095,1108] [2022-02-20 20:40:19,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:19,521 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:40:19,531 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/goblint-regression/13-privatized_20-publish-regression_true.i[1095,1108] [2022-02-20 20:40:19,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:19,603 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:40:19,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:19 WrapperNode [2022-02-20 20:40:19,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:19,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:19,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:40:19,605 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:40:19,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:19" (1/1) ... [2022-02-20 20:40:19,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:19" (1/1) ... [2022-02-20 20:40:19,655 INFO L137 Inliner]: procedures = 162, calls = 31, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 75 [2022-02-20 20:40:19,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:19,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:40:19,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:40:19,656 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:40:19,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:19" (1/1) ... [2022-02-20 20:40:19,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:19" (1/1) ... [2022-02-20 20:40:19,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:19" (1/1) ... [2022-02-20 20:40:19,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:19" (1/1) ... [2022-02-20 20:40:19,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:19" (1/1) ... [2022-02-20 20:40:19,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:19" (1/1) ... [2022-02-20 20:40:19,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:19" (1/1) ... [2022-02-20 20:40:19,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:40:19,691 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:40:19,691 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:40:19,691 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:40:19,692 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:19" (1/1) ... [2022-02-20 20:40:19,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:19,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:40:19,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 20:40:19,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 20:40:19,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:40:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:40:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:40:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:40:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:40:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-20 20:40:19,741 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-20 20:40:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:40:19,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:40:19,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:40:19,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:40:19,743 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-20 20:40:19,816 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:40:19,817 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:40:20,006 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:40:20,011 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:40:20,011 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:40:20,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:20 BoogieIcfgContainer [2022-02-20 20:40:20,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:40:20,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:40:20,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:40:20,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:40:20,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:40:19" (1/3) ... [2022-02-20 20:40:20,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3636541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:20, skipping insertion in model container [2022-02-20 20:40:20,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:19" (2/3) ... [2022-02-20 20:40:20,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3636541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:20, skipping insertion in model container [2022-02-20 20:40:20,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:20" (3/3) ... [2022-02-20 20:40:20,018 INFO L111 eAbstractionObserver]: Analyzing ICFG 13-privatized_20-publish-regression_true.i [2022-02-20 20:40:20,029 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:40:20,029 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:40:20,029 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-02-20 20:40:20,029 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:40:20,077 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,078 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,078 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,078 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,078 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,078 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,078 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,079 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,079 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,079 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,080 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,080 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,080 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,081 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,083 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,084 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,084 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,084 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,085 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,085 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,085 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,085 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,086 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,086 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,087 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,087 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,087 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,087 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,088 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,088 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,088 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,089 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,090 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,090 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,090 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,091 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,093 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,095 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,095 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,095 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,096 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,096 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,096 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,096 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,096 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:20,104 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-20 20:40:20,139 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:40:20,152 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 20:40:20,152 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-02-20 20:40:20,165 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 92 places, 91 transitions, 190 flow [2022-02-20 20:40:20,199 INFO L129 PetriNetUnfolder]: 3/90 cut-off events. [2022-02-20 20:40:20,199 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:20,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 90 events. 3/90 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 41. Up to 2 conditions per place. [2022-02-20 20:40:20,202 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 91 transitions, 190 flow [2022-02-20 20:40:20,205 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 82 transitions, 167 flow [2022-02-20 20:40:20,213 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2022-02-20 20:40:20,213 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:20,213 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:20,214 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] [2022-02-20 20:40:20,214 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-20 20:40:20,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:20,232 INFO L85 PathProgramCache]: Analyzing trace with hash -547127912, now seen corresponding path program 1 times [2022-02-20 20:40:20,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:20,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086644172] [2022-02-20 20:40:20,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:20,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:20,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {95#true} [174] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-02-20 20:40:20,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#true} [159] 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] {95#true} is VALID [2022-02-20 20:40:20,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {95#true} [183] 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[] {95#true} is VALID [2022-02-20 20:40:20,438 INFO L290 TraceCheckUtils]: 3: Hoare triple {95#true} [188] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {95#true} is VALID [2022-02-20 20:40:20,438 INFO L290 TraceCheckUtils]: 4: Hoare triple {95#true} [140] L18-->L18-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[] {95#true} is VALID [2022-02-20 20:40:20,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {95#true} [175] L18-1-->L18-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[] {95#true} is VALID [2022-02-20 20:40:20,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {95#true} [164] L18-2-->L18-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[] {95#true} is VALID [2022-02-20 20:40:20,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {95#true} [167] L18-3-->L18-4: Formula: (and (= 43 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {95#true} is VALID [2022-02-20 20:40:20,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {95#true} [168] L18-4-->L682: Formula: (= v_~glob1~0_1 0) InVars {} OutVars{~glob1~0=v_~glob1~0_1} AuxVars[] AssignedVars[~glob1~0] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {97#(= ~glob1~0 0)} [111] L682-->L682-1: Formula: (and (= |v_~#mutex1~0.offset_1| 0) (= 3 |v_~#mutex1~0.base_1|)) InVars {} OutVars{~#mutex1~0.offset=|v_~#mutex1~0.offset_1|, ~#mutex1~0.base=|v_~#mutex1~0.base_1|} AuxVars[] AssignedVars[~#mutex1~0.offset, ~#mutex1~0.base] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {97#(= ~glob1~0 0)} [141] L682-1-->L682-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {97#(= ~glob1~0 0)} [117] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#mutex1~0.base_2|) |v_~#mutex1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_2|, ~#mutex1~0.base=|v_~#mutex1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_2|, ~#mutex1~0.base=|v_~#mutex1~0.base_2|} AuxVars[] AssignedVars[] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {97#(= ~glob1~0 0)} [186] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#mutex1~0.base_3|) (+ |v_~#mutex1~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_3|, ~#mutex1~0.base=|v_~#mutex1~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_3|, ~#mutex1~0.base=|v_~#mutex1~0.base_3|} AuxVars[] AssignedVars[] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {97#(= ~glob1~0 0)} [155] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#mutex1~0.base_4|) (+ |v_~#mutex1~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_4|, ~#mutex1~0.base=|v_~#mutex1~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_4|, ~#mutex1~0.base=|v_~#mutex1~0.base_4|} AuxVars[] AssignedVars[] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {97#(= ~glob1~0 0)} [192] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#mutex1~0.base_5|) (+ |v_~#mutex1~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_5|, ~#mutex1~0.base=|v_~#mutex1~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_5|, ~#mutex1~0.base=|v_~#mutex1~0.base_5|} AuxVars[] AssignedVars[] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {97#(= ~glob1~0 0)} [132] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#mutex1~0.base_6|) (+ 16 |v_~#mutex1~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_6|, ~#mutex1~0.base=|v_~#mutex1~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_6|, ~#mutex1~0.base=|v_~#mutex1~0.base_6|} AuxVars[] AssignedVars[] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {97#(= ~glob1~0 0)} [179] L682-7-->L683: Formula: (and (= |v_~#mutex2~0.base_1| 4) (= |v_~#mutex2~0.offset_1| 0)) InVars {} OutVars{~#mutex2~0.base=|v_~#mutex2~0.base_1|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_1|} AuxVars[] AssignedVars[~#mutex2~0.offset, ~#mutex2~0.base] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {97#(= ~glob1~0 0)} [120] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {97#(= ~glob1~0 0)} [173] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#mutex2~0.base_2|) |v_~#mutex2~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_2|, ~#mutex2~0.base=|v_~#mutex2~0.base_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_2|, ~#mutex2~0.base=|v_~#mutex2~0.base_2|} AuxVars[] AssignedVars[] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {97#(= ~glob1~0 0)} [158] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_9| |v_~#mutex2~0.base_3|) (+ |v_~#mutex2~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_3|, ~#mutex2~0.base=|v_~#mutex2~0.base_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_3|, ~#mutex2~0.base=|v_~#mutex2~0.base_3|} AuxVars[] AssignedVars[] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {97#(= ~glob1~0 0)} [180] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#mutex2~0.base_4|) (+ |v_~#mutex2~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_4|, ~#mutex2~0.base=|v_~#mutex2~0.base_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_4|, ~#mutex2~0.base=|v_~#mutex2~0.base_4|} AuxVars[] AssignedVars[] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,446 INFO L290 TraceCheckUtils]: 21: Hoare triple {97#(= ~glob1~0 0)} [110] L683-4-->L683-5: Formula: (= (select (select |v_#memory_int_11| |v_~#mutex2~0.base_5|) (+ |v_~#mutex2~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_11|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_5|, ~#mutex2~0.base=|v_~#mutex2~0.base_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_5|, ~#mutex2~0.base=|v_~#mutex2~0.base_5|} AuxVars[] AssignedVars[] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {97#(= ~glob1~0 0)} [181] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#mutex2~0.base_6|) (+ 16 |v_~#mutex2~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_6|, ~#mutex2~0.base=|v_~#mutex2~0.base_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_6|, ~#mutex2~0.base=|v_~#mutex2~0.base_6|} AuxVars[] AssignedVars[] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {97#(= ~glob1~0 0)} [156] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {97#(= ~glob1~0 0)} [191] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,448 INFO L290 TraceCheckUtils]: 25: Hoare triple {97#(= ~glob1~0 0)} [166] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {97#(= ~glob1~0 0)} [124] L-1-5-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre4#1] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {97#(= ~glob1~0 0)} [151] L697-->L697-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {97#(= ~glob1~0 0)} [125] L697-1-->L698: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {97#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:20,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {97#(= ~glob1~0 0)} [148] L698-->L698-1: Formula: (= (ite (= v_~glob1~0_2 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|) InVars {~glob1~0=v_~glob1~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~glob1~0=v_~glob1~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {98#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:20,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {98#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [146] L698-1-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {98#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:20,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {98#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [150] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {99#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:20,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {99#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [134] L19-1-->L19-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {96#false} is VALID [2022-02-20 20:40:20,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {96#false} [153] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#false} is VALID [2022-02-20 20:40:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:40:20,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:20,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086644172] [2022-02-20 20:40:20,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086644172] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:20,454 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:20,454 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:40:20,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668515094] [2022-02-20 20:40:20,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:20,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 20:40:20,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:20,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:20,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:20,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:40:20,495 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:20,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:40:20,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:40:20,511 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 91 [2022-02-20 20:40:20,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 82 transitions, 167 flow. Second operand has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:20,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:20,514 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 91 [2022-02-20 20:40:20,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:20,620 INFO L129 PetriNetUnfolder]: 19/179 cut-off events. [2022-02-20 20:40:20,620 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:20,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 179 events. 19/179 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 632 event pairs, 3 based on Foata normal form. 13/185 useless extension candidates. Maximal degree in co-relation 194. Up to 13 conditions per place. [2022-02-20 20:40:20,622 INFO L132 encePairwiseOnDemand]: 78/91 looper letters, 14 selfloop transitions, 15 changer transitions 3/92 dead transitions. [2022-02-20 20:40:20,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 92 transitions, 251 flow [2022-02-20 20:40:20,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:40:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:40:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 662 transitions. [2022-02-20 20:40:20,642 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8083028083028083 [2022-02-20 20:40:20,642 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 662 transitions. [2022-02-20 20:40:20,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 662 transitions. [2022-02-20 20:40:20,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:20,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 662 transitions. [2022-02-20 20:40:20,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 73.55555555555556) internal successors, (662), 9 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:20,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:20,652 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 91.0) internal successors, (910), 10 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:20,654 INFO L186 Difference]: Start difference. First operand has 83 places, 82 transitions, 167 flow. Second operand 9 states and 662 transitions. [2022-02-20 20:40:20,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 92 transitions, 251 flow [2022-02-20 20:40:20,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 92 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:40:20,658 INFO L242 Difference]: Finished difference. Result has 91 places, 83 transitions, 236 flow [2022-02-20 20:40:20,659 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=236, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2022-02-20 20:40:20,661 INFO L334 CegarLoopForPetriNet]: 83 programPoint places, 8 predicate places. [2022-02-20 20:40:20,662 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 83 transitions, 236 flow [2022-02-20 20:40:20,686 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 425 states, 419 states have (on average 1.7899761336515514) internal successors, (750), 424 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:20,688 INFO L78 Accepts]: Start accepts. Automaton has has 425 states, 419 states have (on average 1.7899761336515514) internal successors, (750), 424 states have internal predecessors, (750), 0 states have call successors, (0), 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 34 [2022-02-20 20:40:20,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:20,688 INFO L470 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 236 flow [2022-02-20 20:40:20,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:20,689 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:20,689 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:20,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:40:20,689 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-20 20:40:20,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:20,690 INFO L85 PathProgramCache]: Analyzing trace with hash -875946487, now seen corresponding path program 1 times [2022-02-20 20:40:20,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:20,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933029818] [2022-02-20 20:40:20,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:20,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:20,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {541#true} [174] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {541#true} [159] 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] {541#true} is VALID [2022-02-20 20:40:20,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {541#true} [183] 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[] {541#true} is VALID [2022-02-20 20:40:20,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {541#true} [188] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {541#true} [140] L18-->L18-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[] {541#true} is VALID [2022-02-20 20:40:20,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {541#true} [175] L18-1-->L18-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[] {541#true} is VALID [2022-02-20 20:40:20,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {541#true} [164] L18-2-->L18-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[] {541#true} is VALID [2022-02-20 20:40:20,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {541#true} [167] L18-3-->L18-4: Formula: (and (= 43 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {541#true} [168] L18-4-->L682: Formula: (= v_~glob1~0_1 0) InVars {} OutVars{~glob1~0=v_~glob1~0_1} AuxVars[] AssignedVars[~glob1~0] {541#true} is VALID [2022-02-20 20:40:20,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {541#true} [111] L682-->L682-1: Formula: (and (= |v_~#mutex1~0.offset_1| 0) (= 3 |v_~#mutex1~0.base_1|)) InVars {} OutVars{~#mutex1~0.offset=|v_~#mutex1~0.offset_1|, ~#mutex1~0.base=|v_~#mutex1~0.base_1|} AuxVars[] AssignedVars[~#mutex1~0.offset, ~#mutex1~0.base] {541#true} is VALID [2022-02-20 20:40:20,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {541#true} [141] L682-1-->L682-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {541#true} [117] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#mutex1~0.base_2|) |v_~#mutex1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_2|, ~#mutex1~0.base=|v_~#mutex1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_2|, ~#mutex1~0.base=|v_~#mutex1~0.base_2|} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {541#true} [186] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#mutex1~0.base_3|) (+ |v_~#mutex1~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_3|, ~#mutex1~0.base=|v_~#mutex1~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_3|, ~#mutex1~0.base=|v_~#mutex1~0.base_3|} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {541#true} [155] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#mutex1~0.base_4|) (+ |v_~#mutex1~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_4|, ~#mutex1~0.base=|v_~#mutex1~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_4|, ~#mutex1~0.base=|v_~#mutex1~0.base_4|} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {541#true} [192] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#mutex1~0.base_5|) (+ |v_~#mutex1~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_5|, ~#mutex1~0.base=|v_~#mutex1~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_5|, ~#mutex1~0.base=|v_~#mutex1~0.base_5|} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {541#true} [132] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#mutex1~0.base_6|) (+ 16 |v_~#mutex1~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_6|, ~#mutex1~0.base=|v_~#mutex1~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_6|, ~#mutex1~0.base=|v_~#mutex1~0.base_6|} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {541#true} [179] L682-7-->L683: Formula: (and (= |v_~#mutex2~0.base_1| 4) (= |v_~#mutex2~0.offset_1| 0)) InVars {} OutVars{~#mutex2~0.base=|v_~#mutex2~0.base_1|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_1|} AuxVars[] AssignedVars[~#mutex2~0.offset, ~#mutex2~0.base] {541#true} is VALID [2022-02-20 20:40:20,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {541#true} [120] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {541#true} [173] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#mutex2~0.base_2|) |v_~#mutex2~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_2|, ~#mutex2~0.base=|v_~#mutex2~0.base_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_2|, ~#mutex2~0.base=|v_~#mutex2~0.base_2|} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {541#true} [158] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_9| |v_~#mutex2~0.base_3|) (+ |v_~#mutex2~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_3|, ~#mutex2~0.base=|v_~#mutex2~0.base_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_3|, ~#mutex2~0.base=|v_~#mutex2~0.base_3|} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {541#true} [180] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#mutex2~0.base_4|) (+ |v_~#mutex2~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_4|, ~#mutex2~0.base=|v_~#mutex2~0.base_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_4|, ~#mutex2~0.base=|v_~#mutex2~0.base_4|} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {541#true} [110] L683-4-->L683-5: Formula: (= (select (select |v_#memory_int_11| |v_~#mutex2~0.base_5|) (+ |v_~#mutex2~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_11|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_5|, ~#mutex2~0.base=|v_~#mutex2~0.base_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_5|, ~#mutex2~0.base=|v_~#mutex2~0.base_5|} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {541#true} [181] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#mutex2~0.base_6|) (+ 16 |v_~#mutex2~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_6|, ~#mutex2~0.base=|v_~#mutex2~0.base_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_6|, ~#mutex2~0.base=|v_~#mutex2~0.base_6|} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {541#true} [156] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {541#true} [191] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {541#true} [166] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {541#true} is VALID [2022-02-20 20:40:20,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {541#true} [124] L-1-5-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre4#1] {541#true} is VALID [2022-02-20 20:40:20,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {541#true} [151] L697-->L697-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {541#true} is VALID [2022-02-20 20:40:20,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {541#true} [125] L697-1-->L698: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {541#true} [148] L698-->L698-1: Formula: (= (ite (= v_~glob1~0_2 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|) InVars {~glob1~0=v_~glob1~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~glob1~0=v_~glob1~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {541#true} is VALID [2022-02-20 20:40:20,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {541#true} [146] L698-1-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {541#true} is VALID [2022-02-20 20:40:20,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {541#true} [150] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {541#true} is VALID [2022-02-20 20:40:20,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {541#true} [135] L19-1-->L19-5: Formula: (not (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_4| 0)) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {541#true} [190] L19-5-->L699: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {541#true} is VALID [2022-02-20 20:40:20,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {541#true} [162] L699-->L699-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {541#true} is VALID [2022-02-20 20:40:20,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {541#true} [133] L699-1-->L699-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {541#true} is VALID [2022-02-20 20:40:20,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {541#true} [121] L699-2-->L699-3: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] {541#true} is VALID [2022-02-20 20:40:20,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {541#true} [222] L699-3-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_6|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_6|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_6|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_6|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_10|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {541#true} is VALID [2022-02-20 20:40:20,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {541#true} [197] t_funENTRY-->L685: Formula: (and (= |v_t_funThread1of1ForFork0_~arg#1.offset_1| |v_t_funThread1of1ForFork0_#in~arg#1.offset_1|) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_1| |v_t_funThread1of1ForFork0_~arg#1.base_1|)) InVars {t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base] {541#true} is VALID [2022-02-20 20:40:20,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {541#true} [198] L685-->L685-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_10| |v_~#mutex1~0.base_10|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet1#1_1| 0) (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#mutex1~0.base_10| (store .cse0 |v_~#mutex1~0.offset_10| 1))) (= (select .cse0 |v_~#mutex1~0.offset_10|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_10|, ~#mutex1~0.base=|v_~#mutex1~0.base_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_1|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_10|, ~#mutex1~0.base=|v_~#mutex1~0.base_10|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1#1] {541#true} is VALID [2022-02-20 20:40:20,773 INFO L290 TraceCheckUtils]: 40: Hoare triple {541#true} [199] L685-1-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1#1] {541#true} is VALID [2022-02-20 20:40:20,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {541#true} [200] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#mutex2~0.base_8|))) (and (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#mutex2~0.base_8| (store .cse0 |v_~#mutex2~0.offset_8| 1))) (= |v_t_funThread1of1ForFork0_#t~nondet2#1_1| 0) (= (select .cse0 |v_~#mutex2~0.offset_8|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_8|, ~#mutex2~0.base=|v_~#mutex2~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_11|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_8|, ~#mutex2~0.base=|v_~#mutex2~0.base_8|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2#1] {541#true} is VALID [2022-02-20 20:40:20,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {541#true} [201] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2#1] {541#true} is VALID [2022-02-20 20:40:20,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {541#true} [202] L687-->L688: Formula: (= 5 v_~glob1~0_5) InVars {} OutVars{~glob1~0=v_~glob1~0_5} AuxVars[] AssignedVars[~glob1~0] {543#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:20,775 INFO L290 TraceCheckUtils]: 44: Hoare triple {543#(= 5 ~glob1~0)} [203] L688-->L689: Formula: (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#mutex2~0.base_9| (store (select |v_#pthreadsMutex_14| |v_~#mutex2~0.base_9|) |v_~#mutex2~0.offset_9| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_9|, ~#mutex2~0.base=|v_~#mutex2~0.base_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_13|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_9|, ~#mutex2~0.base=|v_~#mutex2~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex] {543#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:20,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {543#(= 5 ~glob1~0)} [204] L689-->L689-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#mutex2~0.base_10|))) (and (= (store |v_#pthreadsMutex_16| |v_~#mutex2~0.base_10| (store .cse0 |v_~#mutex2~0.offset_10| 1)) |v_#pthreadsMutex_15|) (= |v_t_funThread1of1ForFork0_#t~nondet3#1_1| 0) (= (select .cse0 |v_~#mutex2~0.offset_10|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_10|, ~#mutex2~0.base=|v_~#mutex2~0.base_10|} OutVars{t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_1|, #pthreadsMutex=|v_#pthreadsMutex_15|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_10|, ~#mutex2~0.base=|v_~#mutex2~0.base_10|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet3#1] {543#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:20,776 INFO L290 TraceCheckUtils]: 46: Hoare triple {543#(= 5 ~glob1~0)} [205] L689-1-->L690: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet3#1] {543#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:20,776 INFO L290 TraceCheckUtils]: 47: Hoare triple {543#(= 5 ~glob1~0)} [206] L690-->L690-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {543#(= 5 ~glob1~0)} is VALID [2022-02-20 20:40:20,777 INFO L290 TraceCheckUtils]: 48: Hoare triple {543#(= 5 ~glob1~0)} [207] L690-1-->L690-2: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1| (ite (= 5 v_~glob1~0_6) 1 0)) InVars {~glob1~0=v_~glob1~0_6} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1|, ~glob1~0=v_~glob1~0_6} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1] {544#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:20,777 INFO L290 TraceCheckUtils]: 49: Hoare triple {544#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} [208] L690-2-->L19: Formula: true InVars {} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {544#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:20,777 INFO L290 TraceCheckUtils]: 50: Hoare triple {544#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} [209] L19-->L19-1: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3| |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_3|) InVars {t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {545#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:20,778 INFO L290 TraceCheckUtils]: 51: Hoare triple {545#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))} [210] L19-1-->L19-2: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5| 0) InVars {t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[] {542#false} is VALID [2022-02-20 20:40:20,780 INFO L290 TraceCheckUtils]: 52: Hoare triple {542#false} [212] L19-2-->t_funErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {542#false} is VALID [2022-02-20 20:40:20,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:40:20,781 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:20,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933029818] [2022-02-20 20:40:20,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933029818] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:20,782 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:20,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:40:20,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500158037] [2022-02-20 20:40:20,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:20,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 20:40:20,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:20,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:20,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:20,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:40:20,846 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:20,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:40:20,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:40:20,848 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 91 [2022-02-20 20:40:20,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 83 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 74.6) internal successors, (373), 5 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:20,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:20,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 91 [2022-02-20 20:40:20,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:20,917 INFO L129 PetriNetUnfolder]: 7/122 cut-off events. [2022-02-20 20:40:20,917 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-02-20 20:40:20,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 122 events. 7/122 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 268 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 173. Up to 10 conditions per place. [2022-02-20 20:40:20,918 INFO L132 encePairwiseOnDemand]: 86/91 looper letters, 8 selfloop transitions, 5 changer transitions 11/83 dead transitions. [2022-02-20 20:40:20,918 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 83 transitions, 272 flow [2022-02-20 20:40:20,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:40:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-02-20 20:40:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 452 transitions. [2022-02-20 20:40:20,923 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8278388278388278 [2022-02-20 20:40:20,923 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 452 transitions. [2022-02-20 20:40:20,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 452 transitions. [2022-02-20 20:40:20,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:20,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 452 transitions. [2022-02-20 20:40:20,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 75.33333333333333) internal successors, (452), 6 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:20,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:20,925 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 91.0) internal successors, (637), 7 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:20,925 INFO L186 Difference]: Start difference. First operand has 91 places, 83 transitions, 236 flow. Second operand 6 states and 452 transitions. [2022-02-20 20:40:20,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 83 transitions, 272 flow [2022-02-20 20:40:20,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 83 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:40:20,933 INFO L242 Difference]: Finished difference. Result has 93 places, 70 transitions, 187 flow [2022-02-20 20:40:20,933 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=93, PETRI_TRANSITIONS=70} [2022-02-20 20:40:20,934 INFO L334 CegarLoopForPetriNet]: 83 programPoint places, 10 predicate places. [2022-02-20 20:40:20,934 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 70 transitions, 187 flow [2022-02-20 20:40:20,939 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 209 states, 208 states have (on average 1.6730769230769231) internal successors, (348), 208 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:20,940 INFO L78 Accepts]: Start accepts. Automaton has has 209 states, 208 states have (on average 1.6730769230769231) internal successors, (348), 208 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-02-20 20:40:20,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:20,940 INFO L470 AbstractCegarLoop]: Abstraction has has 93 places, 70 transitions, 187 flow [2022-02-20 20:40:20,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 74.6) internal successors, (373), 5 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:20,941 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:20,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:20,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:40:20,941 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-20 20:40:20,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:20,942 INFO L85 PathProgramCache]: Analyzing trace with hash -17853359, now seen corresponding path program 1 times [2022-02-20 20:40:20,942 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:20,942 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786581230] [2022-02-20 20:40:20,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:20,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:21,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {763#true} [174] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {763#true} [159] 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] {763#true} is VALID [2022-02-20 20:40:21,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {763#true} [183] 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[] {763#true} is VALID [2022-02-20 20:40:21,001 INFO L290 TraceCheckUtils]: 3: Hoare triple {763#true} [188] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,001 INFO L290 TraceCheckUtils]: 4: Hoare triple {763#true} [140] L18-->L18-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[] {763#true} is VALID [2022-02-20 20:40:21,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {763#true} [175] L18-1-->L18-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[] {763#true} is VALID [2022-02-20 20:40:21,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {763#true} [164] L18-2-->L18-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[] {763#true} is VALID [2022-02-20 20:40:21,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {763#true} [167] L18-3-->L18-4: Formula: (and (= 43 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {763#true} [168] L18-4-->L682: Formula: (= v_~glob1~0_1 0) InVars {} OutVars{~glob1~0=v_~glob1~0_1} AuxVars[] AssignedVars[~glob1~0] {763#true} is VALID [2022-02-20 20:40:21,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {763#true} [111] L682-->L682-1: Formula: (and (= |v_~#mutex1~0.offset_1| 0) (= 3 |v_~#mutex1~0.base_1|)) InVars {} OutVars{~#mutex1~0.offset=|v_~#mutex1~0.offset_1|, ~#mutex1~0.base=|v_~#mutex1~0.base_1|} AuxVars[] AssignedVars[~#mutex1~0.offset, ~#mutex1~0.base] {763#true} is VALID [2022-02-20 20:40:21,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {763#true} [141] L682-1-->L682-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {763#true} [117] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#mutex1~0.base_2|) |v_~#mutex1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_2|, ~#mutex1~0.base=|v_~#mutex1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_2|, ~#mutex1~0.base=|v_~#mutex1~0.base_2|} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {763#true} [186] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#mutex1~0.base_3|) (+ |v_~#mutex1~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_3|, ~#mutex1~0.base=|v_~#mutex1~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_3|, ~#mutex1~0.base=|v_~#mutex1~0.base_3|} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {763#true} [155] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#mutex1~0.base_4|) (+ |v_~#mutex1~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_4|, ~#mutex1~0.base=|v_~#mutex1~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_4|, ~#mutex1~0.base=|v_~#mutex1~0.base_4|} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {763#true} [192] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#mutex1~0.base_5|) (+ |v_~#mutex1~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_5|, ~#mutex1~0.base=|v_~#mutex1~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_5|, ~#mutex1~0.base=|v_~#mutex1~0.base_5|} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {763#true} [132] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#mutex1~0.base_6|) (+ 16 |v_~#mutex1~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_6|, ~#mutex1~0.base=|v_~#mutex1~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_6|, ~#mutex1~0.base=|v_~#mutex1~0.base_6|} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {763#true} [179] L682-7-->L683: Formula: (and (= |v_~#mutex2~0.base_1| 4) (= |v_~#mutex2~0.offset_1| 0)) InVars {} OutVars{~#mutex2~0.base=|v_~#mutex2~0.base_1|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_1|} AuxVars[] AssignedVars[~#mutex2~0.offset, ~#mutex2~0.base] {763#true} is VALID [2022-02-20 20:40:21,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {763#true} [120] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {763#true} [173] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#mutex2~0.base_2|) |v_~#mutex2~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_2|, ~#mutex2~0.base=|v_~#mutex2~0.base_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_2|, ~#mutex2~0.base=|v_~#mutex2~0.base_2|} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {763#true} [158] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_9| |v_~#mutex2~0.base_3|) (+ |v_~#mutex2~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_3|, ~#mutex2~0.base=|v_~#mutex2~0.base_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_3|, ~#mutex2~0.base=|v_~#mutex2~0.base_3|} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {763#true} [180] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#mutex2~0.base_4|) (+ |v_~#mutex2~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_4|, ~#mutex2~0.base=|v_~#mutex2~0.base_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_4|, ~#mutex2~0.base=|v_~#mutex2~0.base_4|} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {763#true} [110] L683-4-->L683-5: Formula: (= (select (select |v_#memory_int_11| |v_~#mutex2~0.base_5|) (+ |v_~#mutex2~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_11|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_5|, ~#mutex2~0.base=|v_~#mutex2~0.base_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_5|, ~#mutex2~0.base=|v_~#mutex2~0.base_5|} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {763#true} [181] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#mutex2~0.base_6|) (+ 16 |v_~#mutex2~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_6|, ~#mutex2~0.base=|v_~#mutex2~0.base_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_6|, ~#mutex2~0.base=|v_~#mutex2~0.base_6|} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {763#true} [156] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {763#true} [191] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {763#true} [166] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {763#true} is VALID [2022-02-20 20:40:21,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {763#true} [124] L-1-5-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre4#1] {763#true} is VALID [2022-02-20 20:40:21,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {763#true} [151] L697-->L697-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {763#true} is VALID [2022-02-20 20:40:21,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {763#true} [125] L697-1-->L698: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {763#true} [148] L698-->L698-1: Formula: (= (ite (= v_~glob1~0_2 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|) InVars {~glob1~0=v_~glob1~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~glob1~0=v_~glob1~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {763#true} is VALID [2022-02-20 20:40:21,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {763#true} [146] L698-1-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {763#true} is VALID [2022-02-20 20:40:21,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {763#true} [150] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {763#true} is VALID [2022-02-20 20:40:21,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {763#true} [135] L19-1-->L19-5: Formula: (not (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_4| 0)) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {763#true} [190] L19-5-->L699: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {763#true} is VALID [2022-02-20 20:40:21,015 INFO L290 TraceCheckUtils]: 34: Hoare triple {763#true} [162] L699-->L699-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {763#true} is VALID [2022-02-20 20:40:21,016 INFO L290 TraceCheckUtils]: 35: Hoare triple {763#true} [133] L699-1-->L699-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {763#true} is VALID [2022-02-20 20:40:21,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {763#true} [121] L699-2-->L699-3: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] {763#true} is VALID [2022-02-20 20:40:21,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {763#true} [222] L699-3-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_6|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_6|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_6|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_6|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_10|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {763#true} is VALID [2022-02-20 20:40:21,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {763#true} [144] L699-4-->L699-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {763#true} is VALID [2022-02-20 20:40:21,017 INFO L290 TraceCheckUtils]: 39: Hoare triple {763#true} [149] L699-5-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {763#true} is VALID [2022-02-20 20:40:21,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {763#true} [189] L700-->L700-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#mutex1~0.base_7|))) (and (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#mutex1~0.base_7| (store .cse0 |v_~#mutex1~0.offset_7| 1))) (= (select .cse0 |v_~#mutex1~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_7|, ~#mutex1~0.base=|v_~#mutex1~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|, ~#mutex1~0.base=|v_~#mutex1~0.base_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {765#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} is VALID [2022-02-20 20:40:21,019 INFO L290 TraceCheckUtils]: 41: Hoare triple {765#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} [193] L700-1-->L701: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {765#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} is VALID [2022-02-20 20:40:21,019 INFO L290 TraceCheckUtils]: 42: Hoare triple {765#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} [176] L701-->L701-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {765#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} is VALID [2022-02-20 20:40:21,020 INFO L290 TraceCheckUtils]: 43: Hoare triple {765#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} [197] t_funENTRY-->L685: Formula: (and (= |v_t_funThread1of1ForFork0_~arg#1.offset_1| |v_t_funThread1of1ForFork0_#in~arg#1.offset_1|) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_1| |v_t_funThread1of1ForFork0_~arg#1.base_1|)) InVars {t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base] {765#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} is VALID [2022-02-20 20:40:21,020 INFO L290 TraceCheckUtils]: 44: Hoare triple {765#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} [198] L685-->L685-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_10| |v_~#mutex1~0.base_10|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet1#1_1| 0) (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#mutex1~0.base_10| (store .cse0 |v_~#mutex1~0.offset_10| 1))) (= (select .cse0 |v_~#mutex1~0.offset_10|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_10|, ~#mutex1~0.base=|v_~#mutex1~0.base_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_1|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_10|, ~#mutex1~0.base=|v_~#mutex1~0.base_10|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1#1] {764#false} is VALID [2022-02-20 20:40:21,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {764#false} [199] L685-1-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1#1] {764#false} is VALID [2022-02-20 20:40:21,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {764#false} [200] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#mutex2~0.base_8|))) (and (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#mutex2~0.base_8| (store .cse0 |v_~#mutex2~0.offset_8| 1))) (= |v_t_funThread1of1ForFork0_#t~nondet2#1_1| 0) (= (select .cse0 |v_~#mutex2~0.offset_8|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_8|, ~#mutex2~0.base=|v_~#mutex2~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_11|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_8|, ~#mutex2~0.base=|v_~#mutex2~0.base_8|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2#1] {764#false} is VALID [2022-02-20 20:40:21,027 INFO L290 TraceCheckUtils]: 47: Hoare triple {764#false} [201] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2#1] {764#false} is VALID [2022-02-20 20:40:21,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {764#false} [202] L687-->L688: Formula: (= 5 v_~glob1~0_5) InVars {} OutVars{~glob1~0=v_~glob1~0_5} AuxVars[] AssignedVars[~glob1~0] {764#false} is VALID [2022-02-20 20:40:21,027 INFO L290 TraceCheckUtils]: 49: Hoare triple {764#false} [136] L701-1-->L701-2: Formula: (= (ite (= v_~glob1~0_3 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_3|) InVars {~glob1~0=v_~glob1~0_3} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_3|, ~glob1~0=v_~glob1~0_3} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {764#false} is VALID [2022-02-20 20:40:21,028 INFO L290 TraceCheckUtils]: 50: Hoare triple {764#false} [142] L701-2-->L19-6: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {764#false} is VALID [2022-02-20 20:40:21,028 INFO L290 TraceCheckUtils]: 51: Hoare triple {764#false} [187] L19-6-->L19-7: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_6| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_6|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {764#false} is VALID [2022-02-20 20:40:21,028 INFO L290 TraceCheckUtils]: 52: Hoare triple {764#false} [113] L19-7-->L19-8: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_7| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[] {764#false} is VALID [2022-02-20 20:40:21,028 INFO L290 TraceCheckUtils]: 53: Hoare triple {764#false} [115] L19-8-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {764#false} is VALID [2022-02-20 20:40:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:40:21,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:21,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786581230] [2022-02-20 20:40:21,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786581230] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:21,029 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:21,029 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:40:21,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086271606] [2022-02-20 20:40:21,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:21,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 20:40:21,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:21,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:21,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:21,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:40:21,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:21,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:40:21,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:40:21,069 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 91 [2022-02-20 20:40:21,069 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 70 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:21,069 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:21,069 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 91 [2022-02-20 20:40:21,070 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:21,104 INFO L129 PetriNetUnfolder]: 2/86 cut-off events. [2022-02-20 20:40:21,104 INFO L130 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-02-20 20:40:21,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 86 events. 2/86 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 3/89 useless extension candidates. Maximal degree in co-relation 121. Up to 14 conditions per place. [2022-02-20 20:40:21,105 INFO L132 encePairwiseOnDemand]: 87/91 looper letters, 11 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2022-02-20 20:40:21,105 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 71 transitions, 219 flow [2022-02-20 20:40:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:40:21,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:40:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 224 transitions. [2022-02-20 20:40:21,108 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8205128205128205 [2022-02-20 20:40:21,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 224 transitions. [2022-02-20 20:40:21,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 224 transitions. [2022-02-20 20:40:21,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:21,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 224 transitions. [2022-02-20 20:40:21,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:21,109 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 20:40:21,109 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 20:40:21,109 INFO L186 Difference]: Start difference. First operand has 93 places, 70 transitions, 187 flow. Second operand 3 states and 224 transitions. [2022-02-20 20:40:21,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 71 transitions, 219 flow [2022-02-20 20:40:21,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 71 transitions, 183 flow, removed 4 selfloop flow, removed 13 redundant places. [2022-02-20 20:40:21,128 INFO L242 Difference]: Finished difference. Result has 77 places, 70 transitions, 159 flow [2022-02-20 20:40:21,129 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=77, PETRI_TRANSITIONS=70} [2022-02-20 20:40:21,129 INFO L334 CegarLoopForPetriNet]: 83 programPoint places, -6 predicate places. [2022-02-20 20:40:21,129 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 70 transitions, 159 flow [2022-02-20 20:40:21,131 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 189 states, 187 states have (on average 1.6310160427807487) internal successors, (305), 188 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:21,132 INFO L78 Accepts]: Start accepts. Automaton has has 189 states, 187 states have (on average 1.6310160427807487) internal successors, (305), 188 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 20:40:21,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:21,132 INFO L470 AbstractCegarLoop]: Abstraction has has 77 places, 70 transitions, 159 flow [2022-02-20 20:40:21,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:21,132 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:21,132 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:21,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:40:21,133 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2022-02-20 20:40:21,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash 124463274, now seen corresponding path program 1 times [2022-02-20 20:40:21,133 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:21,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517181712] [2022-02-20 20:40:21,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:21,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:21,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {957#true} [174] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {957#true} is VALID [2022-02-20 20:40:21,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {957#true} [159] 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] {957#true} is VALID [2022-02-20 20:40:21,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {957#true} [183] 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[] {957#true} is VALID [2022-02-20 20:40:21,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {957#true} [188] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {957#true} is VALID [2022-02-20 20:40:21,251 INFO L290 TraceCheckUtils]: 4: Hoare triple {957#true} [140] L18-->L18-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[] {957#true} is VALID [2022-02-20 20:40:21,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {957#true} [175] L18-1-->L18-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[] {957#true} is VALID [2022-02-20 20:40:21,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {957#true} [164] L18-2-->L18-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[] {957#true} is VALID [2022-02-20 20:40:21,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {957#true} [167] L18-3-->L18-4: Formula: (and (= 43 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {957#true} is VALID [2022-02-20 20:40:21,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {957#true} [168] L18-4-->L682: Formula: (= v_~glob1~0_1 0) InVars {} OutVars{~glob1~0=v_~glob1~0_1} AuxVars[] AssignedVars[~glob1~0] {957#true} is VALID [2022-02-20 20:40:21,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {957#true} [111] L682-->L682-1: Formula: (and (= |v_~#mutex1~0.offset_1| 0) (= 3 |v_~#mutex1~0.base_1|)) InVars {} OutVars{~#mutex1~0.offset=|v_~#mutex1~0.offset_1|, ~#mutex1~0.base=|v_~#mutex1~0.base_1|} AuxVars[] AssignedVars[~#mutex1~0.offset, ~#mutex1~0.base] {959#(<= |~#mutex1~0.base| 3)} is VALID [2022-02-20 20:40:21,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {959#(<= |~#mutex1~0.base| 3)} [141] L682-1-->L682-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {959#(<= |~#mutex1~0.base| 3)} is VALID [2022-02-20 20:40:21,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {959#(<= |~#mutex1~0.base| 3)} [117] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#mutex1~0.base_2|) |v_~#mutex1~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_2|, ~#mutex1~0.base=|v_~#mutex1~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_2|, ~#mutex1~0.base=|v_~#mutex1~0.base_2|} AuxVars[] AssignedVars[] {959#(<= |~#mutex1~0.base| 3)} is VALID [2022-02-20 20:40:21,253 INFO L290 TraceCheckUtils]: 12: Hoare triple {959#(<= |~#mutex1~0.base| 3)} [186] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#mutex1~0.base_3|) (+ |v_~#mutex1~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_3|, ~#mutex1~0.base=|v_~#mutex1~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_3|, ~#mutex1~0.base=|v_~#mutex1~0.base_3|} AuxVars[] AssignedVars[] {959#(<= |~#mutex1~0.base| 3)} is VALID [2022-02-20 20:40:21,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {959#(<= |~#mutex1~0.base| 3)} [155] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#mutex1~0.base_4|) (+ |v_~#mutex1~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_4|, ~#mutex1~0.base=|v_~#mutex1~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_4|, ~#mutex1~0.base=|v_~#mutex1~0.base_4|} AuxVars[] AssignedVars[] {959#(<= |~#mutex1~0.base| 3)} is VALID [2022-02-20 20:40:21,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {959#(<= |~#mutex1~0.base| 3)} [192] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#mutex1~0.base_5|) (+ |v_~#mutex1~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_5|, ~#mutex1~0.base=|v_~#mutex1~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_5|, ~#mutex1~0.base=|v_~#mutex1~0.base_5|} AuxVars[] AssignedVars[] {959#(<= |~#mutex1~0.base| 3)} is VALID [2022-02-20 20:40:21,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {959#(<= |~#mutex1~0.base| 3)} [132] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#mutex1~0.base_6|) (+ 16 |v_~#mutex1~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_6|, ~#mutex1~0.base=|v_~#mutex1~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_6|, ~#mutex1~0.base=|v_~#mutex1~0.base_6|} AuxVars[] AssignedVars[] {959#(<= |~#mutex1~0.base| 3)} is VALID [2022-02-20 20:40:21,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {959#(<= |~#mutex1~0.base| 3)} [179] L682-7-->L683: Formula: (and (= |v_~#mutex2~0.base_1| 4) (= |v_~#mutex2~0.offset_1| 0)) InVars {} OutVars{~#mutex2~0.base=|v_~#mutex2~0.base_1|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_1|} AuxVars[] AssignedVars[~#mutex2~0.offset, ~#mutex2~0.base] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [120] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [173] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#mutex2~0.base_2|) |v_~#mutex2~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_2|, ~#mutex2~0.base=|v_~#mutex2~0.base_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_2|, ~#mutex2~0.base=|v_~#mutex2~0.base_2|} AuxVars[] AssignedVars[] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [158] L683-2-->L683-3: Formula: (= (select (select |v_#memory_int_9| |v_~#mutex2~0.base_3|) (+ |v_~#mutex2~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_9|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_3|, ~#mutex2~0.base=|v_~#mutex2~0.base_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_3|, ~#mutex2~0.base=|v_~#mutex2~0.base_3|} AuxVars[] AssignedVars[] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [180] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#mutex2~0.base_4|) (+ |v_~#mutex2~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_4|, ~#mutex2~0.base=|v_~#mutex2~0.base_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_4|, ~#mutex2~0.base=|v_~#mutex2~0.base_4|} AuxVars[] AssignedVars[] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [110] L683-4-->L683-5: Formula: (= (select (select |v_#memory_int_11| |v_~#mutex2~0.base_5|) (+ |v_~#mutex2~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_11|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_5|, ~#mutex2~0.base=|v_~#mutex2~0.base_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_5|, ~#mutex2~0.base=|v_~#mutex2~0.base_5|} AuxVars[] AssignedVars[] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [181] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#mutex2~0.base_6|) (+ 16 |v_~#mutex2~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_6|, ~#mutex2~0.base=|v_~#mutex2~0.base_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_6|, ~#mutex2~0.base=|v_~#mutex2~0.base_6|} AuxVars[] AssignedVars[] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [156] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,258 INFO L290 TraceCheckUtils]: 24: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [191] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [166] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,259 INFO L290 TraceCheckUtils]: 26: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [124] L-1-5-->L697: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem7#1=|v_ULTIMATE.start_main_#t~mem7#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre4#1] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [151] L697-->L697-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [125] L697-1-->L698: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [148] L698-->L698-1: Formula: (= (ite (= v_~glob1~0_2 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|) InVars {~glob1~0=v_~glob1~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~glob1~0=v_~glob1~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [146] L698-1-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [150] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [135] L19-1-->L19-5: Formula: (not (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_4| 0)) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_4|} AuxVars[] AssignedVars[] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [190] L19-5-->L699: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,272 INFO L290 TraceCheckUtils]: 34: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [162] L699-->L699-1: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [133] L699-1-->L699-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [121] L699-2-->L699-3: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|))) InVars {#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{#memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,273 INFO L290 TraceCheckUtils]: 37: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [222] L699-3-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_6|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_6|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_6|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_6|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_10|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [197] t_funENTRY-->L685: Formula: (and (= |v_t_funThread1of1ForFork0_~arg#1.offset_1| |v_t_funThread1of1ForFork0_#in~arg#1.offset_1|) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_1| |v_t_funThread1of1ForFork0_~arg#1.base_1|)) InVars {t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base] {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} is VALID [2022-02-20 20:40:21,274 INFO L290 TraceCheckUtils]: 39: Hoare triple {960#(not (= |~#mutex1~0.base| |~#mutex2~0.base|))} [198] L685-->L685-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_10| |v_~#mutex1~0.base_10|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet1#1_1| 0) (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#mutex1~0.base_10| (store .cse0 |v_~#mutex1~0.offset_10| 1))) (= (select .cse0 |v_~#mutex1~0.offset_10|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_10|, ~#mutex1~0.base=|v_~#mutex1~0.base_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_1|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_10|, ~#mutex1~0.base=|v_~#mutex1~0.base_10|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1#1] {961#(and (= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1) (not (= |~#mutex1~0.base| |~#mutex2~0.base|)))} is VALID [2022-02-20 20:40:21,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {961#(and (= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1) (not (= |~#mutex1~0.base| |~#mutex2~0.base|)))} [199] L685-1-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1#1] {961#(and (= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1) (not (= |~#mutex1~0.base| |~#mutex2~0.base|)))} is VALID [2022-02-20 20:40:21,275 INFO L290 TraceCheckUtils]: 41: Hoare triple {961#(and (= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1) (not (= |~#mutex1~0.base| |~#mutex2~0.base|)))} [200] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#mutex2~0.base_8|))) (and (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#mutex2~0.base_8| (store .cse0 |v_~#mutex2~0.offset_8| 1))) (= |v_t_funThread1of1ForFork0_#t~nondet2#1_1| 0) (= (select .cse0 |v_~#mutex2~0.offset_8|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_8|, ~#mutex2~0.base=|v_~#mutex2~0.base_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_11|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_8|, ~#mutex2~0.base=|v_~#mutex2~0.base_8|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2#1] {961#(and (= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1) (not (= |~#mutex1~0.base| |~#mutex2~0.base|)))} is VALID [2022-02-20 20:40:21,276 INFO L290 TraceCheckUtils]: 42: Hoare triple {961#(and (= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1) (not (= |~#mutex1~0.base| |~#mutex2~0.base|)))} [201] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2#1] {961#(and (= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1) (not (= |~#mutex1~0.base| |~#mutex2~0.base|)))} is VALID [2022-02-20 20:40:21,276 INFO L290 TraceCheckUtils]: 43: Hoare triple {961#(and (= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1) (not (= |~#mutex1~0.base| |~#mutex2~0.base|)))} [202] L687-->L688: Formula: (= 5 v_~glob1~0_5) InVars {} OutVars{~glob1~0=v_~glob1~0_5} AuxVars[] AssignedVars[~glob1~0] {961#(and (= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1) (not (= |~#mutex1~0.base| |~#mutex2~0.base|)))} is VALID [2022-02-20 20:40:21,277 INFO L290 TraceCheckUtils]: 44: Hoare triple {961#(and (= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1) (not (= |~#mutex1~0.base| |~#mutex2~0.base|)))} [144] L699-4-->L699-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {961#(and (= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1) (not (= |~#mutex1~0.base| |~#mutex2~0.base|)))} is VALID [2022-02-20 20:40:21,277 INFO L290 TraceCheckUtils]: 45: Hoare triple {961#(and (= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1) (not (= |~#mutex1~0.base| |~#mutex2~0.base|)))} [149] L699-5-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {961#(and (= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1) (not (= |~#mutex1~0.base| |~#mutex2~0.base|)))} is VALID [2022-02-20 20:40:21,278 INFO L290 TraceCheckUtils]: 46: Hoare triple {961#(and (= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1) (not (= |~#mutex1~0.base| |~#mutex2~0.base|)))} [203] L688-->L689: Formula: (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#mutex2~0.base_9| (store (select |v_#pthreadsMutex_14| |v_~#mutex2~0.base_9|) |v_~#mutex2~0.offset_9| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_9|, ~#mutex2~0.base=|v_~#mutex2~0.base_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_13|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_9|, ~#mutex2~0.base=|v_~#mutex2~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex] {962#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} is VALID [2022-02-20 20:40:21,278 INFO L290 TraceCheckUtils]: 47: Hoare triple {962#(= (select (select |#pthreadsMutex| |~#mutex1~0.base|) |~#mutex1~0.offset|) 1)} [189] L700-->L700-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#mutex1~0.base_7|))) (and (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#mutex1~0.base_7| (store .cse0 |v_~#mutex1~0.offset_7| 1))) (= (select .cse0 |v_~#mutex1~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_7|, ~#mutex1~0.base=|v_~#mutex1~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|, ~#mutex1~0.base=|v_~#mutex1~0.base_7|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {958#false} is VALID [2022-02-20 20:40:21,278 INFO L290 TraceCheckUtils]: 48: Hoare triple {958#false} [193] L700-1-->L701: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {958#false} is VALID [2022-02-20 20:40:21,278 INFO L290 TraceCheckUtils]: 49: Hoare triple {958#false} [176] L701-->L701-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {958#false} is VALID [2022-02-20 20:40:21,278 INFO L290 TraceCheckUtils]: 50: Hoare triple {958#false} [136] L701-1-->L701-2: Formula: (= (ite (= v_~glob1~0_3 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_3|) InVars {~glob1~0=v_~glob1~0_3} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_3|, ~glob1~0=v_~glob1~0_3} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {958#false} is VALID [2022-02-20 20:40:21,278 INFO L290 TraceCheckUtils]: 51: Hoare triple {958#false} [142] L701-2-->L19-6: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {958#false} is VALID [2022-02-20 20:40:21,279 INFO L290 TraceCheckUtils]: 52: Hoare triple {958#false} [187] L19-6-->L19-7: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_6| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_6|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {958#false} is VALID [2022-02-20 20:40:21,279 INFO L290 TraceCheckUtils]: 53: Hoare triple {958#false} [113] L19-7-->L19-8: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_7| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_7|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_7|} AuxVars[] AssignedVars[] {958#false} is VALID [2022-02-20 20:40:21,279 INFO L290 TraceCheckUtils]: 54: Hoare triple {958#false} [115] L19-8-->ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {958#false} is VALID [2022-02-20 20:40:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:40:21,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:21,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517181712] [2022-02-20 20:40:21,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517181712] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:21,280 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:21,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:40:21,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365822840] [2022-02-20 20:40:21,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:21,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2022-02-20 20:40:21,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:21,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:21,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:21,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:40:21,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:21,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:40:21,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:40:21,332 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 91 [2022-02-20 20:40:21,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 70 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 65.83333333333333) internal successors, (395), 6 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:21,332 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:21,332 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 91 [2022-02-20 20:40:21,332 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:21,443 INFO L129 PetriNetUnfolder]: 0/58 cut-off events. [2022-02-20 20:40:21,443 INFO L130 PetriNetUnfolder]: For 4/5 co-relation queries the response was YES. [2022-02-20 20:40:21,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 58 events. 0/58 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 3/61 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2022-02-20 20:40:21,444 INFO L132 encePairwiseOnDemand]: 87/91 looper letters, 0 selfloop transitions, 0 changer transitions 58/58 dead transitions. [2022-02-20 20:40:21,444 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 58 transitions, 162 flow [2022-02-20 20:40:21,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:40:21,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:40:21,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 334 transitions. [2022-02-20 20:40:21,447 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.734065934065934 [2022-02-20 20:40:21,447 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 334 transitions. [2022-02-20 20:40:21,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 334 transitions. [2022-02-20 20:40:21,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:21,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 334 transitions. [2022-02-20 20:40:21,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:21,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:21,449 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:21,449 INFO L186 Difference]: Start difference. First operand has 77 places, 70 transitions, 159 flow. Second operand 5 states and 334 transitions. [2022-02-20 20:40:21,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 58 transitions, 162 flow [2022-02-20 20:40:21,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 58 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:40:21,455 INFO L242 Difference]: Finished difference. Result has 67 places, 0 transitions, 0 flow [2022-02-20 20:40:21,455 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=67, PETRI_TRANSITIONS=0} [2022-02-20 20:40:21,456 INFO L334 CegarLoopForPetriNet]: 83 programPoint places, -16 predicate places. [2022-02-20 20:40:21,456 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 0 transitions, 0 flow [2022-02-20 20:40:21,456 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:21,456 INFO L78 Accepts]: Start accepts. Automaton has has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 20:40:21,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:21,456 INFO L470 AbstractCegarLoop]: Abstraction has has 67 places, 0 transitions, 0 flow [2022-02-20 20:40:21,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.83333333333333) internal successors, (395), 6 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:21,459 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-02-20 20:40:21,459 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-02-20 20:40:21,459 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 5 remaining) [2022-02-20 20:40:21,460 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-02-20 20:40:21,460 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-02-20 20:40:21,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:40:21,462 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 20:40:21,465 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:40:21,465 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:40:21,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:40:21 BasicIcfg [2022-02-20 20:40:21,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:40:21,469 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:40:21,469 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:40:21,469 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:40:21,470 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:20" (3/4) ... [2022-02-20 20:40:21,471 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:40:21,474 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2022-02-20 20:40:21,478 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-02-20 20:40:21,478 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 20:40:21,478 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 20:40:21,478 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:40:21,510 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:40:21,510 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:40:21,512 INFO L158 Benchmark]: Toolchain (without parser) took 2295.55ms. Allocated memory was 134.2MB in the beginning and 165.7MB in the end (delta: 31.5MB). Free memory was 110.5MB in the beginning and 108.8MB in the end (delta: 1.7MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2022-02-20 20:40:21,512 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 134.2MB. Free memory was 90.5MB in the beginning and 90.4MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:21,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 388.47ms. Allocated memory is still 134.2MB. Free memory was 110.5MB in the beginning and 99.9MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 20:40:21,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.71ms. Allocated memory is still 134.2MB. Free memory was 99.9MB in the beginning and 97.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:21,513 INFO L158 Benchmark]: Boogie Preprocessor took 34.16ms. Allocated memory is still 134.2MB. Free memory was 97.7MB in the beginning and 96.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:21,513 INFO L158 Benchmark]: RCFGBuilder took 322.21ms. Allocated memory is still 134.2MB. Free memory was 96.1MB in the beginning and 83.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 20:40:21,513 INFO L158 Benchmark]: TraceAbstraction took 1453.94ms. Allocated memory was 134.2MB in the beginning and 165.7MB in the end (delta: 31.5MB). Free memory was 82.6MB in the beginning and 110.9MB in the end (delta: -28.3MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2022-02-20 20:40:21,513 INFO L158 Benchmark]: Witness Printer took 40.64ms. Allocated memory is still 165.7MB. Free memory was 110.9MB in the beginning and 108.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:21,515 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 134.2MB. Free memory was 90.5MB in the beginning and 90.4MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 388.47ms. Allocated memory is still 134.2MB. Free memory was 110.5MB in the beginning and 99.9MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.71ms. Allocated memory is still 134.2MB. Free memory was 99.9MB in the beginning and 97.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.16ms. Allocated memory is still 134.2MB. Free memory was 97.7MB in the beginning and 96.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 322.21ms. Allocated memory is still 134.2MB. Free memory was 96.1MB in the beginning and 83.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1453.94ms. Allocated memory was 134.2MB in the beginning and 165.7MB in the end (delta: 31.5MB). Free memory was 82.6MB in the beginning and 110.9MB in the end (delta: -28.3MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Witness Printer took 40.64ms. Allocated memory is still 165.7MB. Free memory was 110.9MB in the beginning and 108.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 114 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 26 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=1, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 196 NumberOfCodeBlocks, 196 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 20:40:21,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE