./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_19-publish-precision_unknown_1_pos.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_19-publish-precision_unknown_1_pos.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 f1ef95a35179200d99984d58302d18a6584e38a2849111bfe4f263e2c30aaebc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:40:12,955 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:40:12,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:40:12,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:40:12,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:40:12,984 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:40:12,986 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:40:12,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:40:12,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:40:12,991 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:40:12,992 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:40:12,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:40:12,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:40:12,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:40:12,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:40:12,995 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:40:12,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:40:12,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:40:12,997 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:40:12,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:40:12,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:40:13,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:40:13,001 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:40:13,002 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:40:13,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:40:13,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:40:13,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:40:13,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:40:13,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:40:13,006 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:40:13,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:40:13,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:40:13,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:40:13,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:40:13,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:40:13,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:40:13,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:40:13,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:40:13,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:40:13,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:40:13,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:40:13,011 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:13,026 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:40:13,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:40:13,026 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:40:13,026 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:40:13,027 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:40:13,027 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:40:13,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:40:13,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:40:13,032 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:40:13,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:40:13,033 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:40:13,033 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:40:13,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:40:13,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:40:13,034 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:40:13,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:40:13,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:40:13,034 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:40:13,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:40:13,034 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:40:13,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:40:13,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:40:13,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:40:13,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:40:13,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:13,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:40:13,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:40:13,036 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:40:13,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:40:13,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:40:13,037 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:40:13,037 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:40:13,037 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:40:13,037 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 -> f1ef95a35179200d99984d58302d18a6584e38a2849111bfe4f263e2c30aaebc [2022-02-20 20:40:13,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:40:13,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:40:13,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:40:13,242 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:40:13,243 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:40:13,246 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_19-publish-precision_unknown_1_pos.i [2022-02-20 20:40:13,301 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d088fa9/e41ea55ab0dc4366853cdc9efc22c429/FLAG073a79573 [2022-02-20 20:40:13,644 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:40:13,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_19-publish-precision_unknown_1_pos.i [2022-02-20 20:40:13,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d088fa9/e41ea55ab0dc4366853cdc9efc22c429/FLAG073a79573 [2022-02-20 20:40:14,029 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d088fa9/e41ea55ab0dc4366853cdc9efc22c429 [2022-02-20 20:40:14,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:40:14,031 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:40:14,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:14,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:40:14,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:40:14,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:14" (1/1) ... [2022-02-20 20:40:14,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c755fb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:14, skipping insertion in model container [2022-02-20 20:40:14,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:14" (1/1) ... [2022-02-20 20:40:14,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:40:14,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:40:14,226 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_19-publish-precision_unknown_1_pos.i[1103,1116] [2022-02-20 20:40:14,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:14,306 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:40:14,313 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_19-publish-precision_unknown_1_pos.i[1103,1116] [2022-02-20 20:40:14,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:14,355 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:40:14,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:14 WrapperNode [2022-02-20 20:40:14,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:14,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:14,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:40:14,357 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:40:14,361 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:14" (1/1) ... [2022-02-20 20:40:14,369 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:14" (1/1) ... [2022-02-20 20:40:14,382 INFO L137 Inliner]: procedures = 162, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2022-02-20 20:40:14,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:14,382 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:40:14,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:40:14,383 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:40:14,387 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:14" (1/1) ... [2022-02-20 20:40:14,387 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:14" (1/1) ... [2022-02-20 20:40:14,389 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:14" (1/1) ... [2022-02-20 20:40:14,389 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:14" (1/1) ... [2022-02-20 20:40:14,393 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:14" (1/1) ... [2022-02-20 20:40:14,394 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:14" (1/1) ... [2022-02-20 20:40:14,395 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:14" (1/1) ... [2022-02-20 20:40:14,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:40:14,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:40:14,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:40:14,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:40:14,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:14" (1/1) ... [2022-02-20 20:40:14,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:14,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:40:14,440 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:14,446 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:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:40:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:40:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:40:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:40:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:40:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-20 20:40:14,474 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-20 20:40:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:40:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:40:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:40:14,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:40:14,476 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:14,596 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:40:14,597 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:40:14,721 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:40:14,727 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:40:14,728 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:40:14,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:14 BoogieIcfgContainer [2022-02-20 20:40:14,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:40:14,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:40:14,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:40:14,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:40:14,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:40:14" (1/3) ... [2022-02-20 20:40:14,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c31fecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:14, skipping insertion in model container [2022-02-20 20:40:14,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:14" (2/3) ... [2022-02-20 20:40:14,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c31fecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:14, skipping insertion in model container [2022-02-20 20:40:14,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:14" (3/3) ... [2022-02-20 20:40:14,735 INFO L111 eAbstractionObserver]: Analyzing ICFG 13-privatized_19-publish-precision_unknown_1_pos.i [2022-02-20 20:40:14,741 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:40:14,741 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:40:14,741 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:40:14,741 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:40:14,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,764 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,764 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,764 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,765 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,765 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,765 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,766 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,766 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,766 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,766 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,767 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,767 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,767 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,767 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,768 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,768 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,768 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,768 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,769 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,771 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,771 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,771 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,771 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,771 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,772 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,772 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:14,776 INFO L148 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-02-20 20:40:14,803 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:40:14,807 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:14,807 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:40:14,813 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 71 transitions, 150 flow [2022-02-20 20:40:14,834 INFO L129 PetriNetUnfolder]: 1/70 cut-off events. [2022-02-20 20:40:14,834 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:14,836 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 70 events. 1/70 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2022-02-20 20:40:14,836 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 71 transitions, 150 flow [2022-02-20 20:40:14,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 56 transitions, 115 flow [2022-02-20 20:40:14,846 INFO L129 PetriNetUnfolder]: 0/51 cut-off events. [2022-02-20 20:40:14,847 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:14,847 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:14,847 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:14,847 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:14,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:14,851 INFO L85 PathProgramCache]: Analyzing trace with hash -881270525, now seen corresponding path program 1 times [2022-02-20 20:40:14,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:14,856 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648438673] [2022-02-20 20:40:14,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:14,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:15,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {77#true} [128] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:15,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {77#true} [116] 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] {77#true} is VALID [2022-02-20 20:40:15,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {77#true} [135] 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[] {77#true} is VALID [2022-02-20 20:40:15,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {77#true} [139] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:15,131 INFO L290 TraceCheckUtils]: 4: Hoare triple {77#true} [99] 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[] {77#true} is VALID [2022-02-20 20:40:15,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {77#true} [129] 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[] {77#true} is VALID [2022-02-20 20:40:15,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {77#true} [120] 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[] {77#true} is VALID [2022-02-20 20:40:15,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {77#true} [123] L18-3-->L18-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 51 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:15,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {77#true} [124] L18-4-->L682: Formula: (= v_~glob1~0_1 0) InVars {} OutVars{~glob1~0=v_~glob1~0_1} AuxVars[] AssignedVars[~glob1~0] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {79#(= ~glob1~0 0)} [81] 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] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {79#(= ~glob1~0 0)} [100] 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[] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {79#(= ~glob1~0 0)} [83] 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[] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {79#(= ~glob1~0 0)} [138] 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[] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {79#(= ~glob1~0 0)} [112] 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[] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {79#(= ~glob1~0 0)} [143] 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[] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {79#(= ~glob1~0 0)} [90] 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[] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {79#(= ~glob1~0 0)} [131] 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] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {79#(= ~glob1~0 0)} [84] 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[] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {79#(= ~glob1~0 0)} [127] 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[] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {79#(= ~glob1~0 0)} [115] 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[] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {79#(= ~glob1~0 0)} [132] 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[] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {79#(= ~glob1~0 0)} [80] 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[] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {79#(= ~glob1~0 0)} [133] 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[] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {79#(= ~glob1~0 0)} [113] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {79#(= ~glob1~0 0)} [142] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {79#(= ~glob1~0 0)} [122] 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] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,161 INFO L290 TraceCheckUtils]: 26: Hoare triple {79#(= ~glob1~0 0)} [88] L-1-5-->L696: 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] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {79#(= ~glob1~0 0)} [125] L696-->L696-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] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {79#(= ~glob1~0 0)} [114] L696-1-->L697: 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] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,163 INFO L290 TraceCheckUtils]: 29: Hoare triple {79#(= ~glob1~0 0)} [108] L697-->L697-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {79#(= ~glob1~0 0)} [89] L697-1-->L697-2: 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] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {79#(= ~glob1~0 0)} [162] L697-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_6|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {79#(= ~glob1~0 0)} [79] L697-3-->L697-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {79#(= ~glob1~0 0)} [102] L697-4-->L698: 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] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {79#(= ~glob1~0 0)} [105] L698-->L698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#mutex2~0.base_7|))) (and (= (select .cse0 |v_~#mutex2~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#mutex2~0.base_7| (store .cse0 |v_~#mutex2~0.offset_7| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_7|, ~#mutex2~0.base=|v_~#mutex2~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_7|, ~#mutex2~0.base=|v_~#mutex2~0.base_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {79#(= ~glob1~0 0)} [104] L698-1-->L699: 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] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,176 INFO L290 TraceCheckUtils]: 36: Hoare triple {79#(= ~glob1~0 0)} [118] L699-->L699-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79#(= ~glob1~0 0)} is VALID [2022-02-20 20:40:15,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {79#(= ~glob1~0 0)} [91] L699-1-->L699-2: 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] {80#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:15,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {80#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [85] L699-2-->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] {80#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:15,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {80#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [107] 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] {81#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:15,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {81#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [92] 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[] {78#false} is VALID [2022-02-20 20:40:15,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {78#false} [110] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {78#false} is VALID [2022-02-20 20:40:15,190 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:15,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:15,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648438673] [2022-02-20 20:40:15,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648438673] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:15,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:15,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:40:15,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756369120] [2022-02-20 20:40:15,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:15,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 20:40:15,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:15,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:15,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:15,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:40:15,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:15,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:40:15,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:40:15,272 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 71 [2022-02-20 20:40:15,275 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 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:15,275 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:15,275 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 71 [2022-02-20 20:40:15,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:15,344 INFO L129 PetriNetUnfolder]: 8/99 cut-off events. [2022-02-20 20:40:15,345 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:15,345 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 99 events. 8/99 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 200 event pairs, 0 based on Foata normal form. 3/102 useless extension candidates. Maximal degree in co-relation 94. Up to 10 conditions per place. [2022-02-20 20:40:15,346 INFO L132 encePairwiseOnDemand]: 65/71 looper letters, 8 selfloop transitions, 3 changer transitions 9/68 dead transitions. [2022-02-20 20:40:15,346 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 68 transitions, 179 flow [2022-02-20 20:40:15,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:40:15,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:40:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 435 transitions. [2022-02-20 20:40:15,365 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8752515090543259 [2022-02-20 20:40:15,366 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 435 transitions. [2022-02-20 20:40:15,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 435 transitions. [2022-02-20 20:40:15,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:15,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 435 transitions. [2022-02-20 20:40:15,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 62.142857142857146) internal successors, (435), 7 states have internal predecessors, (435), 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:15,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 71.0) internal successors, (568), 8 states have internal predecessors, (568), 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:15,377 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 71.0) internal successors, (568), 8 states have internal predecessors, (568), 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:15,378 INFO L186 Difference]: Start difference. First operand has 60 places, 56 transitions, 115 flow. Second operand 7 states and 435 transitions. [2022-02-20 20:40:15,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 68 transitions, 179 flow [2022-02-20 20:40:15,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 68 transitions, 178 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:40:15,382 INFO L242 Difference]: Finished difference. Result has 70 places, 56 transitions, 133 flow [2022-02-20 20:40:15,383 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2022-02-20 20:40:15,385 INFO L334 CegarLoopForPetriNet]: 60 programPoint places, 10 predicate places. [2022-02-20 20:40:15,386 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70 places, 56 transitions, 133 flow [2022-02-20 20:40:15,398 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 167 states, 165 states have (on average 1.6424242424242423) internal successors, (271), 166 states have internal predecessors, (271), 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:15,399 INFO L78 Accepts]: Start accepts. Automaton has has 167 states, 165 states have (on average 1.6424242424242423) internal successors, (271), 166 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-02-20 20:40:15,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:15,399 INFO L470 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 133 flow [2022-02-20 20:40:15,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 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:15,400 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:15,400 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] [2022-02-20 20:40:15,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:40:15,400 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:15,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:15,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1191502746, now seen corresponding path program 1 times [2022-02-20 20:40:15,401 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:15,401 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742208718] [2022-02-20 20:40:15,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:15,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:15,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#true} [128] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#true} is VALID [2022-02-20 20:40:15,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} [116] 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] {262#true} is VALID [2022-02-20 20:40:15,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} [135] 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[] {262#true} is VALID [2022-02-20 20:40:15,462 INFO L290 TraceCheckUtils]: 3: Hoare triple {262#true} [139] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {262#true} is VALID [2022-02-20 20:40:15,462 INFO L290 TraceCheckUtils]: 4: Hoare triple {262#true} [99] 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[] {262#true} is VALID [2022-02-20 20:40:15,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} [129] 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[] {262#true} is VALID [2022-02-20 20:40:15,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {262#true} [120] 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[] {262#true} is VALID [2022-02-20 20:40:15,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {262#true} [123] L18-3-->L18-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 51 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {262#true} is VALID [2022-02-20 20:40:15,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {262#true} [124] L18-4-->L682: Formula: (= v_~glob1~0_1 0) InVars {} OutVars{~glob1~0=v_~glob1~0_1} AuxVars[] AssignedVars[~glob1~0] {262#true} is VALID [2022-02-20 20:40:15,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {262#true} [81] 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] {262#true} is VALID [2022-02-20 20:40:15,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {262#true} [100] 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[] {262#true} is VALID [2022-02-20 20:40:15,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#true} [83] 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[] {262#true} is VALID [2022-02-20 20:40:15,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {262#true} [138] 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[] {262#true} is VALID [2022-02-20 20:40:15,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {262#true} [112] 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[] {262#true} is VALID [2022-02-20 20:40:15,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {262#true} [143] 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[] {262#true} is VALID [2022-02-20 20:40:15,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {262#true} [90] 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[] {262#true} is VALID [2022-02-20 20:40:15,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {262#true} [131] 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] {262#true} is VALID [2022-02-20 20:40:15,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {262#true} [84] 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[] {262#true} is VALID [2022-02-20 20:40:15,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {262#true} [127] 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[] {262#true} is VALID [2022-02-20 20:40:15,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {262#true} [115] 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[] {262#true} is VALID [2022-02-20 20:40:15,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {262#true} [132] 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[] {262#true} is VALID [2022-02-20 20:40:15,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {262#true} [80] 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[] {262#true} is VALID [2022-02-20 20:40:15,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {262#true} [133] 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[] {262#true} is VALID [2022-02-20 20:40:15,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {262#true} [113] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#true} is VALID [2022-02-20 20:40:15,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {262#true} [142] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {262#true} is VALID [2022-02-20 20:40:15,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {262#true} [122] 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] {262#true} is VALID [2022-02-20 20:40:15,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {262#true} [88] L-1-5-->L696: 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] {262#true} is VALID [2022-02-20 20:40:15,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {262#true} [125] L696-->L696-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] {262#true} is VALID [2022-02-20 20:40:15,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {262#true} [114] L696-1-->L697: 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] {262#true} is VALID [2022-02-20 20:40:15,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {262#true} [108] L697-->L697-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {262#true} is VALID [2022-02-20 20:40:15,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {262#true} [89] L697-1-->L697-2: 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] {262#true} is VALID [2022-02-20 20:40:15,476 INFO L290 TraceCheckUtils]: 31: Hoare triple {262#true} [162] L697-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_6|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {262#true} is VALID [2022-02-20 20:40:15,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {262#true} [147] t_funENTRY-->L685: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_1| v_t_funThread1of1ForFork0_~arg.base_1) (= v_t_funThread1of1ForFork0_~arg.offset_1 |v_t_funThread1of1ForFork0_#in~arg.offset_1|)) InVars {t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|} OutVars{t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_1, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_1} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_~arg.base] {262#true} is VALID [2022-02-20 20:40:15,477 INFO L290 TraceCheckUtils]: 33: Hoare triple {262#true} [148] L685-->L685-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_6| |v_~#mutex1~0.base_7|))) (and (= 0 (select .cse0 |v_~#mutex1~0.offset_7|)) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0) (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#mutex1~0.base_7| (store .cse0 |v_~#mutex1~0.offset_7| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_7|, ~#mutex1~0.base=|v_~#mutex1~0.base_7|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|, #pthreadsMutex=|v_#pthreadsMutex_5|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_7|, ~#mutex1~0.base=|v_~#mutex1~0.base_7|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {262#true} is VALID [2022-02-20 20:40:15,477 INFO L290 TraceCheckUtils]: 34: Hoare triple {262#true} [149] L685-1-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {262#true} is VALID [2022-02-20 20:40:15,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {262#true} [150] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#mutex2~0.base_9|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet2_1| 0) (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#mutex2~0.base_9| (store .cse0 |v_~#mutex2~0.offset_9| 1))) (= (select .cse0 |v_~#mutex2~0.offset_9|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_9|, ~#mutex2~0.base=|v_~#mutex2~0.base_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_1|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_9|, ~#mutex2~0.base=|v_~#mutex2~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2] {264#(= (select (select |#pthreadsMutex| |~#mutex2~0.base|) |~#mutex2~0.offset|) 1)} is VALID [2022-02-20 20:40:15,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {264#(= (select (select |#pthreadsMutex| |~#mutex2~0.base|) |~#mutex2~0.offset|) 1)} [151] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2] {264#(= (select (select |#pthreadsMutex| |~#mutex2~0.base|) |~#mutex2~0.offset|) 1)} is VALID [2022-02-20 20:40:15,479 INFO L290 TraceCheckUtils]: 37: Hoare triple {264#(= (select (select |#pthreadsMutex| |~#mutex2~0.base|) |~#mutex2~0.offset|) 1)} [152] L687-->L688: Formula: (= 5 v_~glob1~0_3) InVars {} OutVars{~glob1~0=v_~glob1~0_3} AuxVars[] AssignedVars[~glob1~0] {264#(= (select (select |#pthreadsMutex| |~#mutex2~0.base|) |~#mutex2~0.offset|) 1)} is VALID [2022-02-20 20:40:15,479 INFO L290 TraceCheckUtils]: 38: Hoare triple {264#(= (select (select |#pthreadsMutex| |~#mutex2~0.base|) |~#mutex2~0.offset|) 1)} [79] L697-3-->L697-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {264#(= (select (select |#pthreadsMutex| |~#mutex2~0.base|) |~#mutex2~0.offset|) 1)} is VALID [2022-02-20 20:40:15,480 INFO L290 TraceCheckUtils]: 39: Hoare triple {264#(= (select (select |#pthreadsMutex| |~#mutex2~0.base|) |~#mutex2~0.offset|) 1)} [102] L697-4-->L698: 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] {264#(= (select (select |#pthreadsMutex| |~#mutex2~0.base|) |~#mutex2~0.offset|) 1)} is VALID [2022-02-20 20:40:15,480 INFO L290 TraceCheckUtils]: 40: Hoare triple {264#(= (select (select |#pthreadsMutex| |~#mutex2~0.base|) |~#mutex2~0.offset|) 1)} [105] L698-->L698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#mutex2~0.base_7|))) (and (= (select .cse0 |v_~#mutex2~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#mutex2~0.base_7| (store .cse0 |v_~#mutex2~0.offset_7| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_7|, ~#mutex2~0.base=|v_~#mutex2~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_7|, ~#mutex2~0.base=|v_~#mutex2~0.base_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {263#false} is VALID [2022-02-20 20:40:15,481 INFO L290 TraceCheckUtils]: 41: Hoare triple {263#false} [104] L698-1-->L699: 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] {263#false} is VALID [2022-02-20 20:40:15,481 INFO L290 TraceCheckUtils]: 42: Hoare triple {263#false} [118] L699-->L699-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {263#false} is VALID [2022-02-20 20:40:15,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {263#false} [91] L699-1-->L699-2: 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] {263#false} is VALID [2022-02-20 20:40:15,481 INFO L290 TraceCheckUtils]: 44: Hoare triple {263#false} [85] L699-2-->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] {263#false} is VALID [2022-02-20 20:40:15,482 INFO L290 TraceCheckUtils]: 45: Hoare triple {263#false} [107] 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] {263#false} is VALID [2022-02-20 20:40:15,484 INFO L290 TraceCheckUtils]: 46: Hoare triple {263#false} [92] 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[] {263#false} is VALID [2022-02-20 20:40:15,484 INFO L290 TraceCheckUtils]: 47: Hoare triple {263#false} [110] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {263#false} is VALID [2022-02-20 20:40:15,484 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:15,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:15,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742208718] [2022-02-20 20:40:15,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742208718] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:15,485 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:15,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:40:15,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501234290] [2022-02-20 20:40:15,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:15,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 20:40:15,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:15,490 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:15,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:15,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:40:15,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:15,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:40:15,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:40:15,534 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 71 [2022-02-20 20:40:15,535 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:15,536 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:15,539 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 71 [2022-02-20 20:40:15,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:15,596 INFO L129 PetriNetUnfolder]: 1/72 cut-off events. [2022-02-20 20:40:15,597 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-02-20 20:40:15,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 72 events. 1/72 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 4/76 useless extension candidates. Maximal degree in co-relation 99. Up to 13 conditions per place. [2022-02-20 20:40:15,597 INFO L132 encePairwiseOnDemand]: 65/71 looper letters, 8 selfloop transitions, 3 changer transitions 9/58 dead transitions. [2022-02-20 20:40:15,598 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 58 transitions, 169 flow [2022-02-20 20:40:15,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:40:15,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:40:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2022-02-20 20:40:15,600 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8356807511737089 [2022-02-20 20:40:15,600 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 178 transitions. [2022-02-20 20:40:15,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 178 transitions. [2022-02-20 20:40:15,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:15,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 178 transitions. [2022-02-20 20:40:15,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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:15,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 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:15,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 71.0) internal successors, (284), 4 states have internal predecessors, (284), 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:15,602 INFO L186 Difference]: Start difference. First operand has 70 places, 56 transitions, 133 flow. Second operand 3 states and 178 transitions. [2022-02-20 20:40:15,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 58 transitions, 169 flow [2022-02-20 20:40:15,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 58 transitions, 155 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-02-20 20:40:15,604 INFO L242 Difference]: Finished difference. Result has 62 places, 49 transitions, 110 flow [2022-02-20 20:40:15,605 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=62, PETRI_TRANSITIONS=49} [2022-02-20 20:40:15,605 INFO L334 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2022-02-20 20:40:15,605 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 62 places, 49 transitions, 110 flow [2022-02-20 20:40:15,607 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 76 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 75 states have internal predecessors, (98), 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:15,608 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 75 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-02-20 20:40:15,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:15,608 INFO L470 AbstractCegarLoop]: Abstraction has has 62 places, 49 transitions, 110 flow [2022-02-20 20:40:15,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:15,609 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:15,609 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] [2022-02-20 20:40:15,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:40:15,609 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:15,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:15,610 INFO L85 PathProgramCache]: Analyzing trace with hash 576623755, now seen corresponding path program 1 times [2022-02-20 20:40:15,610 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:15,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859421792] [2022-02-20 20:40:15,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:15,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:40:15,655 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:40:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:40:15,704 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:40:15,704 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:40:15,705 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 20:40:15,707 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 2 remaining) [2022-02-20 20:40:15,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:40:15,710 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 20:40:15,713 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:40:15,713 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:40:15,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:40:15 BasicIcfg [2022-02-20 20:40:15,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:40:15,749 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:40:15,749 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:40:15,749 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:40:15,750 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:14" (3/4) ... [2022-02-20 20:40:15,751 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 20:40:15,791 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:40:15,791 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:40:15,792 INFO L158 Benchmark]: Toolchain (without parser) took 1760.34ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 52.8MB in the beginning and 51.6MB in the end (delta: 1.1MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2022-02-20 20:40:15,792 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 58.8MB in the beginning and 58.8MB in the end (delta: 27.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:15,793 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.85ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 52.6MB in the beginning and 76.7MB in the end (delta: -24.0MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-02-20 20:40:15,793 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.43ms. Allocated memory is still 111.1MB. Free memory was 76.7MB in the beginning and 74.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:15,793 INFO L158 Benchmark]: Boogie Preprocessor took 13.83ms. Allocated memory is still 111.1MB. Free memory was 74.5MB in the beginning and 73.1MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 20:40:15,793 INFO L158 Benchmark]: RCFGBuilder took 333.32ms. Allocated memory is still 111.1MB. Free memory was 73.1MB in the beginning and 87.5MB in the end (delta: -14.4MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2022-02-20 20:40:15,794 INFO L158 Benchmark]: TraceAbstraction took 1017.84ms. Allocated memory is still 111.1MB. Free memory was 87.1MB in the beginning and 57.9MB in the end (delta: 29.2MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2022-02-20 20:40:15,794 INFO L158 Benchmark]: Witness Printer took 41.86ms. Allocated memory is still 111.1MB. Free memory was 57.9MB in the beginning and 51.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 20:40:15,798 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.16ms. Allocated memory is still 88.1MB. Free memory was 58.8MB in the beginning and 58.8MB in the end (delta: 27.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.85ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 52.6MB in the beginning and 76.7MB in the end (delta: -24.0MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.43ms. Allocated memory is still 111.1MB. Free memory was 76.7MB in the beginning and 74.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.83ms. Allocated memory is still 111.1MB. Free memory was 74.5MB in the beginning and 73.1MB in the end (delta: 1.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 333.32ms. Allocated memory is still 111.1MB. Free memory was 73.1MB in the beginning and 87.5MB in the end (delta: -14.4MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1017.84ms. Allocated memory is still 111.1MB. Free memory was 87.1MB in the beginning and 57.9MB in the end (delta: 29.2MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * Witness Printer took 41.86ms. Allocated memory is still 111.1MB. Free memory was 57.9MB in the beginning and 51.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L681] 0 int glob1 = 0; VAL [glob1=0] [L682] 0 pthread_mutex_t mutex1 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [glob1=0, mutex1={3:0}] [L683] 0 pthread_mutex_t mutex2 = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [glob1=0, mutex1={3:0}, mutex2={4:0}] [L696] 0 pthread_t id; VAL [glob1=0, id={5:0}, mutex1={3:0}, mutex2={4:0}] [L697] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [arg={0:0}, glob1=0, id={5:0}, mutex1={3:0}, mutex2={4:0}, pthread_create(&id, ((void *)0), t_fun, ((void *)0))=-1] [L687] 1 glob1 = 5 VAL [arg={0:0}, arg={0:0}, glob1=5, mutex1={3:0}, mutex2={4:0}] [L699] CALL 0 __VERIFIER_assert(glob1 == 0) [L19] COND TRUE 0 !(cond) VAL [\old(cond)=0, arg={0:0}, arg={0:0}, cond=0, glob1=5, mutex1={3:0}, mutex2={4:0}] [L19] 0 reach_error() VAL [\old(cond)=0, arg={0:0}, arg={0:0}, cond=0, glob1=5, mutex1={3:0}, mutex2={4:0}] - UnprovableResult [Line: 697]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 87 locations, 2 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: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 21 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=1, InterpolantAutomatonStates: 10, 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.3s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 185 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 RESULT: Ultimate proved your program to be incorrect! [2022-02-20 20:40:15,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE