./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_45-traces-per-global-and-current-lock-mine-incomparable_true.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/13-privatized_45-traces-per-global-and-current-lock-mine-incomparable_true.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eab672eda1edfc97284913525627300d4c299ae27e8726a3a4858e3cefa92c8f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:40:53,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:40:53,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:40:53,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:40:53,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:40:53,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:40:53,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:40:53,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:40:53,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:40:53,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:40:53,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:40:53,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:40:53,099 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:40:53,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:40:53,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:40:53,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:40:53,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:40:53,103 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:40:53,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:40:53,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:40:53,107 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:40:53,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:40:53,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:40:53,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:40:53,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:40:53,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:40:53,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:40:53,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:40:53,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:40:53,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:40:53,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:40:53,116 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:40:53,117 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:40:53,118 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:40:53,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:40:53,119 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:40:53,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:40:53,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:40:53,120 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:40:53,121 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:40:53,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:40:53,122 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:53,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:40:53,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:40:53,142 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:40:53,143 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:40:53,143 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:40:53,143 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:40:53,144 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:40:53,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:40:53,144 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:40:53,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:40:53,144 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:40:53,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:40:53,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:40:53,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:40:53,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:40:53,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:40:53,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:40:53,145 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:40:53,145 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:40:53,146 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:40:53,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:40:53,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:40:53,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:40:53,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:40:53,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:53,146 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:40:53,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:40:53,147 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:40:53,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:40:53,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:40:53,152 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:40:53,152 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:40:53,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:40:53,152 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 -> eab672eda1edfc97284913525627300d4c299ae27e8726a3a4858e3cefa92c8f [2022-02-20 20:40:53,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:40:53,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:40:53,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:40:53,361 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:40:53,362 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:40:53,363 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_45-traces-per-global-and-current-lock-mine-incomparable_true.i [2022-02-20 20:40:53,425 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/125828b79/ad5689cb43cf4789997231dc684b40cf/FLAGf70ccf20a [2022-02-20 20:40:53,867 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:40:53,868 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_45-traces-per-global-and-current-lock-mine-incomparable_true.i [2022-02-20 20:40:53,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/125828b79/ad5689cb43cf4789997231dc684b40cf/FLAGf70ccf20a [2022-02-20 20:40:54,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/125828b79/ad5689cb43cf4789997231dc684b40cf [2022-02-20 20:40:54,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:40:54,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:40:54,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:54,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:40:54,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:40:54,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:54" (1/1) ... [2022-02-20 20:40:54,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc92cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:54, skipping insertion in model container [2022-02-20 20:40:54,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:54" (1/1) ... [2022-02-20 20:40:54,408 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:40:54,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:40:54,597 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_45-traces-per-global-and-current-lock-mine-incomparable_true.i[1129,1142] [2022-02-20 20:40:54,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:54,708 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:40:54,717 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_45-traces-per-global-and-current-lock-mine-incomparable_true.i[1129,1142] [2022-02-20 20:40:54,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:54,794 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:40:54,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:54 WrapperNode [2022-02-20 20:40:54,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:54,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:54,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:40:54,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:40:54,810 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:54" (1/1) ... [2022-02-20 20:40:54,839 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:54" (1/1) ... [2022-02-20 20:40:54,858 INFO L137 Inliner]: procedures = 162, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2022-02-20 20:40:54,859 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:54,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:40:54,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:40:54,860 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:40:54,866 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:54" (1/1) ... [2022-02-20 20:40:54,866 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:54" (1/1) ... [2022-02-20 20:40:54,875 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:54" (1/1) ... [2022-02-20 20:40:54,876 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:54" (1/1) ... [2022-02-20 20:40:54,888 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:54" (1/1) ... [2022-02-20 20:40:54,890 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:54" (1/1) ... [2022-02-20 20:40:54,896 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:54" (1/1) ... [2022-02-20 20:40:54,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:40:54,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:40:54,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:40:54,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:40:54,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:54" (1/1) ... [2022-02-20 20:40:54,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:54,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:40:54,944 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:54,952 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:54,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:40:54,980 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:40:54,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:40:54,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:40:54,980 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-20 20:40:54,980 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-20 20:40:54,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:40:54,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:40:54,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:40:54,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:40:54,983 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:55,107 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:40:55,108 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:40:55,222 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:40:55,228 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:40:55,228 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:40:55,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:55 BoogieIcfgContainer [2022-02-20 20:40:55,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:40:55,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:40:55,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:40:55,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:40:55,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:40:54" (1/3) ... [2022-02-20 20:40:55,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676ee077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:55, skipping insertion in model container [2022-02-20 20:40:55,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:54" (2/3) ... [2022-02-20 20:40:55,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676ee077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:55, skipping insertion in model container [2022-02-20 20:40:55,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:55" (3/3) ... [2022-02-20 20:40:55,237 INFO L111 eAbstractionObserver]: Analyzing ICFG 13-privatized_45-traces-per-global-and-current-lock-mine-incomparable_true.i [2022-02-20 20:40:55,241 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:40:55,241 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:40:55,241 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:40:55,241 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:40:55,316 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:55,316 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:55,317 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,317 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,317 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:55,318 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:55,318 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,318 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,318 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,319 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,319 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,320 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,320 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,320 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,322 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,322 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,323 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,324 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,324 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,327 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,327 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,328 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,328 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:55,338 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:40:55,399 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:40:55,407 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:55,407 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:40:55,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 71 transitions, 147 flow [2022-02-20 20:40:55,483 INFO L129 PetriNetUnfolder]: 1/70 cut-off events. [2022-02-20 20:40:55,485 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:55,488 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 70 events. 1/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2022-02-20 20:40:55,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 71 transitions, 147 flow [2022-02-20 20:40:55,493 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 58 transitions, 119 flow [2022-02-20 20:40:55,521 INFO L129 PetriNetUnfolder]: 0/57 cut-off events. [2022-02-20 20:40:55,525 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:55,525 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:55,526 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:55,526 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:55,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:55,531 INFO L85 PathProgramCache]: Analyzing trace with hash 534822066, now seen corresponding path program 1 times [2022-02-20 20:40:55,539 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:55,539 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521499287] [2022-02-20 20:40:55,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:55,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:55,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {77#true} [125] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:55,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {77#true} [110] 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:55,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {77#true} [134] 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:55,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {77#true} [138] 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:55,822 INFO L290 TraceCheckUtils]: 4: Hoare triple {77#true} [96] 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:55,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {77#true} [126] 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:55,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {77#true} [116] 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:55,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {77#true} [119] L18-3-->L18-4: Formula: (and (= 77 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:55,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {77#true} [120] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {77#true} is VALID [2022-02-20 20:40:55,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {77#true} [79] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {77#true} is VALID [2022-02-20 20:40:55,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {77#true} [97] 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[] {77#true} is VALID [2022-02-20 20:40:55,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {77#true} [81] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:55,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {77#true} [137] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:55,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {77#true} [105] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:55,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {77#true} [143] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:55,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {77#true} [88] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:55,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {77#true} [129] L682-7-->L683: Formula: (and (= 4 |v_~#B~0.base_1|) (= |v_~#B~0.offset_1| 0)) InVars {} OutVars{~#B~0.base=|v_~#B~0.base_1|, ~#B~0.offset=|v_~#B~0.offset_1|} AuxVars[] AssignedVars[~#B~0.base, ~#B~0.offset] {77#true} is VALID [2022-02-20 20:40:55,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {77#true} [83] 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[] {77#true} is VALID [2022-02-20 20:40:55,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {77#true} [124] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#B~0.base_2|) |v_~#B~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:55,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {77#true} [108] L683-2-->L683-3: Formula: (= 0 (select (select |v_#memory_int_9| |v_~#B~0.base_3|) (+ |v_~#B~0.offset_3| 4))) InVars {#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:55,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {77#true} [130] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#B~0.base_4|) (+ |v_~#B~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:55,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {77#true} [78] L683-4-->L683-5: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_11| |v_~#B~0.base_5|) (+ |v_~#B~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:55,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {77#true} [131] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#B~0.base_6|) (+ |v_~#B~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:55,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {77#true} [106] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:55,828 INFO L290 TraceCheckUtils]: 24: Hoare triple {77#true} [142] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:55,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {77#true} [118] 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] {77#true} is VALID [2022-02-20 20:40:55,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {77#true} [87] L-1-5-->L693: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#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_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre3#1] {77#true} is VALID [2022-02-20 20:40:55,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {77#true} [127] L693-->L693-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] {77#true} is VALID [2022-02-20 20:40:55,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {77#true} [80] L693-1-->L694: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {77#true} is VALID [2022-02-20 20:40:55,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {77#true} [91] L694-->L694-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {77#true} is VALID [2022-02-20 20:40:55,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {77#true} [114] L694-1-->L694-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~pre3#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int] {77#true} is VALID [2022-02-20 20:40:55,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {77#true} [158] L694-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre3#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#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_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#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_thidvar0, t_funThread1of1ForFork0_#res.offset] {77#true} is VALID [2022-02-20 20:40:55,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {77#true} [86] L694-3-->L694-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {77#true} is VALID [2022-02-20 20:40:55,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {77#true} [90] L694-4-->L695: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {77#true} is VALID [2022-02-20 20:40:55,831 INFO L290 TraceCheckUtils]: 34: Hoare triple {77#true} [140] L695-->L695-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#A~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet5#1_2| 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))) (= (select .cse0 |v_~#A~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet5#1] {77#true} is VALID [2022-02-20 20:40:55,831 INFO L290 TraceCheckUtils]: 35: Hoare triple {77#true} [109] L695-1-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {77#true} is VALID [2022-02-20 20:40:55,831 INFO L290 TraceCheckUtils]: 36: Hoare triple {77#true} [121] L696-->L696-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#B~0.base_7|))) (and (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#B~0.base_7| (store .cse0 |v_~#B~0.offset_7| 1))) (= (select .cse0 |v_~#B~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {77#true} is VALID [2022-02-20 20:40:55,831 INFO L290 TraceCheckUtils]: 37: Hoare triple {77#true} [107] L696-1-->L697: 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] {77#true} is VALID [2022-02-20 20:40:55,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {77#true} [101] L697-->L698: Formula: (= 42 v_~g~0_2) InVars {} OutVars{~g~0=v_~g~0_2} AuxVars[] AssignedVars[~g~0] {79#(= 42 ~g~0)} is VALID [2022-02-20 20:40:55,833 INFO L290 TraceCheckUtils]: 39: Hoare triple {79#(= 42 ~g~0)} [99] L698-->L699: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#B~0.base_8| (store (select |v_#pthreadsMutex_6| |v_~#B~0.base_8|) |v_~#B~0.offset_8| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#B~0.base=|v_~#B~0.base_8|, ~#B~0.offset=|v_~#B~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#B~0.base=|v_~#B~0.base_8|, ~#B~0.offset=|v_~#B~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex] {79#(= 42 ~g~0)} is VALID [2022-02-20 20:40:55,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {79#(= 42 ~g~0)} [113] L699-->L699-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#B~0.base_9|))) (and (= |v_ULTIMATE.start_main_#t~nondet7#1_2| 0) (= (select .cse0 |v_~#B~0.offset_9|) 0) (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#B~0.base_9| (store .cse0 |v_~#B~0.offset_9| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet7#1] {79#(= 42 ~g~0)} is VALID [2022-02-20 20:40:55,835 INFO L290 TraceCheckUtils]: 41: Hoare triple {79#(= 42 ~g~0)} [89] L699-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {79#(= 42 ~g~0)} is VALID [2022-02-20 20:40:55,835 INFO L290 TraceCheckUtils]: 42: Hoare triple {79#(= 42 ~g~0)} [139] L700-->L700-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79#(= 42 ~g~0)} is VALID [2022-02-20 20:40:55,836 INFO L290 TraceCheckUtils]: 43: Hoare triple {79#(= 42 ~g~0)} [144] L700-1-->L700-2: Formula: (= (ite (= 42 v_~g~0_3) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|) InVars {~g~0=v_~g~0_3} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_3} 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:55,837 INFO L290 TraceCheckUtils]: 44: Hoare triple {80#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [98] L700-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:55,837 INFO L290 TraceCheckUtils]: 45: Hoare triple {80#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [100] 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:55,838 INFO L290 TraceCheckUtils]: 46: 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:55,838 INFO L290 TraceCheckUtils]: 47: Hoare triple {78#false} [103] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {78#false} is VALID [2022-02-20 20:40:55,839 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:55,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:55,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521499287] [2022-02-20 20:40:55,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521499287] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:55,841 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:55,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:40:55,842 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279209076] [2022-02-20 20:40:55,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:55,854 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:55,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:55,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 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:55,904 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:55,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:40:55,904 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:55,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:40:55,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:40:55,924 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 71 [2022-02-20 20:40:55,927 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 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:55,927 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:55,927 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 71 [2022-02-20 20:40:55,928 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:56,044 INFO L129 PetriNetUnfolder]: 2/87 cut-off events. [2022-02-20 20:40:56,045 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:56,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 87 events. 2/87 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 148 event pairs, 0 based on Foata normal form. 3/89 useless extension candidates. Maximal degree in co-relation 74. Up to 9 conditions per place. [2022-02-20 20:40:56,047 INFO L132 encePairwiseOnDemand]: 66/71 looper letters, 6 selfloop transitions, 2 changer transitions 8/66 dead transitions. [2022-02-20 20:40:56,048 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 66 transitions, 167 flow [2022-02-20 20:40:56,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:40:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:40:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 438 transitions. [2022-02-20 20:40:56,082 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8812877263581489 [2022-02-20 20:40:56,082 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 438 transitions. [2022-02-20 20:40:56,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 438 transitions. [2022-02-20 20:40:56,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:56,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 438 transitions. [2022-02-20 20:40:56,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 62.57142857142857) internal successors, (438), 7 states have internal predecessors, (438), 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:56,099 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:56,100 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:56,102 INFO L186 Difference]: Start difference. First operand has 62 places, 58 transitions, 119 flow. Second operand 7 states and 438 transitions. [2022-02-20 20:40:56,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 66 transitions, 167 flow [2022-02-20 20:40:56,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 66 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:40:56,114 INFO L242 Difference]: Finished difference. Result has 72 places, 58 transitions, 134 flow [2022-02-20 20:40:56,116 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=134, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2022-02-20 20:40:56,121 INFO L334 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2022-02-20 20:40:56,122 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 58 transitions, 134 flow [2022-02-20 20:40:56,142 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 154 states, 153 states have (on average 1.6209150326797386) internal successors, (248), 153 states have internal predecessors, (248), 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:56,145 INFO L78 Accepts]: Start accepts. Automaton has has 154 states, 153 states have (on average 1.6209150326797386) internal successors, (248), 153 states have internal predecessors, (248), 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:56,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:56,147 INFO L470 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 134 flow [2022-02-20 20:40:56,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 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:56,148 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:56,148 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:56,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:40:56,149 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:56,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:56,149 INFO L85 PathProgramCache]: Analyzing trace with hash -381449297, now seen corresponding path program 1 times [2022-02-20 20:40:56,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:56,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370860259] [2022-02-20 20:40:56,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:56,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:56,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {249#true} [125] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:56,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {249#true} [110] 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] {249#true} is VALID [2022-02-20 20:40:56,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {249#true} [134] 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[] {249#true} is VALID [2022-02-20 20:40:56,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {249#true} [138] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:56,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {249#true} [96] 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[] {249#true} is VALID [2022-02-20 20:40:56,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {249#true} [126] 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[] {249#true} is VALID [2022-02-20 20:40:56,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {249#true} [116] 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[] {249#true} is VALID [2022-02-20 20:40:56,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {249#true} [119] L18-3-->L18-4: Formula: (and (= 77 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:56,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {249#true} [120] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {249#true} is VALID [2022-02-20 20:40:56,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {249#true} [79] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {249#true} is VALID [2022-02-20 20:40:56,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {249#true} [97] 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[] {249#true} is VALID [2022-02-20 20:40:56,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {249#true} [81] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:56,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {249#true} [137] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:56,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {249#true} [105] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:56,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {249#true} [143] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:56,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {249#true} [88] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:56,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {249#true} [129] L682-7-->L683: Formula: (and (= 4 |v_~#B~0.base_1|) (= |v_~#B~0.offset_1| 0)) InVars {} OutVars{~#B~0.base=|v_~#B~0.base_1|, ~#B~0.offset=|v_~#B~0.offset_1|} AuxVars[] AssignedVars[~#B~0.base, ~#B~0.offset] {249#true} is VALID [2022-02-20 20:40:56,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {249#true} [83] 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[] {249#true} is VALID [2022-02-20 20:40:56,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {249#true} [124] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#B~0.base_2|) |v_~#B~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:56,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {249#true} [108] L683-2-->L683-3: Formula: (= 0 (select (select |v_#memory_int_9| |v_~#B~0.base_3|) (+ |v_~#B~0.offset_3| 4))) InVars {#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:56,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {249#true} [130] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#B~0.base_4|) (+ |v_~#B~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:56,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {249#true} [78] L683-4-->L683-5: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_11| |v_~#B~0.base_5|) (+ |v_~#B~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:56,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {249#true} [131] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#B~0.base_6|) (+ |v_~#B~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:56,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {249#true} [106] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:56,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {249#true} [142] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {249#true} is VALID [2022-02-20 20:40:56,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {249#true} [118] 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] {249#true} is VALID [2022-02-20 20:40:56,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {249#true} [87] L-1-5-->L693: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#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_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre3#1] {249#true} is VALID [2022-02-20 20:40:56,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {249#true} [127] L693-->L693-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] {249#true} is VALID [2022-02-20 20:40:56,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {249#true} [80] L693-1-->L694: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {249#true} is VALID [2022-02-20 20:40:56,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {249#true} [91] L694-->L694-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {249#true} is VALID [2022-02-20 20:40:56,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {249#true} [114] L694-1-->L694-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~pre3#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int] {249#true} is VALID [2022-02-20 20:40:56,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {249#true} [158] L694-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre3#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#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_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#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_thidvar0, t_funThread1of1ForFork0_#res.offset] {249#true} is VALID [2022-02-20 20:40:56,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {249#true} [86] L694-3-->L694-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {249#true} is VALID [2022-02-20 20:40:56,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {249#true} [90] L694-4-->L695: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {249#true} is VALID [2022-02-20 20:40:56,298 INFO L290 TraceCheckUtils]: 34: Hoare triple {249#true} [140] L695-->L695-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#A~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet5#1_2| 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))) (= (select .cse0 |v_~#A~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet5#1] {249#true} is VALID [2022-02-20 20:40:56,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {249#true} [109] L695-1-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {249#true} is VALID [2022-02-20 20:40:56,298 INFO L290 TraceCheckUtils]: 36: Hoare triple {249#true} [121] L696-->L696-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#B~0.base_7|))) (and (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#B~0.base_7| (store .cse0 |v_~#B~0.offset_7| 1))) (= (select .cse0 |v_~#B~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {249#true} is VALID [2022-02-20 20:40:56,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {249#true} [107] L696-1-->L697: 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] {249#true} is VALID [2022-02-20 20:40:56,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {249#true} [101] L697-->L698: Formula: (= 42 v_~g~0_2) InVars {} OutVars{~g~0=v_~g~0_2} AuxVars[] AssignedVars[~g~0] {249#true} is VALID [2022-02-20 20:40:56,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {249#true} [99] L698-->L699: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#B~0.base_8| (store (select |v_#pthreadsMutex_6| |v_~#B~0.base_8|) |v_~#B~0.offset_8| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#B~0.base=|v_~#B~0.base_8|, ~#B~0.offset=|v_~#B~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#B~0.base=|v_~#B~0.base_8|, ~#B~0.offset=|v_~#B~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex] {249#true} is VALID [2022-02-20 20:40:56,300 INFO L290 TraceCheckUtils]: 40: Hoare triple {249#true} [113] L699-->L699-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#B~0.base_9|))) (and (= |v_ULTIMATE.start_main_#t~nondet7#1_2| 0) (= (select .cse0 |v_~#B~0.offset_9|) 0) (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#B~0.base_9| (store .cse0 |v_~#B~0.offset_9| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet7#1] {251#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} is VALID [2022-02-20 20:40:56,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {251#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} [89] L699-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {251#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} is VALID [2022-02-20 20:40:56,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {251#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} [139] L700-->L700-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {251#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} is VALID [2022-02-20 20:40:56,302 INFO L290 TraceCheckUtils]: 43: Hoare triple {251#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} [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] {251#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} is VALID [2022-02-20 20:40:56,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {251#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} [148] L685-->L685-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_14| |v_~#B~0.base_11|))) (and (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#B~0.base_11| (store .cse0 |v_~#B~0.offset_11| 1))) (= (select .cse0 |v_~#B~0.offset_11|) 0) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#B~0.base=|v_~#B~0.base_11|, ~#B~0.offset=|v_~#B~0.offset_11|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#B~0.base=|v_~#B~0.base_11|, ~#B~0.offset=|v_~#B~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {250#false} is VALID [2022-02-20 20:40:56,303 INFO L290 TraceCheckUtils]: 45: Hoare triple {250#false} [149] L685-1-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {250#false} is VALID [2022-02-20 20:40:56,303 INFO L290 TraceCheckUtils]: 46: Hoare triple {250#false} [150] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#A~0.base_9|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet2_1| 0) (= (select .cse0 |v_~#A~0.offset_9|) 0) (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#A~0.base_9| (store .cse0 |v_~#A~0.offset_9| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_1|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2] {250#false} is VALID [2022-02-20 20:40:56,303 INFO L290 TraceCheckUtils]: 47: Hoare triple {250#false} [151] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2] {250#false} is VALID [2022-02-20 20:40:56,304 INFO L290 TraceCheckUtils]: 48: Hoare triple {250#false} [152] L687-->L688: Formula: (= 17 v_~g~0_4) InVars {} OutVars{~g~0=v_~g~0_4} AuxVars[] AssignedVars[~g~0] {250#false} is VALID [2022-02-20 20:40:56,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {250#false} [144] L700-1-->L700-2: Formula: (= (ite (= 42 v_~g~0_3) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|) InVars {~g~0=v_~g~0_3} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_3} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {250#false} is VALID [2022-02-20 20:40:56,304 INFO L290 TraceCheckUtils]: 50: Hoare triple {250#false} [98] L700-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] {250#false} is VALID [2022-02-20 20:40:56,304 INFO L290 TraceCheckUtils]: 51: Hoare triple {250#false} [100] 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] {250#false} is VALID [2022-02-20 20:40:56,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {250#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[] {250#false} is VALID [2022-02-20 20:40:56,305 INFO L290 TraceCheckUtils]: 53: Hoare triple {250#false} [103] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {250#false} is VALID [2022-02-20 20:40:56,305 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:56,306 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:56,306 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370860259] [2022-02-20 20:40:56,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370860259] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:56,306 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:56,307 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:40:56,307 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889478006] [2022-02-20 20:40:56,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:56,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 20:40:56,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:56,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:56,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:56,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:40:56,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:56,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:40:56,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:40:56,362 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 71 [2022-02-20 20:40:56,363 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 134 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:56,363 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:56,363 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 71 [2022-02-20 20:40:56,363 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:56,443 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2022-02-20 20:40:56,444 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-02-20 20:40:56,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 82 events. 2/82 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 1 based on Foata normal form. 6/88 useless extension candidates. Maximal degree in co-relation 113. Up to 13 conditions per place. [2022-02-20 20:40:56,445 INFO L132 encePairwiseOnDemand]: 65/71 looper letters, 10 selfloop transitions, 6 changer transitions 1/60 dead transitions. [2022-02-20 20:40:56,445 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 60 transitions, 172 flow [2022-02-20 20:40:56,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:40:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:40:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2022-02-20 20:40:56,449 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8262910798122066 [2022-02-20 20:40:56,449 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 176 transitions. [2022-02-20 20:40:56,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 176 transitions. [2022-02-20 20:40:56,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:56,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 176 transitions. [2022-02-20 20:40:56,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 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:56,451 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:56,452 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:56,452 INFO L186 Difference]: Start difference. First operand has 72 places, 58 transitions, 134 flow. Second operand 3 states and 176 transitions. [2022-02-20 20:40:56,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 60 transitions, 172 flow [2022-02-20 20:40:56,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 60 transitions, 162 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-02-20 20:40:56,496 INFO L242 Difference]: Finished difference. Result has 66 places, 59 transitions, 146 flow [2022-02-20 20:40:56,496 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2022-02-20 20:40:56,497 INFO L334 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2022-02-20 20:40:56,497 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 59 transitions, 146 flow [2022-02-20 20:40:56,511 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 141 states, 137 states have (on average 1.489051094890511) internal successors, (204), 140 states have internal predecessors, (204), 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:56,511 INFO L78 Accepts]: Start accepts. Automaton has has 141 states, 137 states have (on average 1.489051094890511) internal successors, (204), 140 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 20:40:56,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:56,512 INFO L470 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 146 flow [2022-02-20 20:40:56,512 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:56,512 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:56,513 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:56,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:40:56,513 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:56,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:56,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1689205470, now seen corresponding path program 1 times [2022-02-20 20:40:56,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:56,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066640275] [2022-02-20 20:40:56,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:56,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:56,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {396#true} [125] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {396#true} is VALID [2022-02-20 20:40:56,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {396#true} [110] 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] {396#true} is VALID [2022-02-20 20:40:56,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {396#true} [134] 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[] {396#true} is VALID [2022-02-20 20:40:56,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {396#true} [138] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {396#true} is VALID [2022-02-20 20:40:56,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {396#true} [96] 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[] {396#true} is VALID [2022-02-20 20:40:56,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {396#true} [126] 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[] {396#true} is VALID [2022-02-20 20:40:56,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {396#true} [116] 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[] {396#true} is VALID [2022-02-20 20:40:56,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {396#true} [119] L18-3-->L18-4: Formula: (and (= 77 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {396#true} is VALID [2022-02-20 20:40:56,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {396#true} [120] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {396#true} is VALID [2022-02-20 20:40:56,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {396#true} [79] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {398#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:56,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {398#(<= |~#A~0.base| 3)} [97] 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[] {398#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:56,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {398#(<= |~#A~0.base| 3)} [81] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {398#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:56,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {398#(<= |~#A~0.base| 3)} [137] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {398#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:56,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {398#(<= |~#A~0.base| 3)} [105] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {398#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:56,773 INFO L290 TraceCheckUtils]: 14: Hoare triple {398#(<= |~#A~0.base| 3)} [143] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {398#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:56,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {398#(<= |~#A~0.base| 3)} [88] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {398#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:56,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {398#(<= |~#A~0.base| 3)} [129] L682-7-->L683: Formula: (and (= 4 |v_~#B~0.base_1|) (= |v_~#B~0.offset_1| 0)) InVars {} OutVars{~#B~0.base=|v_~#B~0.base_1|, ~#B~0.offset=|v_~#B~0.offset_1|} AuxVars[] AssignedVars[~#B~0.base, ~#B~0.offset] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [83] 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[] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [124] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#B~0.base_2|) |v_~#B~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} AuxVars[] AssignedVars[] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [108] L683-2-->L683-3: Formula: (= 0 (select (select |v_#memory_int_9| |v_~#B~0.base_3|) (+ |v_~#B~0.offset_3| 4))) InVars {#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} AuxVars[] AssignedVars[] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [130] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#B~0.base_4|) (+ |v_~#B~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} AuxVars[] AssignedVars[] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [78] L683-4-->L683-5: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_11| |v_~#B~0.base_5|) (+ |v_~#B~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} AuxVars[] AssignedVars[] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [131] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#B~0.base_6|) (+ |v_~#B~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} AuxVars[] AssignedVars[] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [106] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [142] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,778 INFO L290 TraceCheckUtils]: 25: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [118] 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] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,779 INFO L290 TraceCheckUtils]: 26: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [87] L-1-5-->L693: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#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_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre3#1] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,779 INFO L290 TraceCheckUtils]: 27: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [127] L693-->L693-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] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,780 INFO L290 TraceCheckUtils]: 28: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [80] L693-1-->L694: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,780 INFO L290 TraceCheckUtils]: 29: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [91] L694-->L694-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [114] L694-1-->L694-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~pre3#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [158] L694-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre3#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~pre3#1=|v_ULTIMATE.start_main_#t~pre3#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_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#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_thidvar0, t_funThread1of1ForFork0_#res.offset] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [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] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [86] L694-3-->L694-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,783 INFO L290 TraceCheckUtils]: 34: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [90] L694-4-->L695: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {399#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:56,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {399#(not (= |~#B~0.base| |~#A~0.base|))} [140] L695-->L695-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#A~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet5#1_2| 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))) (= (select .cse0 |v_~#A~0.offset_7|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet5#1] {400#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:56,784 INFO L290 TraceCheckUtils]: 36: Hoare triple {400#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [109] L695-1-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {400#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:56,785 INFO L290 TraceCheckUtils]: 37: Hoare triple {400#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [121] L696-->L696-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#B~0.base_7|))) (and (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#B~0.base_7| (store .cse0 |v_~#B~0.offset_7| 1))) (= (select .cse0 |v_~#B~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {400#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:56,787 INFO L290 TraceCheckUtils]: 38: Hoare triple {400#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [107] L696-1-->L697: 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] {400#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:56,788 INFO L290 TraceCheckUtils]: 39: Hoare triple {400#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [101] L697-->L698: Formula: (= 42 v_~g~0_2) InVars {} OutVars{~g~0=v_~g~0_2} AuxVars[] AssignedVars[~g~0] {400#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:56,789 INFO L290 TraceCheckUtils]: 40: Hoare triple {400#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [99] L698-->L699: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#B~0.base_8| (store (select |v_#pthreadsMutex_6| |v_~#B~0.base_8|) |v_~#B~0.offset_8| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#B~0.base=|v_~#B~0.base_8|, ~#B~0.offset=|v_~#B~0.offset_8|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#B~0.base=|v_~#B~0.base_8|, ~#B~0.offset=|v_~#B~0.offset_8|} AuxVars[] AssignedVars[#pthreadsMutex] {400#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:56,790 INFO L290 TraceCheckUtils]: 41: Hoare triple {400#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [148] L685-->L685-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_14| |v_~#B~0.base_11|))) (and (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#B~0.base_11| (store .cse0 |v_~#B~0.offset_11| 1))) (= (select .cse0 |v_~#B~0.offset_11|) 0) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#B~0.base=|v_~#B~0.base_11|, ~#B~0.offset=|v_~#B~0.offset_11|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|, #pthreadsMutex=|v_#pthreadsMutex_13|, ~#B~0.base=|v_~#B~0.base_11|, ~#B~0.offset=|v_~#B~0.offset_11|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {401#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:40:56,790 INFO L290 TraceCheckUtils]: 42: Hoare triple {401#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [149] L685-1-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {401#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:40:56,791 INFO L290 TraceCheckUtils]: 43: Hoare triple {401#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [150] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_16| |v_~#A~0.base_9|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet2_1| 0) (= (select .cse0 |v_~#A~0.offset_9|) 0) (= |v_#pthreadsMutex_15| (store |v_#pthreadsMutex_16| |v_~#A~0.base_9| (store .cse0 |v_~#A~0.offset_9| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_16|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_15|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_1|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2] {397#false} is VALID [2022-02-20 20:40:56,791 INFO L290 TraceCheckUtils]: 44: Hoare triple {397#false} [151] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2] {397#false} is VALID [2022-02-20 20:40:56,791 INFO L290 TraceCheckUtils]: 45: Hoare triple {397#false} [152] L687-->L688: Formula: (= 17 v_~g~0_4) InVars {} OutVars{~g~0=v_~g~0_4} AuxVars[] AssignedVars[~g~0] {397#false} is VALID [2022-02-20 20:40:56,791 INFO L290 TraceCheckUtils]: 46: Hoare triple {397#false} [153] L688-->L689: Formula: (= (store |v_#pthreadsMutex_18| |v_~#A~0.base_10| (store (select |v_#pthreadsMutex_18| |v_~#A~0.base_10|) |v_~#A~0.offset_10| 0)) |v_#pthreadsMutex_17|) InVars {#pthreadsMutex=|v_#pthreadsMutex_18|, ~#A~0.offset=|v_~#A~0.offset_10|, ~#A~0.base=|v_~#A~0.base_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#A~0.offset=|v_~#A~0.offset_10|, ~#A~0.base=|v_~#A~0.base_10|} AuxVars[] AssignedVars[#pthreadsMutex] {397#false} is VALID [2022-02-20 20:40:56,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {397#false} [113] L699-->L699-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#B~0.base_9|))) (and (= |v_ULTIMATE.start_main_#t~nondet7#1_2| 0) (= (select .cse0 |v_~#B~0.offset_9|) 0) (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#B~0.base_9| (store .cse0 |v_~#B~0.offset_9| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet7#1] {397#false} is VALID [2022-02-20 20:40:56,792 INFO L290 TraceCheckUtils]: 48: Hoare triple {397#false} [89] L699-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {397#false} is VALID [2022-02-20 20:40:56,792 INFO L290 TraceCheckUtils]: 49: Hoare triple {397#false} [139] L700-->L700-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#false} is VALID [2022-02-20 20:40:56,792 INFO L290 TraceCheckUtils]: 50: Hoare triple {397#false} [144] L700-1-->L700-2: Formula: (= (ite (= 42 v_~g~0_3) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|) InVars {~g~0=v_~g~0_3} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_3} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {397#false} is VALID [2022-02-20 20:40:56,793 INFO L290 TraceCheckUtils]: 51: Hoare triple {397#false} [98] L700-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] {397#false} is VALID [2022-02-20 20:40:56,793 INFO L290 TraceCheckUtils]: 52: Hoare triple {397#false} [100] 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] {397#false} is VALID [2022-02-20 20:40:56,793 INFO L290 TraceCheckUtils]: 53: Hoare triple {397#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[] {397#false} is VALID [2022-02-20 20:40:56,793 INFO L290 TraceCheckUtils]: 54: Hoare triple {397#false} [103] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {397#false} is VALID [2022-02-20 20:40:56,794 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:56,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:56,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066640275] [2022-02-20 20:40:56,795 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066640275] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:56,795 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:56,795 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:40:56,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651552385] [2022-02-20 20:40:56,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:56,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 20:40:56,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:56,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:56,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:56,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:40:56,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:56,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:40:56,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:40:56,842 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 71 [2022-02-20 20:40:56,844 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:56,844 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:56,844 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 71 [2022-02-20 20:40:56,845 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:56,974 INFO L129 PetriNetUnfolder]: 1/53 cut-off events. [2022-02-20 20:40:56,974 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-02-20 20:40:56,975 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 53 events. 1/53 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 3/55 useless extension candidates. Maximal degree in co-relation 70. Up to 8 conditions per place. [2022-02-20 20:40:56,976 INFO L132 encePairwiseOnDemand]: 67/71 looper letters, 0 selfloop transitions, 0 changer transitions 49/49 dead transitions. [2022-02-20 20:40:56,977 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 157 flow [2022-02-20 20:40:56,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:40:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:40:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 252 transitions. [2022-02-20 20:40:56,981 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7098591549295775 [2022-02-20 20:40:56,981 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 252 transitions. [2022-02-20 20:40:56,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 252 transitions. [2022-02-20 20:40:56,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:56,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 252 transitions. [2022-02-20 20:40:56,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 50.4) internal successors, (252), 5 states have internal predecessors, (252), 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:56,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 71.0) internal successors, (426), 6 states have internal predecessors, (426), 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:56,984 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 71.0) internal successors, (426), 6 states have internal predecessors, (426), 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:56,984 INFO L186 Difference]: Start difference. First operand has 66 places, 59 transitions, 146 flow. Second operand 5 states and 252 transitions. [2022-02-20 20:40:56,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 157 flow [2022-02-20 20:40:57,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-02-20 20:40:57,103 INFO L242 Difference]: Finished difference. Result has 57 places, 0 transitions, 0 flow [2022-02-20 20:40:57,103 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=57, PETRI_TRANSITIONS=0} [2022-02-20 20:40:57,104 INFO L334 CegarLoopForPetriNet]: 62 programPoint places, -5 predicate places. [2022-02-20 20:40:57,104 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 0 transitions, 0 flow [2022-02-20 20:40:57,104 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:57,104 INFO L78 Accepts]: Start accepts. Automaton has has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-02-20 20:40:57,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:57,105 INFO L470 AbstractCegarLoop]: Abstraction has has 57 places, 0 transitions, 0 flow [2022-02-20 20:40:57,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.333333333333336) internal successors, (296), 6 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:40:57,107 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 20:40:57,108 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 2 remaining) [2022-02-20 20:40:57,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:40:57,111 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 20:40:57,113 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:40:57,113 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:40:57,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:40:57 BasicIcfg [2022-02-20 20:40:57,117 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:40:57,117 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:40:57,117 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:40:57,117 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:40:57,118 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:55" (3/4) ... [2022-02-20 20:40:57,120 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:40:57,125 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2022-02-20 20:40:57,128 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 20:40:57,128 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 20:40:57,128 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 20:40:57,129 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:40:57,155 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:40:57,156 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:40:57,157 INFO L158 Benchmark]: Toolchain (without parser) took 2765.49ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 81.5MB in the beginning and 45.6MB in the end (delta: 35.9MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2022-02-20 20:40:57,157 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 79.7MB. Free memory was 42.3MB in the beginning and 42.2MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:57,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.46ms. Allocated memory is still 109.1MB. Free memory was 81.3MB in the beginning and 73.3MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 20:40:57,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.50ms. Allocated memory is still 109.1MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:57,158 INFO L158 Benchmark]: Boogie Preprocessor took 38.23ms. Allocated memory is still 109.1MB. Free memory was 71.2MB in the beginning and 69.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:57,159 INFO L158 Benchmark]: RCFGBuilder took 331.66ms. Allocated memory is still 109.1MB. Free memory was 69.8MB in the beginning and 57.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 20:40:57,159 INFO L158 Benchmark]: TraceAbstraction took 1885.47ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 56.9MB in the beginning and 47.7MB in the end (delta: 9.3MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2022-02-20 20:40:57,159 INFO L158 Benchmark]: Witness Printer took 38.69ms. Allocated memory is still 132.1MB. Free memory was 47.7MB in the beginning and 45.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:57,161 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.21ms. Allocated memory is still 79.7MB. Free memory was 42.3MB in the beginning and 42.2MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.46ms. Allocated memory is still 109.1MB. Free memory was 81.3MB in the beginning and 73.3MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.50ms. Allocated memory is still 109.1MB. Free memory was 73.3MB in the beginning and 71.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.23ms. Allocated memory is still 109.1MB. Free memory was 71.2MB in the beginning and 69.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 331.66ms. Allocated memory is still 109.1MB. Free memory was 69.8MB in the beginning and 57.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1885.47ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 56.9MB in the beginning and 47.7MB in the end (delta: 9.3MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. * Witness Printer took 38.69ms. Allocated memory is still 132.1MB. Free memory was 47.7MB in the beginning and 45.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 83 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: 1.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 88 IncrementalHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 20 mSDtfsCounter, 88 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=2, InterpolantAutomatonStates: 15, 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.5s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 346 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 20:40:57,189 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 Result: TRUE